Related papers: The Complexity of Computing all Subfields of an Al…

Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…

We consider the problem of characterizing all number fields $K$ such that all algebraic integers $\alpha\in K$ can be written as the sum of distinct units of $K$. We extend a method due to Thuswaldner and Ziegler that previously did not…

Let F_q be the finite field of q elements. Let H be a multiplicative subgroup of F_q^*. For a positive integer k and element b\in F_q, we give a sharp estimate for the number of k-element subsets of H which sum to b.

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…

Let $f\in K(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In this…

This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

In this paper, we consider a problem of counting multiplicities. We fix a counting function of multiplicity of rational points in a hypersurface of a projective space over a finite field, and we give an upper bound for the sum with respect…

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

We define a notion of formal quantum field theory and associate a formal quantum field theory to K-theoretical intersection theories on Hilbert schemes of points on algebraic surfaces. This enables us to find an effective way to compute…

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…

Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…

Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates…

For $m\geq 2$, we study derivations on symbol algebras of degree $m$ over fields with characteristic not dividing $m$. A differential central simple algebra over a field $k$ is split by a finitely generated extension of $k$. For certain…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.

Let $G$ be a linear algebraic group over a field $k$ of characteristic 0. We show that any two connected semisimple $k$-subgroups of $G$ that are conjugate over an algebraic closure of $k$ are actually conjugate over a finite field…