Related papers: Normal Bases using 1-dimensional Algebraic Groups

Let p be a prime number. In this paper we use an old technique of Ore, based on Newton polygons, to construct in an efficient way p-integral bases of number fields defined by a p-regular equation. To illustrate the potential applications of…

For any finite Galois field extension $\mathsf{K}/\mathsf{F}$, with Galois group $G = \mathrm{Gal}(\mathsf{K}/\mathsf{F})$, there exists an element $\alpha \in \mathsf{K}$ whose orbit $G\cdot\alpha$ forms an $\mathsf{F}$-basis of…

Let $\textbf{U}^+$ be the positive part of the quantum group $\textbf{U}$ associated with a generalized Cartan matrix. In the case of finite type, Lusztig constructed the canonical basis $\textbf{B}$ of $\textbf{U}^+$ via two approaches.…

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…

Let $U/L$ be a finite abelian extension of number fields. We first construct a universal primitive generator of $U$ over $L$ whose relative trace to any intermediate field $F$ becomes a generator of $F$ over $L$, too. We also develop a…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

We consider the problem of mutually unbiased bases as a polynomial optimization problem over the reals. We heavily reduce it using known symmetries before exploring it using two methods, combining a number of optimization techniques. The…

We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…

Computing a basis for the exponent lattice of algebraic numbers is a basic problem in the field of computational number theory with applications to many other areas. The main cost of a well-known algorithm…

We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…

Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…

This paper computes the bases of the image of $2$-adic logarithm on the group of the principal units in all 7 quadratic extensions of $\mathbb{Q}_2$. This helps one to understand the free module structure of $2$-adic logarithm at arbitrary…

In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…

We compute the divisor class group of the general hypersurface Y of a complex projective normal variety X of dimension at least four containing a fixed base locus Z. We deduce that completions of normal local complete intersection domains…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

We study the universal cover of the complex one-dimensional torus as a model-theoretic structure in a natural language. We consider also abstract covers of one-dimensional tori over algebraically closed fields of characteristic zero. The…

In geostatistics, traditional spatial models often rely on the Gaussian Process (GP) to fit stationary covariances to data. It is well known that this approach becomes computationally infeasible when dealing with large data volumes,…