Related papers: Root Clusters over Number fields : Inverse Problem…

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

Let $D>1$ be an integer, and let $b=b(D)>1$ be its smallest divisor. We show that there are infinitely many number fields of degree $D$ whose primitive elements all have relatively large height in terms of $b$, $D$ and the discriminant of…

We employ methods from homotopy theory to define new obstructions to solutions of embedding problems. By using these novel obstructions we study embedding problems with non-solvable kernel. We apply these obstructions to study the…

Our starting point is Mumford's conjecture, on representations of Chevalley groups over fields, as it is phrased in the preface of "Geometric Invariant Theory". After extending the conjecture appropriately, we show that it holds over an…

LP algebras, introduced by Lam and Pylyavskyy, are a generalization of cluster algebras. These algebras are known to have the Laurent phenomenon, but positivity remains conjectural. Graph LP algebras are finite LP algebras encoded by a…

We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…

In a previous paper it was shown that a certain family of varieties suggested by Lusztig, is not enough to construct all irreducible complex representations of reductive groups over finite rings coming from the ring of integers in a local…

We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…

The traditional approach of hand-crafting priors (such as sparsity) for solving inverse problems is slowly being replaced by the use of richer learned priors (such as those modeled by deep generative networks). In this work, we study the…

We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We discuss a possible generalisation of a conjecture of Bley, Burns and Hahn concerning the relation between the second Adams-operator twisted Galois-Gauss sums of weakly ramified Artin characters and the square root of the inverse…

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…

Some time ago we extended our monogenity investigations and calculations of generators of power integral bases to the relative case. Up to now we considered (usually totally real) extensions of complex quartic fields. In the present paper…

The notion of a separable extension is an important concept in Galois theory. Traditionally, this concept is introduced using the minimal polynomial and the formal derivative. In this work, we present an alternative approach to this…

This paper deals with well-known extensions of the Prufer domain concept to arbitrary commutative rings. We investigate the transfer of these notions in trivial ring extensions (also called idealizations) of commutative rings by modules and…

A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…

We study base field extensions of ordinary abelian varieties defined over finite fields using the module theoretic description introduced by Deligne. As applications we give algorithms to determine the minimal field of definition of such a…

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…