中文
相关论文

相关论文: Multidimensional polynomial Szemer\'{e}di theorem …

200 篇论文

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

数论 · 数学 2016-03-28 Terence Tao , Tamar Ziegler

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

组合数学 · 数学 2016-09-07 Vitaly Bergelson , Alexander Leibman

Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…

数论 · 数学 2010-01-05 Olav Geil , Casper Thomsen

We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to one. This solves a conjecture by Aubry, Castryck,…

代数几何 · 数学 2025-07-31 Jade Nardi , Rodrigo San-José

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

组合数学 · 数学 2025-02-20 F. J. Lobillo , Paolo Santonastaso , John Sheekey

Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector…

组合数学 · 数学 2017-02-23 Eva Czabarka , Johannes Rauh , Kayvan Sadeghi , Taylor Short , Laszlo A Szekely

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

组合数学 · 数学 2021-07-21 Gil Kalai , Leonard J. Schulman

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

交换代数 · 数学 2025-09-23 Andrei Mandelshtam

We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…

数论 · 数学 2025-10-31 Isaac Rajagopal , Robin Zhang

We establish a higher dimensional counterpart of Bourgain's pointwise ergodic theorem along an arbitrary integer-valued polynomial mapping. We achieve this by proving variational estimates $V_r$ on $L^p$ spaces for all $1<p<\infty$ and…

经典分析与常微分方程 · 数学 2014-05-23 Mariusz Mirek , Bartosz Trojan

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

数论 · 数学 2017-07-12 Randell Heyman

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

历史与综述 · 数学 2011-03-17 Sunil K. Chebolu , Jan Minac

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

数论 · 数学 2025-12-24 Rishu Garg , Jitender Singh

Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the…

组合数学 · 数学 2018-10-22 Jop Briët , Sivakanth Gopi

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…

组合数学 · 数学 2021-11-02 Zhicheng Gao

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

We prove that any finite-degree polynomial functor is topologically Noetherian. This theorem is motivated by the recent resolution of Stillman's conjecture and a recent Noetherianity proof for the space of cubics. Via work by…

交换代数 · 数学 2019-05-09 Jan Draisma

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

数论 · 数学 2023-08-29 Wade Hindes , Reiyah Jacobs , Benjamin Keller , Albert Kim , Peter Ye , Aaron Zhou

We present an elementary proof that the Schur polynomial corresponding to an increasing sequence of exponents (c_0,..., c_{n-1}) with c_0 = 0 is irreducible over every field of characteristic p whenever the numbers d_i = c_{i+1} - c_i are…

交换代数 · 数学 2016-02-02 Aleksander Zabłocki

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

数论 · 数学 2013-01-17 Marina Nincevic , Sinisa Slijepcevic