English
Related papers

Related papers: On fully split lacunary polynomials in finite fiel…

200 papers

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

Number Theory · Mathematics 2024-07-16 Thomas Brazelton , Joshua Harrington , Matthew Litman , Tony W. H. Wong

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…

Symbolic Computation · Computer Science 2020-04-22 Arkadev Chattopadhyay , Bruno Grenet , Pascal Koiran , Natacha Portier , Yann Strozecki

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Representation Theory · Mathematics 2011-05-23 Jérémy Le Borgne

In the present paper we consider $F_k(x)=x^{k}-\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree…

Classical Analysis and ODEs · Mathematics 2007-09-04 Xinyun Zhu , George Grossman

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

Complex Variables · Mathematics 2016-09-27 Eze R. Nwaeze

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Number Theory · Mathematics 2026-03-13 Laura Capuano , Sara Checcoli , Marzio Mula , Lea Terracini

We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the…

Symbolic Computation · Computer Science 2014-07-11 Bruno Grenet

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

Complex Variables · Mathematics 2011-02-15 Josep Rubió-Massegú

For a mixed characteristic complete discrete valuation field $K$ which contains a $p^n$-th root of unity, we determine the graded quotients of the filtration on the Milnor $K$-groups $K_q^M(K)$ modulo $p^n$ in terms of differential forms of…

K-Theory and Homology · Mathematics 2011-12-30 Toshiro Hiranouchi

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

Commutative Algebra · Mathematics 2007-06-11 Arnaud Bodin

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Number Theory · Mathematics 2017-04-28 Carlos D'Andrea , Alina Ostafe , Igor E. Shparlinski , Martin Sombra

We consider natural Hamiltonian systems of $n>1$ degrees of freedom with polynomial homogeneous potentials of degree $k$. We show that under a genericity assumption, for a fixed $k$, at most only a finite number of such systems is…

Exactly Solvable and Integrable Systems · Physics 2010-04-19 Maria Przybylska

Scattered polynomials over finite fields attracted an increasing attention in the last years. One of the reasons is their deep connection with Maximum Rank Distance (MRD) codes. Known classification results for exceptional scattered…

Number Theory · Mathematics 2022-06-29 Daniele Bartoli , Massimo Giulietti , Giovanni Zini

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Number Theory · Mathematics 2016-05-25 Andreas Weingartner

We obtain a sharp bound on the degree of a globally generated vector bundle over a reduced irreducible projective variety defined over an algebraically closed field of characteristic zero. As an application, we obtain a Del Pezzo-Bertini…

Algebraic Geometry · Mathematics 2008-05-28 José Carlos Sierra

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

Commutative Algebra · Mathematics 2016-02-23 M. Domokos