Related papers: Computation of unirational fields (extended abstra…
Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…
Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$,…
Over the split-octonion algebra defined over an arbitrary field, we solve all polynomial equations whose coefficients are scalar except for the constant term. As an application, we determine the square and cubic roots of an octonion.
One of the fundamental questions in current field theory, related to Grothendieck's conjecture of birational anabelian geometry, is the investigation of the precise relationship between the Galois theory of fields and the structure of the…
Using the ramification theory of tame and Kaplansky fields, we show that maximal Kaplansky fields contain maximal immediate extensions of each of their subfields. Likewise, algebraically maximal Kaplansky fields contain maximal immediate…
Let $A$ be a Dedekind domain, $K$ the fraction field of $A$, and $f\in A[x]$ a monic irreducible separable polynomial. For a given non-zero prime ideal $\mathfrak{p}$ of $A$ we present in this paper a new method to compute a…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
We generalize Burgess' results on partial Gaussian sums to arbitrary finite fields. The main ingredients are the classical method of amplification, two deep results on multiplicative energy for subsets in finite fields which are obtained…
Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
Polyhedral affinoid algebras have been introduced by Einsiedler, Kapranov and Lind to connect rigid analytic geometry (analytic geometry over non-archimedean fields) and tropical geometry. In this article, we present a theory of Gr{\"o}bner…
We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…
We present an algorithm for computing zero-dimensional tropical varieties using projections. Our main tools are fast unimodular transforms of lexicographical Gr\"obner bases. We prove that our algorithm requires only a polynomial number of…
We classify Artin-Schreier extensions of valued fields with non-trivial defect according to whether they are connected with purely inseparable extensions with non-trivial defect, or not. We use this classification to show that in positive…
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
We propose a differential analog of the notion of integral closure of algebraic function fields. We present an algorithm for computing the integral closure of the algebra defined by a linear differential operator. Our algorithm is a direct…
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…
A good way of parametrizing 0-dimensional schemes in an affine space $\mathbb{A}_K^n$ has been developed in the last 20 years using border basis schemes. Given a multiplicity $\mu$, they provide an open covering of the Hilbert scheme ${\rm…