Related papers: A Note on Powers in Finite Fields

A theorem of Christol states that a power series over a finite field is algebraic over the polynomial ring if and only if its coefficients can be generated by a finite automaton. Using Christol's result, we prove that the same assertion…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

As an application of universal polynomials for local and multi-singularities of maps, we revisit classical enumerative formulae of Salmon-Cayley-Zeuthen for projective surfaces and analogous formulae of Segre-(B.)Severi-Roth for projective…

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the…

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…

We present a survey on Weil sums in which an additive character of a finite field $F$ is applied to a binomial whose individual terms (monomials) become permutations of $F$ when regarded as functions. Then we indicate how these Weil sums…

The variational properties of the scalar so--called ``Universal'' equations are reviewed and generalised. In particular, we note that contrary to earlier claims, each member of the Euler hierarchy may have an explicit field dependence. The…

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…

We introduce a notion of refinements in the context of patching, in order to obtain new results about local-global principles and field invariants in the context of quadratic forms and central simple algebras. The fields we consider are…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Let $K$ be a field of positive characteristic with no algebraically closed subfield. Let $F$ be a function field over $K$ and $t \in F$ transcendental over $K$. Refining a result of Eisentr{\"a}ger and Shlapentokh, we show that there is no…

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…