中文
相关论文

相关论文: On an Argument of Shkredov on Two-Dimensional Corn…

200 篇论文

We obtain quantitative versions of the Balog-Szemeredi-Gowers and Freiman theorems in the model case of a finite field geometry F_2^n, improving the previously known bounds in such theorems. For instance, if A is a subset of F_2^n such that…

组合数学 · 数学 2007-11-13 Ben Green , Terence Tao

Suppose that $S \subseteq [n]^2$ contains no three points of the form $(x,y), (x,y+\delta), (x+\delta,y')$, where $\delta \neq 0$. How big can $S$ be? Trivially, $n \le |S| \le n^2$. Slight improvements on these bounds are obtained from…

组合数学 · 数学 2023-09-12 Kevin Pratt

In an additive group (G,+), a three-dimensional corner is the four points g, g+d(1,0,0), g+d(0,1,0), g+d(0,0,1), where g is in G^3, and d is a non-zero element of G. The Ramsey number of interest is R_3(G) the maximal cardinality of a…

数论 · 数学 2008-04-21 Michael T. Lacey , William McClain

Let p > 4 be a prime. We show that the largest subset of F_p^n with no 4-term arithmetic progressions has cardinality << N(log N)^{-c}, where c = 2^{-22} and N := p^n. A result of this type was claimed in a previous paper by the authors and…

数论 · 数学 2012-05-08 Ben Green , Terence Tao

A corner is a set of three points in $\mathbf{Z}^2$ of the form $(x, y), (x + d, y), (x, y + d)$ with $d \neq 0$. We show that for infinitely many $N$ there is a set $A \subset [N]^2$ of size $2^{-(c + o(1)) \sqrt{\log_2 N}} N^2$ not…

组合数学 · 数学 2021-03-11 Ben Green

Let G be a finite Abelian group and A be a subset G\times G of cardinality at least |G|^2/(log log |G|)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d does not equal 0. This…

数论 · 数学 2007-05-23 I. D. Shkredov

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

组合数学 · 数学 2015-10-14 Vitaly Bergelson , Joel Moreira

Let A \subseteq [1,..,N]^2 be a set of cardinality at least N^2/(log log N)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d>0. This theorem is a two-dimensional generalization of…

数论 · 数学 2007-05-23 I. D. Shkredov

A partition is finitary if all its blocks are finite. For a cardinal $\mathfrak{a}$ and a natural number $n$, let $\mathrm{fin}(\mathfrak{a})$ and $\mathscr{B}_{n}(\mathfrak{a})$ be the cardinalities of the set of finite subsets and the set…

逻辑 · 数学 2024-11-12 Yifan Hu , Guozhen Shen

We show that, for every transitive group $G$ of degree $n\ge 2$, the largest abelian quotient of $G$ has cardinality at most $4^{n/\sqrt{\log_2 n}}$. This gives a positive answer to a 1989 outstanding question of L\'aszl\'o Kov\'acs and…

群论 · 数学 2022-01-12 Andrea Lucchini , Luca Sabatini , Pablo Spiga

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

组合数学 · 数学 2025-06-10 Hunseok Kang , Doowon Koh , Firdavs Rakhmonov

We prove a Roth type theorem for polynomial corners in the finite field setting. Let $\phi_1$ and $\phi_2$ be two polynomials of distinct degree. For sufficiently large primes $p$, any subset $ A \subset \mathbb F_p \times \mathbb F_p$ with…

经典分析与常微分方程 · 数学 2021-06-18 Rui Han , Michael T Lacey , Fan Yang

A $P$-polynomial corner, for $P \in \mathbb{Z}[z]$ a polynomial, is a triple of points $(x,y),\; (x+P(z),y),\; (x,y+P(z))$ for $x,y,z \in \mathbb{Z}$. In the case where $P$ has an integer root of multiplicity $1$, we show that if $A…

组合数学 · 数学 2024-09-04 Noah Kravitz , Borys Kuca , James Leng

We prove that if the cardinality of a subset of the 2-dimensional vector space over a finite field with $q$ elements is $\ge \rho q^2$, with $\frac{1}{\sqrt{q}}<<\rho \leq 1$, then it contains an isometric copy of $\ge c\rho q^3$ triangles.

组合数学 · 数学 2008-05-01 David Covert , Derrick Hart , Alex Iosevich , Ignacio Uriarte-Tuero

We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of…

组合数学 · 数学 2010-10-11 Doowon Koh , Chun-Yen Shen

Let $\eta_{g}(n) $ be the smallest cardinality that $A\subseteq {\mathbb Z}$ can have if $A$ is a $g$-difference basis for $[n]$ (i.e, if, for each $x\in [n]$, there are {\em at least} $g$ solutions to $a_{1}-a_{2}=x$ ). We prove that the…

组合数学 · 数学 2025-01-22 Eric Schmutz , Michael Tait

For a cardinal $\mathfrak{a}$, let $\mathrm{fin}(\mathfrak{a})$ be the cardinality of the set of all finite subsets of a set which is of cardinality $\mathfrak{a}$. It is proved without the aid of the axiom of choice that for all infinite…

逻辑 · 数学 2021-11-02 Guozhen Shen

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

度量几何 · 数学 2009-04-02 Oleg R. Musin

Let A_1,...,A_n be finite subsets of a field F, and let f(x_1,...,x_n)=x_1^k+...+x_n^k+g(x_1,...,x_n)\in F[x_1,...,x_n] with deg g<k. We obtain a lower bound for the cardinality of {f(x_1,...,x_n): x_1\in A_1,...,x_n\in A_n, and x_i\not=x_j…

数论 · 数学 2009-09-27 Hao Pan , Zhi-Wei Sun

The Terracini locus $\mathbb{T}(n, d; x)$ is the locus of all finite subsets $S$ of $ \mathbb{P}^n$ of cardinality $x$ such that $\langle S \rangle = \mathbb{P}^n$, $h^0(\mathcal{I}_{2S}(d)) > 0$, and $h^1(\mathcal{I}_{2S}(d)) > 0$. The…

代数几何 · 数学 2025-08-05 Edoardo Ballico , Maria Chiara Brambilla , Claudio Fontanari
‹ 上一页 1 2 3 10 下一页 ›