English
Related papers

Related papers: On a conjecture of polynomials with prescribed ran…

200 papers

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$

Number Theory · Mathematics 2013-11-20 Antal Balog , George Shakan

For each integer $\ell \geq 1$, we prove an unconditional upper bound on the size of the $\ell$-torsion subgroup of the class group, which holds for all but a zero-density set of field extensions of $\mathbb{Q}$ of degree $d$, for any fixed…

Number Theory · Mathematics 2018-03-16 Jordan Ellenberg , Lillian B. Pierce , Melanie Matchett Wood

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…

Combinatorics · Mathematics 2021-09-30 Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti , Yue Zhou

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Number Theory · Mathematics 2007-10-16 K. Kononen , M. Moisio , M. Rinta-aho , K. Vaananen

Let $\mathcal{A}$ be a union-closed family of sets with universe $\bigcup_{A \in \mathcal{A}}A = [n] = \{1,\cdots,n\}$ and length $\ell$. We prove that $|\mathcal{A}| \leq \sum_{i=0}^{\ell} \binom{n}{i}$, with equality if and only if…

Combinatorics · Mathematics 2025-11-14 Christopher Bouchard

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Combinatorics · Mathematics 2018-06-21 Alexander Barvinok

Let $S\subseteq \mathbb{N}$ be a numerical semigroup with multiplicity $m$, embedding dimension $\nu$ and conductor $c=f+1=qm-\rho$ for some $q,\rho\in\mathbb{N}$ with $\rho<m$. Let Ap$(S,m) = \{w\_0<w_1 < \ldots < w_{m-1}\}$ be the Ap\'ery…

Combinatorics · Mathematics 2016-10-30 Mariam Dhayni

Let $h_{(m,k)}$ be the class number of $\mathbb{Q}(\sqrt{1-2m^k}).$ We prove that for any odd natural number $k,$ there exists $m_0$ such that $k \mid h_{(m,k)}$ for all odd $m > m_0.$ We also prove that for any odd $m \geq 3,$ $k \mid…

Number Theory · Mathematics 2024-03-06 Srilakshmi Krishnamoorthy , R. Muneeswaran

Suppose $q$ is a prime power and $f\in\mathbb{F}_q[x]$ is a univariate polynomial with exactly $t$ monomial terms and degree $<q-1$. To establish a finite field analogue of Descartes' Rule, Bi, Cheng, and Rojas (2013) proved an upper bound…

Number Theory · Mathematics 2016-07-07 Qi Cheng , Shuhong Gao , J. Maurice Rojas , Daqing Wan

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Combinatorics · Mathematics 2021-11-02 Zhicheng Gao

In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…

Algebraic Geometry · Mathematics 2015-12-15 Mario Huicochea

We prove that for every positive integer $k$ there exist an inclusion-exclusion polynomial $Q_{\{q_1,q_2,...,q_k\}}$ with the height at least $c^{2^k}\prod_{j=1}^{k-2}q_j^{2^{k-j-1}-1}$, where $c$ is a positive constant and…

Number Theory · Mathematics 2014-07-15 Bartlomiej Bzdega

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

Commutative Algebra · Mathematics 2020-07-15 William Simmons , Henry Towsner

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Logic · Mathematics 2026-04-29 Milan Rosko

In this paper we prove that assuming Schanuel's conjecture, an exponential polynomial in one variable over the algebraic numbers has only finitely many algebraic solutions. This implies a positive answer to Shapiro's conjecture for…

Logic · Mathematics 2009-10-19 Ahuva C. Shkop

The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with $1,2,3$ so that no two adjacent vertices are incident to the same sum of labels. In the last decades, several aspects of this problem have been studied in…

Combinatorics · Mathematics 2021-02-17 Julien Bensmail , Hervé Hocquard , Dimitri Lajou , Éric Sopena

We determine the $3$-class groups of $\mathbb{Q}(\sqrt[3]{p})$ and $K=\mathbb{Q}(\sqrt[3]{p},\sqrt{-3})$ when $p\equiv 4,7\bmod 9$ is a prime and $3$ is a cubic modulo $p$. This confirms a conjecture made by Barrucand-Cohn, and proves the…

Number Theory · Mathematics 2021-12-30 Jianing Li , Shenxing Zhang

We denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n…

Information Theory · Computer Science 2018-09-25 Jeffery Sun , Steven Damelin , Daniel Kaiser