中文
相关论文

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

200 篇论文

We show that if a closed discrete subset $A \subseteq \mathbf{R}^d$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then uniqueness fails and one can prescribe arbitrary values for…

经典分析与常微分方程 · 数学 2023-06-14 Anshul Adve

We prove a geometric property of the set A^{-1} of inverses of the nonzero elements of an F_q-subspace A of a finite field involving the size of its intersection with two-dimensional F_q-subspaces. We give some applications, including a new…

环与代数 · 数学 2017-08-29 S. Mattarei

Let $f,g \in k[x]$ be nonconstant polynomials over a number field $k$. We count $S$-integer inputs $a$ for which $f(a)$ has a $k$-rational preimage under $g$, after removing the polynomial graph components $Y=h(X)$ with $f=g\circ h$. The…

数论 · 数学 2026-05-14 Henry Shin

Let $f(x)=(x^{k}+c)^{m}-ax^{n}\in\mathbb{Z}[x]$ be an irreducible polynomial over $\mathbb{Q}$, where $k,m,n\in\mathbb{N}$ with $km>n$, and let $K=\mathbb{Q}(\theta)$, where $\theta$ is a root of $f(x)$. We investigate the arithmetic…

数论 · 数学 2026-02-24 Rupam Barman , Anuj Jakhar , Ravi Kalwaniya , Prabhakar Yadav

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

数论 · 数学 2015-09-08 Michiel Kosters

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

代数几何 · 数学 2007-05-23 Alexey Glutsyuk

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

组合数学 · 数学 2018-04-23 Jan De Beule , Geertrui Van de Voorde

Let f(x) = f(x_1, ..., x_n) = \sum_{|S| <= k} a_S \prod_{i \in S} x_i be an n-variate real multilinear polynomial of degree at most k, where S \subseteq [n] = {1, 2, ..., n}. For its "one-block decoupled" version, f~(y,z) = \sum_{|S| <= k}…

离散数学 · 计算机科学 2015-12-08 Ryan O'Donnell , Yu Zhao

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

代数几何 · 数学 2019-11-06 Adrien Poteaux , Martin Weimann

We prove several results related to the theorem of Logvinenko and Sereda on determining sets for functions with Fourier transforms supported in an interval. We obtain a polynomial instead of exponential bound in this theorem, and we extend…

经典分析与常微分方程 · 数学 2007-05-23 Oleg Kovrizhkin

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

组合数学 · 数学 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

数论 · 数学 2022-11-14 Maxwell Forst , Lenny Fukshansky

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

形式语言与自动机理论 · 计算机科学 2026-05-12 Shaull Almagor , Michaël Cadilhac , Asaf Shoham

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

数论 · 数学 2022-11-22 Matteo Bordignon , Ethan Simpson Lee

A real polynomial $P(X_1,..., X_n)$ sign represents $f: A^n \to \{0,1\}$ if for every $(a_1, ..., a_n) \in A^n$, the sign of $P(a_1,...,a_n)$ equals $(-1)^{f(a_1,...,a_n)}$. Such sign representations are well-studied in computer science and…

组合数学 · 数学 2011-02-21 Saugata Basu , Nayantara Bhatnagar , Parikshit Gopalan , Richard J. Lipton

Let $Z(N)$ denote the minimum number of zeros in $[0,2\pi]$ that a cosine polynomial of the form $$f_A(t)=\sum_{n\in A}\cos nt$$ can have when $A$ is a finite set of non-negative integers of size $|A|=N$. It is an old problem of Littlewood…

经典分析与常微分方程 · 数学 2025-01-09 Benjamin Bedert

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…

经典分析与常微分方程 · 数学 2007-09-04 Xinyun Zhu , George Grossman

Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension…

交换代数 · 数学 2011-04-05 Aron Simis , Rafael H. Villarreal

Motivated by classic theorems of Thompson and Berger on the Fitting height of finite groups with a fixed-point-free automorphism of coprime order, we conjecture that, for every non-zero polynomial $f(x) = a_0 + a_1 x + \cdots + a_d x^d \in…

群论 · 数学 2021-10-19 Wolfgang Alexander Moens

Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^{d},p)$ up to a polylogarithmic factor…

组合数学 · 数学 2025-09-09 Yaobin Chen , Jiaxi Nie , Jing Yu , Wentao Zhang
‹ 上一页 1 8 9 10 下一页 ›