On the roots of polynomials over division algebras.
Topuridze, N. (2003)
Georgian Mathematical Journal
Similarity:
Topuridze, N. (2003)
Georgian Mathematical Journal
Similarity:
Brunotte, Horst (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Dimitrov, Dimitar K., Merlo, Clinton A. (1998)
Revista Colombiana de Matemáticas
Similarity:
Diana Doličanin, Valery G. Romanovski (2005)
Kragujevac Journal of Mathematics
Similarity:
Caravenna, Francesco, Pétrélis, Nicolas (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Soon-Yi Kang (1999)
Acta Arithmetica
Similarity:
Michal Černý (2012)
Kybernetika
Similarity:
The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor (where is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial...
Maohua Le (1996)
Acta Arithmetica
Similarity:
Bruce C. Berndt, Heng Huat Chan, Liang-Cheng Zhang (1995)
Acta Arithmetica
Similarity:
Hong-Quan Liu (1993)
Acta Arithmetica
Similarity:
1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, , where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented...