A criterion for unitary congruence between complex matrices requires that a finite number of
arithmetic operations be performed. No criteria with this finiteness
Some questions on the univalence of functions of the class ΣIn this paper we give an example of two convex functions in | ζ| > 1 whose
arithmetic mean
Reducibility theorems for pairs of matrices as rational criteria that conditions of each of the theorems above can be verified using a finite number of
arithmetic operations. A
Simulation of parameters of the vapor-liquid compression cooling system of power machines the correction factors considering the difference between the mean log and the mean
arithmetic temperature
Analysis of the k-ary Euclid for tuples of integers of applications in the Number Theory, Modular
Arithmetic and the Cryptography Algorithms such as RSA, El
The minimal compound-complex sentence hierarchy of the multiple compoundcomplex sentences and try to build up the structural models
hierarchy of Minimal Compound
On the Hierarchy of the Characteristic Lengths of Nanowires MagnetizationOn the
Hierarchy of the Characteristic Lengths of Nanowires Magnetization