English
Related papers

Related papers: On the characterization of minimal value set polyn…

200 papers

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

Optimization and Control · Mathematics 2020-01-28 Vu Trung Hieu

In this paper we prove several theorems about abelian varieties over finite fields by studying the set of monic real polynomials of degree 2n all of whose roots lie on the unit circle. In particular, we consider a set V_n of vectors in R^n…

Number Theory · Mathematics 2007-05-23 Stephen A. DiPippo , Everett W. Howe

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Number Theory · Mathematics 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

Number Theory · Mathematics 2019-07-23 José Alves Oliveira , F. E. Brochero Martínez

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Algebraic Geometry · Mathematics 2009-05-29 Frederic Bihan , Frank Sottile

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

Rings and Algebras · Mathematics 2025-07-09 Peter Danchev , Esther García , Miguel Gómez Lozano

It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…

Commutative Algebra · Mathematics 2022-11-30 Mátyás Domokos , Botond Miklósi

For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…

Commutative Algebra · Mathematics 2021-07-16 Karim Johannes Becher , Parul Gupta

Let F and K be fields of characteristic 0, with F a subset of K. Let K[x] denote the ring of polynomials with coefficients in K. For p in K[x]\F[x], deg(p) = n, let r be the highest power of x with a coefficient not in F. We define the F…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alan Horwitz

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

Number Theory · Mathematics 2009-06-11 Lenny Fukshansky

In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over $ \mathbb{F}_{q^2}$. Additionally, we demonstrate that linearized polynomial over…

Number Theory · Mathematics 2024-09-30 Danyao Wu , Pingzhi Yuan

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

Information Theory · Computer Science 2014-04-22 Vakhtang Lomadze

The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce…

We investigate the density of square-free values of polynomials with large coefficients over the rational function field $\mathbb{F}_q[t]$. Some interesting questions answered as special cases of our results include the density of…

Number Theory · Mathematics 2016-05-26 Dan Carmon , Alexei Entin

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the…

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Combinatorics · Mathematics 2017-03-24 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Number Theory · Mathematics 2007-05-23 Roland Bacher