Next Article in Journal
An Inertial Generalized Viscosity Approximation Method for Solving Multiple-Sets Split Feasibility Problems and Common Fixed Point of Strictly Pseudo-Nonspreading Mappings
Next Article in Special Issue
On the Colored and the Set-Theoretical Yang–Baxter Equations
Previous Article in Journal
On a Viscosity Iterative Method for Solving Variational Inequality Problems in Hadamard Spaces
Previous Article in Special Issue
Some Inequalities for Convex Sets
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Unification Theories: Means and Generalized Euler Formulas

by
Radu Iordanescu
,
Florin Felix Nichita
* and
Ovidiu Pasarescu
Simion Stoilow Institute of Mathematics of the Romanian Academy, 21 Calea Grivitei Street, 010702 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Submission received: 16 November 2020 / Revised: 12 December 2020 / Accepted: 16 December 2020 / Published: 20 December 2020

Abstract

:
The main concepts in this paper are the means and Euler type formulas; the generalized mean which incorporates the harmonic mean, the geometric mean, the arithmetic mean, and the quadratic mean can be further generalized. Results on the Euler’s formula, the (modified) Yang–Baxter equation, coalgebra structures, and non-associative structures are also included in the current paper.
MSC:
16T25; 17A01; 17B01; 17C50; 16T15; 26D07; 32A99; 00A35; 03B05; 06A05

1. Introduction

The current paper continues the study of unification theories, by examples and applications; according to [1], “it is essential, if mathematics is to stay as a whole and not become a pile of little bits of research, to provide a unification, which absorbs in some simple and general theories all the common substrata of the diverse branches (⋯). This is the good one can achieve with axiomatics”.
The initial motivation of our study on means was a question about how to express the classical mean inequalities in a single formula. The generalized mean interpolates the harmonic mean, the geometric mean, the arithmetic mean, and the quadratic mean. It can be further generalized (using functions without critical points). Several new Euler type formulas were already proposed [2,3,4,5,6], and one could consider the common features of these formulas. Again a unification problem! Because some related representative coalgrebras were unified in previous papers, the answer to this question (without verbs, and formulated as an exclamation) was expected to be positive. Thus, we will unify the above versions of the Euler’s formula in one theorem.
The current paper is organized as follows. After recalling the terminology on means, we present the functions O, N, and M r which interpolate the classical means. Their properties are not completely understood. Other basic inequalities are recommended (for undergraduate students). We think that behind these there might be deeper phenomena.
The next section refer to Euler’s formula. There exist an Euler’s formula for hyperbolic functions and an Euler’s formula for dual numbers. All of these formulas are unified by a more general formula:
e z J = c ( z ) + J s ( z ) ,
where J is a matrix, and the functions c and s might not be cos and sin, but they behave like them, in the sense that they verify some trigonometric type identities. The colored Yang–Baxter equation is also related to this generalized Euler formula, and this fact is made more explicit in corollaries and a remark.
Section 5 combines results on means inequalities, Euler’s formula, non-associative algebras, and coalgebra structures. Classical means are extended for complex numbers. (At this point, the Euler’s formula can be thought of as a mean.) We also discuss about a modified Yang–Baxter equation. The non-associative algebras results are related to a talk given at the 14th International Workshop on Differential Geometry and Its Applications, UPG Ploiesti, 2019. Remark 13 sustains the above statement on the unification of certain coalgebra structures.
A short section with commentaries will conclude this paper.
We will work over the fields R and C . The tensor products will be defined over C . As usual, we write M n ( C ) for the ring of all n × n -matrices over the field C . In particular, we write I for the identity matrix in M 4 ( C ) , respectively, I for the identity matrix in M 2 ( C ) .

2. Classical Means—Terminology and Interpretations

We first recall the definitions of some of the most used means from mathematics.
The harmonic mean: H = H ( a 1 , , a n ) = n 1 a 1 + + 1 a n , a 1 , , a n R * ;
The geometric mean: G = G ( a 1 , , a n ) = a 1 a 2 a n n , a 1 , , a n R + ;
The arithmetic mean: A = A ( a 1 , , a n ) = a 1 + + a n n , a 1 , , a n R ;
The quadratic mean: Q = Q ( a 1 , , a n ) = a 1 2 + + a n 2 n , a 1 , , a n R ;
The generalized mean: m ( α ) = m α ( a 1 , , a n ) = a 1 α + . . . + a n α n α , a 1 , , a n R + , α 1 , α N .
Remark 1.
We note that m ( 1 ) = A and m ( 2 ) = Q , for a 1 , , a n R + .
Remark 2.
Let us consider the function (of α), m ( α ) = a 1 α + + a n α n 1 α , α R * . One can extend the function m ( α ) to R , by assigning m ( 0 ) = m G . This is a natural extension because lim α 0 m α ( a 1 , , a n ) = m G ( a 1 , , a n ) .
Remark 3.
It makes sense now to write: m ( 0 ) = G and m ( 1 ) = H . Thus, at this moment, we can say that the harmonic mean, the geometric mean, the arithmetic mean, and the quadratic mean are included in the generalized mean (for a 1 , , a n R + ).
It is well-known that m ( α ) = a 1 α + + a n α n 1 α ( m ( 0 ) = G ) is an increasing function. In particular:
m ( 2 ) m ( 1 ) = m H m ( 0 ) = m G m ( 1 ) = m A m ( 2 ) = m Q m ( 3 )
Now, we consider the following function, which is a generalization of the above function m ( α ) .
Theorem 1.
Let O : R × R R , be defined by the folowing rule:
O ( x , y ) = a 1 x + + a n x a 1 y + + a n y 1 x y for x y , O ( x , x ) = e a 1 x ln a 1 + + a n x ln a n a 1 x + + a n x .
Then, the function O has the following properties:
1.
It is a continuous function.
2.
O ( x , y ) = O ( y , x ) x , y R .
3.
For any fixed x 0 R , the function f ( y ) = O ( x 0 , y ) is a strongly increasing function.
4.
For any fixed y 0 R , the function g ( x ) = O ( x , y 0 ) is a strongly increasing function.
Remark 4.
We can easily see that: O ( 1 , 0 ) = H , O ( 0 , 0 ) = G , O ( 1 , 0 ) = A , O ( 2 , 0 ) = Q , and, in general, O ( α , 0 ) = m ( α ) .
In addition, one can show that: O ( x , x ) = e a 1 x ln a 1 + + a n x ln a n a 1 x + + a n x = a 1 a 1 x a 1 x + + a n x a n a n x a 1 x + + a n x (it follows more clearly now that O ( 0 , 0 ) = G ).
Proof 
(Proof of Theorem 1). We now prove the first claim. We denote r : = x y .
lim x y a 1 x + + a n x a 1 y + + a n y 1 x y =
lim r 0 [ 1 + a 1 y ( a 1 r 1 ) + + a n y ( a n r 1 ) a 1 y + + a n y a 1 y + + a n y a 1 y ( a 1 r 1 ) + + a n y ( a n r 1 ) ] a 1 y a 1 r 1 r + + a n y a n r 1 r a 1 y + + a n y =
a 1 a 1 x a 1 x + + a n x a n a n x a 1 x + + a n x .
This proves the continuity.
We will jump now to the third claim. (The proofs of 2 and 4 will then be immediate).
For any fixed x 0 R , we will prove that f ( y ) = y O ( x 0 , y ) > 0 , y R { x 0 } . This implies that f ( y ) is increasing on ( , x 0 ) and ( x 0 , ) and, being continuous in ( x 0 , x 0 ) , it follows that it is an increasing function on R .
We will differentiate ln f ( y ) = ln ( a 1 y + + a n y ) ln ( a 1 x + + a n x ) y x ; thus, we get
f ( y ) f ( y ) = ( a 1 y ln a 1 + + a n y ln a n ( a 1 y + + a n y ( y x ) [ ln ( a 1 y + + a n y ) ln ( a 1 x + + a n x ) ] ( y x ) 2 .
Let us denote α ( t ) = ln ( a 1 t + + a n t ) .
Then, by the Lagrange Theorem, α ( y ) α ( x ) = ( y x ) α ( ζ ) , ζ ( x , y ) ; thus,
f ( y ) = f ( y ) a 1 y ln a 1 + + a n y ln a n a 1 y + + a n y ( y x ) a 1 ζ ln a 1 + + a n ζ ln a n a 1 y + + a n y ( y x ) ( y x ) 2 = f ( y ) a 1 y ln a 1 + + a n y ln a n a 1 y + + a n y a 1 ζ ln a 1 + + a n ζ ln a n a 1 y + + a n y ( y x )
Let u ( t ) = a 1 t ln a 1 + + a n t ln a n a 1 t + + a n t ; so, f ( y ) = f ( y ) u ( y ) u ( ζ ) y x , with ζ ( x , y ) .
It is enough to prove that u(t) is an increasing function.
However, u ( t ) = ( a 1 t ln 2 a 1 + + a n t ln 2 a n ) ( a 1 t + + a n t ) ( a 1 t ln a 1 + + a n t ln a n ) 2 ( a 1 t + + a n t ) 2 , and it is greater than or equal to zero by the Cauchy–Schwarz inequality.  □

3. Means Unification and New Inequalities

Definition 1.
For strictly positive real numbers a j , 1 j n + 1 , we consider the real function
N : R n R , N ( x 1 , , x n ) = a 1 x + 1 + + a n + 1 x + 1 a 2 x 1 a n + 1 x n + a 3 x 1 a n + 1 x n 1 a 1 x n + + a 1 x 1 a 2 x 2 a n x n
where we have used the notation x : = x 1 + + x n .
Remark 5.
We can see that:
N ( 0 , , 0 ) = A , N ( 1 n + 1 , , 1 n + 1 ) = G , N ( 1 , 0 , , 0 ) = H .
The properties of the fuction N ( x 1 , , x n ) , for the case n = 2 , were presented in [4].
We will restict our study to the case of means of two numbers in the remaining of this section. We will introduce additional notation below.
Remark 6.
For three real numbers a > 0 , b > 0 , and r > 0 , the real function
M r : R R , M r ( x ) = a x + b x a x r + b x r 1 r is an increasing function.
One way to prove this fact is by direct computations. Alternatively, the proof follows as a particular case of Theorem 1. The function M r is also related to the function N ( x 1 , , x n ) from the Definition 1.
What is the relationship between M r ( x ) and M p ( y ) ? A tentative answer is given below.
Theorem 2.
The following inequality for real numbers, where a > 0 , b > 0 , and x y ,
M r ( x ) = a x + b x a x r + b x r 1 r a y + b y a y p + b y p 1 p = M p ( y )
holds for the following additional conditions:
(i) 
p = r ;
(ii) 
p = 1 2 , r = 1 , x = y ;
(iii) 
p = 1 , r = 1 2 and x + 1 2 = y .
Proof. 
A direct proof is suggested.  □
We now present inequalities which follow directly from the above Theorem 2 ( for a > 0 , b > 0 ):
2 1 a + 1 b 2 1 a + 1 b 2 a b a + b 2 2 a + b 2 a + b a b a 2 + b 2 a + b .
More demanding are the inequalities given below ( a > 0 , b > 0 ):
a + b 2 a 3 2 + b 3 2 2 2 3 a 2 + b 2 2 a + b a b .
It could be an interesting exercise for undergraduate students to prove the above inequalities using only basic algebra.
Remark 7.
Note also the following types of inequalities for means ( a > 0 , b > 0 ):
a b a + b 2 + a b + 2 1 a + 1 b 3 a + b 2 + 2 1 a + 1 b 2 .
Again, it is surprising that the above inequalities can be proved by hand. They could be part of a Calculus homework.
Remark 8.
It is an open problem to prove that, for p r , M r ( x ) M p ( x ) x R .
In addition, we conjecture that M r ( x ) M p ( y ) x r y p .
Future investigations will try to extend the conditions (i–iii) in the above Theorem 2, and to prove versions of the above inequalities with more variables.

4. Generalized Euler Formula

In this section, we will identify linear applications with matrices, without explicitly mentioning this fact. The exponential function of a matrix is thought as the Taylor expansion of the real exponential function evaluated at the given matrix.
Theorem 3.
Let J M n ( C ) be such that
( J I ) ( I J ) = ( I J ) ( J I )
If e z J = R ( z ) , z C , then the colored Yang–Baxter equation is satisfied:
( R I ) ( z ) ( I R ) ( z + w ) ( R I ) ( w ) = ( I R ) ( w ) ( R I ) ( z + w ) ( I R ) ( z ) .
Proof. 
The proof will use the property (5) and the formula R ( z ) = e z J = 0 z n n ! J n . One can now reduce the condition (6) to a simpler relation, z ( J I ) + ( z + w ) ( I J ) + w ( J I ) = w ( I J ) + ( z + w ) ( J I ) + z ( I J ) , which is easily verified.  □
Theorem 4.
For J M n ( C ) , J 2 = α I ( α C ) , there exist two functions c , s : C C ,
c ( z + w ) = c ( z ) c ( w ) + α s ( z ) s ( w ) , s ( z + w ) = s ( z ) c ( w ) + c ( z ) s ( w ) , such that:
e z J = c ( z ) I + s ( z ) J .
The functions c and s could have the following forms:
(i) 
if α = 0 in the above case, then c ( z ) = 1 and s ( z ) = z , or c ( z ) = 0 and s ( z ) = 0 ;
(ii
if α = β 2 0 , then c ( z ) = cosh ( β z ) and s ( z ) = sinh ( β z ) β .
Proof. 
We will now prove the general statement. Because e z J = 0 z n n ! J n and J 2 = α I (with α C ), it follows that e z J = c ( z ) I + s ( z ) J for some complex functions c , s : C C .
We want to show that the functions c and s have the above properties. However, e z J e w J = e ( z + w ) J implies that ( c ( z ) I + s ( z ) J ) ( c ( w ) I + s ( w ) J ) = c ( z + w ) I + s ( z + w ) J .
The condition ( c ( z ) c ( w ) + α s ( z ) s ( w ) ) I + ( s ( z ) c ( w ) + c ( z ) s ( w ) ) J = c ( z + w ) I + s ( z + w ) J implies the properties of c and s.
The last part of the proof is based on the analysis of the terms of the series e z J = 0 z n n ! J n . The case β = 0 is included in (i). It is easier now to check directly that the sum of the functions given in (ii) is equal to e z J .  □
Remark 9.
If J = i I, formula (7) is equivalent with e i x = cos x + i sin x .
Corollary 1.
If we consider the complex valuated matrix J = 0 V 0 0 , where V = c d 0 c ( c , d C ), then J 2 = 0 4 , ( J I ) ( I J ) = ( I J ) ( J I ) , I + J x = e x J = R ( x ) and
( R I ) ( x ) ( I R ) ( x + y ) ( R I ) ( y ) = ( I R ) ( y ) ( R I ) ( x + y ) ( I R ) ( x ) .
Corollary 2.
If J = 0 W X 0 , where W = 0 1 i 0 and X = 0 i 1 0 , then e z J = cos ( z ) I + sin ( z ) J , which is a solution for (6).
Corollary 3.
If J = 0 U U 0 , where U = 0 1 1 0 , then e z J = cosh ( z ) I + sinh ( z ) J ; this is also a solution for (6).

5. Means, Euler Formulas, Non-Associative Algebras, and Coalgebra Structures

After a shor digression on the Euler’s formula and the Yang–Baxter equation, we are back to means, in an attempt to extend their domain to the complex numbers (using Euler’s formula).
Theorem 5.
For z , w C , such that z = ρ e i α , w = ρ e i β , with α , β [ 0 , 2 π ) , we define:
A ( z , w ) = z + w 2 , G ( z , w ) = ρ ρ e i α + β 2 , H ( z , w ) = 2 z w z + w , if z w 0 , otherwise
If α = β or ρ M a x 7 ρ m i n , then:
H     G     A
Proof. 
For α = β , the inequalities H     G     A are equivalent to the classical means inequalities.
The inequality G     A is equivalent to finding x R such that x 2 + 2 [ cos ( α β ) 2 ] x + 1 0 .
The last part of the theorem is left for the interested reader. It also will be treated in detail in the nearest future.  □
Remark 10.
For z , w C , we define:
Q ( z , w ) = z + i w 2 ,
For α = β , the inequalities H     G     A     Q are equivalent to the usual inequalities for means.
For A M n ( C ) and D M n ( C ) being a diagonal matrix, we proposed (see [7]) the problem of finding X M n ( C ) such that
A X A + X A X = D
Equation (11) is a type of Yang–Baxter matrix equation if D = O n and X = Y . It is related to the three matrix problem, and it can be interpretated as “a generalized eigenvalue problem”.
For A M 2 ( C ) , there is a matrix with trace −1, and
D = d e t ( A ) 0 0 d e t ( A )
Equation (11) has a solution X = I .
Remark 11.
If A = ( J I ) and X = ( I J ) as in formula (5), then (11) reduces to
( J 2 I ) ( I J ) + ( J I ) ( I J 2 ) = D .
If J 2 = 0 , we obtain a solution; in particular, for J = 0 V 0 0 , where V = c d 0 c , c , d C , the pair A = ( J I ) and X = ( I J ) is a solution for (11).
Definition 2.
For a C -space V, let η : V V V , a b a b , be a linear map such that:
( a b ) c + ( b c ) a + ( c a ) b = a ( b c ) + b ( c a ) + c ( a b ) ,
( a 2 b ) a = a 2 ( b a ) , ( a b ) a 2 = a ( b a 2 ) , ( b a 2 ) a = ( b a ) a 2 , a 2 ( a b ) = a ( a 2 b ) ,
a , b , c V . Then, ( V , η ) is called a UJLA structure.
Remark 12.
If ( A , θ ) , where θ : A A A , θ ( a b ) = a b , is a (non-unital) associative algebra over C , then we define a UJLA structure ( A , θ ) , where θ ( a b ) = a b cos α + b a sin α , for α R . For α = π 4 , ( A , θ ) is a Jordan algebra; for α = 3 π 4 , ( A , θ ) is a Lie algebra.
Theorem 6.
If ( A , θ ) , where θ : A A A , θ ( a b ) = a b , is a (non-unital) associative algebra over C , then we define a UJLA structure ( A , θ ) , where θ ( a b ) = θ α ( a b ) = a b cos α + i b a sin α , for α C . The following properties happen:
(i) 
If α = π 2 , then ( A , ( i ) θ ) is just the opposite algebra (and if α = 0 , then θ ( a b ) = θ ( a b ) ).
(ii) 
For the product θ α and β C , we associate another product θ β ( a b ) = θ α ( a b ) cos β + θ α ( b a ) sin β . Then, θ β ( a b ) = θ α + β ( a b ) = a b cos ( α + β ) + i b a sin ( α + β ) .
(iii) 
If the initial algebra is commutative, then θ ( a b ) = θ α ( a b ) = e i α a b .
Proof. 
The statements (i) and (iii) can be proved directly. For (ii), we observe that θ α ( a b ) cos β + θ α ( b a ) sin β = ( a b cos α + i b a sin α ) cos β + i ( b a cos α + i a b sin α ) sin β = a b cos α cos β a b sin α sin β + i b a sin α cos β + i b a cos α sin β = a b ( cos α cos β sin α sin β ) + i b a ( sin α cos β + cos α sin β ) = a b cos ( α + β ) + i b a sin ( α + β ) .  □
Theorem 7.
For ( V , η ) a UJLA structure, D ( x ) = D b ( x ) = b x x b is a UJLA–derivation (i.e., D ( a 2 a ) = D ( a 2 ) a + a 2 D ( a ) a V ).
Proof. 
In Formula (13), we take c = a 2 : ( a b ) a 2 + ( b a 2 ) a + ( a 2 a ) b = a ( b a 2 ) + b ( a 2 a ) + a 2 ( a b ) .
It follows from (14) that ( b a 2 ) a + ( a 2 a ) b = b ( a 2 a ) + a 2 ( a b ) .
Thus, ( b a 2 ) a a 2 ( a b ) = b ( a 2 a ) ( a 2 a ) b ; so, b ( a 2 a ) ( a 2 a ) b = ( b a 2 a 2 b ) a + a 2 ( b a a b ) .
Thus, D ( a 2 a ) = D ( a 2 ) a + a 2 D ( a ) .  □
Remark 13.
Formula (7) can be interpretated in terms of coalgebras (see [7,8]). There exists a coalgebra C [ X ] X 2 = C [ a ] , where a 2 = α = β 2 C , generated by two generators c and s, such that:
Δ ( c ) = u u + α s s , Δ ( s ) = c s + s c , ε ( c ) = 1 , ε ( s ) = 0 .
Now, formula (7) leads to the subcoalgebra generated by u + β s .
For β = i , we obtain the trigonometric coalgebra. (It was shown by S. Catoiu that it can be extended to a bialgebra.) The subcoalgebra generated by c + i s related to the Euler’s formula.
For β = 1 , we obtain a coalgebra generated by c and s, such that Δ ( c ) = u u + s s , Δ ( s ) = c s + s c , ε ( c ) = 1 and ε ( s ) = 0 . There exists a subcoalgebra generated by c + s , related to the Euler formula for hyperbolic functions.

6. Final Comments and Implications

At the end of this trip through several branches of mathematics, we will add a few words. As we continued our work on unification theories begun in previous papers (see, for example, [2,4,7,9,10]), the unification approaches led us to new results. The Yang–Baxter equation (see [11,12,13,14]) can be interpreted in terms of logical circuits and, in logic, it represents a kind of compatibility condition when working with many logical sentences at the same time. In this type of logic, we work at the same time with sentences that contradict each other. This discussion will be continued later, and will be also related to literature.

Author Contributions

The authors met at workshops, had private meetings, and published related papers; supervision, R.I.; Section 2 is entirely due to O.P.; validation, R.I., O.P. and F.F.N. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors are grateful for the support received from the Referees, the Editors and the Editorial Staff.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wikiquote—Andre Weil. Available online: https://en.wikiquote.org/wiki/Andre_Weil (accessed on 18 December 2020).
  2. Marcus, S.; Nichita, F.F. On Transcendental Numbers: New Results and a Little History. Axioms 2018, 7, 15. [Google Scholar] [CrossRef] [Green Version]
  3. Ludkowski, S.V. Octonion Measures for Solutions of PDEs. Adv. Appl. Clifford Algebr. 2020, 30, 39. [Google Scholar] [CrossRef]
  4. Nichita, F.F. Mathematics and Poetry · Unification, Unity, Union. Science 2020, 2, 72. [Google Scholar] [CrossRef]
  5. Ludkovsky, S.V. Differentiable functions of Cayley-Dickson numbers and line integration. J. Math. Sci. 2007, 141, 1231–1298. [Google Scholar] [CrossRef]
  6. Ludkovsky, S.V.; van Oystaeyen, F. Differentiable functions of quaternion variables. Bull. Sci. Math. 2003, 127, 755–796. [Google Scholar] [CrossRef] [Green Version]
  7. Nichita, F.F. Unification Theories: Examples and Applications. Axioms 2018, 7, 85. [Google Scholar] [CrossRef] [Green Version]
  8. Majid, S. A Quantum Groups Primer; Cambridge University Press: Cambridge, UK, 2002. [Google Scholar]
  9. Nichita, F.F. Unification Theories: New Results and Examples. Axioms 2019, 8, 60. [Google Scholar] [CrossRef] [Green Version]
  10. Iordanescu, R.; Nichita, F.F.; Nichita, I.M. The Yang–Baxter Equation, (Quantum) Computers and Unifying Theories. Axioms 2014, 3, 360–368. [Google Scholar] [CrossRef] [Green Version]
  11. Oner, T.; Senturk, I.; Oner, G. An Independent Set of Axioms of MV-Algebras and Solutions of the Set-Theoretical Yang–Baxter Equation. Axioms 2017, 6, 17. [Google Scholar] [CrossRef] [Green Version]
  12. Oner, T.; Katican, T. On Solutions to the Set–Theoretical Yang–Baxter Equation in Wajsberg–Algebras. Axioms 2018, 7, 6. [Google Scholar] [CrossRef] [Green Version]
  13. Nichita, F.F. (Ed.) Hopf Algebras, Quantum Groups and Yang–Baxter Equations; MDPI: Basel, Switzerland, 2019; ISBN1 978-3-03897-324-9 (Pbk). ISBN2 978-3-03897-325-6 (PDF). [Google Scholar]
  14. Oner, T.; Katican, T. Interval Sheffer Stroke Basic Algebras and Yang–Baxter Equation. preprint, February 2020. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Iordanescu, R.; Nichita, F.F.; Pasarescu, O. Unification Theories: Means and Generalized Euler Formulas. Axioms 2020, 9, 144. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms9040144

AMA Style

Iordanescu R, Nichita FF, Pasarescu O. Unification Theories: Means and Generalized Euler Formulas. Axioms. 2020; 9(4):144. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms9040144

Chicago/Turabian Style

Iordanescu, Radu, Florin Felix Nichita, and Ovidiu Pasarescu. 2020. "Unification Theories: Means and Generalized Euler Formulas" Axioms 9, no. 4: 144. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms9040144

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop