中文
相关论文

相关论文: S\'ark\"ozy's Theorem in Various Finite Field Sett…

200 篇论文

Erd\H{o}s, S\'ark\"ozy, and S\'os studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstra\"ete proposed a…

组合数学 · 数学 2026-01-26 Hyunwoo Lee , Chi Hoi Yip , Semin Yoo

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

计算机科学中的逻辑 · 计算机科学 2018-05-03 Ehud Hrushovski , Joël Ouaknine , Amaury Pouly , James Worrell

Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate if there exist $P\in \mathbb{C}[y_1, \dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\dots x_n^{v_{j,n}}$ with $v_{j,1}, \dots, v_{j,n} \in…

组合数学 · 数学 2023-08-09 Akshat Mudgal

In this paper we study necessary optimality conditions for the optimization problem $$\textrm{infimum}f_0(x) \quad \textrm{ subject to } \quad x \in S,$$ where $f_0 \colon \mathbb{R}^n \rightarrow \mathbb{R}$ is a polynomial function and $S…

最优化与控制 · 数学 2017-07-03 Tien-Son Pham

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

交换代数 · 数学 2007-05-23 Matthias Aschenbrenner

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…

数论 · 数学 2019-08-15 Sam Porritt

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

复变函数 · 数学 2019-03-05 Min-Hee Kim , Young-One Kim , Jungseob Lee

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

交换代数 · 数学 2016-12-07 Anuj Jakhar , Neeraj Sangwan

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

数论 · 数学 2024-05-22 James Leng

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

计算几何 · 计算机科学 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

In this paper, we compute the size of the exceptional set in a generalized Goldbach problem and show that for a given polynomial $f(x) \in \mathbb{Z}[x]$ with a positive leading coefficient, positive integers $A$, $B$, $g$ and $0 \leq i, j…

数论 · 数学 2016-03-09 Dongho Byeon , Keunyoung Jeong

Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point.…

组合数学 · 数学 2023-09-11 Angela Aguglia , Bence Csajbók , Zsuzsa Weiner

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

数论 · 数学 2014-01-28 Igor E. Shparlinski

In this short note, we introduce an analogue of Wilson's theorem for all nonzero elements $a_1,a_2,...,a_{q-1}$ of a finite filed $\mathbb{F}$ with $|\mathbb{F}|=q\geq 3$, as follows: $$ \sum_{1\leq i_1< i_2<...< i_k\leq…

数论 · 数学 2022-09-28 Mehdi Hassani

Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…

组合数学 · 数学 2025-07-08 Ethan Ackelsberg

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…

信息论 · 计算机科学 2018-09-25 Jeffery Sun , Steven Damelin , Daniel Kaiser

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

数论 · 数学 2019-02-20 Alexei Entin

This work investigates the invariance of the non-necessarily finite uniform dimension and related concepts for subextensions in skew polynomial rings \mbox{$ \mathbb{S}=R[ \mathbf{\mathrm{X}}; \mathbf{\alpha} , \mathbf{\delta} ]$} of…

环与代数 · 数学 2026-02-04 Bertrand Nguefack

Using the notion of higher-order Fourier dimension introduced in \cite{M2} (which was a sort of psuedorandomness condition stemming from the Gowers norms of Additive Combinatorics), we prove a maximal theorem and corresponding…

经典分析与常微分方程 · 数学 2013-08-16 Marc Carnovale

We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…

计算复杂性 · 计算机科学 2022-05-17 Nashlen Govindasamy , Tuomas Hakoniemi , Iddo Tzameret