Bases of canonical number systems in quartic algebraic number fields

Horst Brunotte; Andrea Huszti; Attila Pethő

Displaying similar documents to “Bases of canonical number systems in quartic algebraic number fields”

An algebraic method for calculating the topological degree

Andrzej Łęcki, Zbigniew Szafraniec (1996)

Banach Center Publications

Similarity:

Goffin's algorithm for zonotopes

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 $n$ (where $n$ 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...

Ideal class groups, Hilbert’s irreducibility theorem, and integral points of bounded degree on curves

Aaron Levin (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We study the problem of constructing and enumerating, for any integers $m, n > 1$ , number fields of degree $n$ whose ideal class groups have “large" $m$ -rank. Our technique relies fundamentally on Hilbert’s irreducibility theorem and results on integral points of bounded degree on curves.

Ramanujan's class invariants and cubic continued fraction

Bruce C. Berndt, Heng Huat Chan, Liang-Cheng Zhang (1995)

Acta Arithmetica

Similarity:

Full-Newton step infeasible interior-point algorithm for SDO problems

Hossein Mansouri (2012)

Kybernetika

Similarity:

In this paper we propose a primal-dual path-following interior-point algorithm for semidefinite optimization. The algorithm constructs strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Each main step of the algorithm consists of a feasibility step and several centering steps. At each iteration, we use only full-Newton step. Moreover, we use a more natural feasibility step, which targets at the $μ^{+}$ -center. The iteration bound of the algorithm...