中文
相关论文

相关论文: Difference sets in Quadratic Density Hales Jewett …

200 篇论文

The Hales-Jewett theorem states that for any $m$ and $r$ there exists an $n$ such that any $r$-colouring of the elements of $[m]^n$ contains a monochromatic combinatorial line. We study the structure of the wildcard set $S \subseteq [n]$…

组合数学 · 数学 2018-07-27 David Conlon , Nina Kamcev

This is an exposition of the combinatorial proof of the density Hales--Jewett theorem, due to D.\,H.\,J. Polymath in 2012. The theorem says that for given $\de>0$ and $k$, for every $n>n_0$ every set $A\sus\{1,2,\ds,k\}^n$ with $|A|\ge\de…

组合数学 · 数学 2012-06-01 Martin Klazar

The Hales-Jewett theorem asserts that for every r and every k there exists n such that every r-colouring of the n-dimensional grid {1,...,k}^n contains a combinatorial line. This result is a generalization of van der Waerden's theorem, and…

组合数学 · 数学 2010-02-16 D. H. J. Polymath

We offer a new proof of Furstenberg and Katznelson's density version of the Hales-Jewett Theorem: For any $\delta > 0$ there is some $N_0 \geq 1$ such that whenever $A \subseteq [k]^N$ with $N \geq N_0$ and $|A|\geq \delta k^N$, $A$…

概率论 · 数学 2011-04-20 Tim Austin

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

组合数学 · 数学 2022-01-26 Mohammad Golshani , Saharon Shelah

The Hales-Jewett theorem for alphabet of size 3 states that whenever the Hales-Jewett cube [3]^n is r-coloured there is a monochromatic line (for n large). Conlon and Kamcev conjectured that, for any n, there is a 2-colouring of [3]^n for…

组合数学 · 数学 2018-02-12 Imre Leader , Eero Raty

We show that for $n$ at least $10^{11}$, any 2-coloring of the $n$-dimensional grid $[4]^n$ contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett Theorem, to which the best known general upper bound is due…

组合数学 · 数学 2015-04-13 Mikhail Lavrov

The Hales-Jewett Theorem states that any $r$-colouring of $[m]^n$ contains a monochromatic combinatorial line if $n$ is large enough. Shelah's proof of the theorem implies that for $m = 3$ there always exists a monochromatic combinatorial…

组合数学 · 数学 2018-11-13 Nina Kamčev , Christoph Spiegel

For any $n \geq 0$ and $k \geq 1$, the \emph{density Hales-Jewett number} $c_{n,k}$ is defined as the size of the largest subset of the cube $[k]^n$ := $\{1,...,k\}^n$ which contains no combinatorial line; similarly, the Moser number…

组合数学 · 数学 2010-04-27 D. H. J. Polymath

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

组合数学 · 数学 2014-02-26 Mathias Beiglböck

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

In this paper we provide two results. The first one consists an infinitary version of the Furstenberg-Weiss Theorem. More precisely we show that every subset $A$ of a homogeneous tree $T$ such that $\frac{|A\cap T(n)|}{|T(n)|}\geq\delta$,…

组合数学 · 数学 2015-09-30 Konstantinos Tyros

Let ${\bf x}_0,{\bf x}_1,...$ be a sequence of points in $[0,1)^s$. A subset $S$ of $[0,1)^s$ is called a bounded remainder set if there exist two real numbers $a$ and $C$ such that, for every integer $N$, $$ | {\rm card}\{n <N \; | \; {\bf…

数论 · 数学 2019-01-04 Mordechay B. Levin

It is conjectured that the dual variety of every smooth nonlinear subvariety of dimension $> \frac{2N}{3}$ in projective $N$-space is a hypersurface, an expectation known as the duality defect conjecture. This would follow from the truth of…

代数几何 · 数学 2020-07-01 Grayson Jorgenson

For integers $n$ and $k$, the density Hales-Jewett number $c_{n,k}$ is defined as the maximal size of a subset of $[k]^n$ that contains no combinatorial line. We show that for $k \ge 3$ the density Hales-Jewett number $c_{n,k}$ is equal to…

计算复杂性 · 计算机科学 2018-07-03 Adi Shraibman

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…

组合数学 · 数学 2017-03-03 Eva Czabarka , Glenn Hurlbert , Vikram Kamat

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset…

动力系统 · 数学 2017-02-15 Alexander Fish

We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…

统计理论 · 数学 2010-11-22 Louigi Addario-Berry , Nicolas Broutin , Luc Devroye , Gábor Lugosi

In recent work, we showed that for all $q\in\tfrac{1}{2}\mathbb{Z}\setminus\mathbb{Z}_{\leq0}$ the sequence $\left\{\Gamma^{\left(n\right)}\left(q\right)\right\} _{n\geq1}$ contains transcendental elements infinitely often, with the density…

数论 · 数学 2026-04-14 Michael R. Powers

In the class of nonlinear one-parameter real maps we study those with bifurcation that exhibits period doubling cascade. The fixed points of such a map form a finite discrete real set with dimension (2^n)m, where m is the (odd) number of…

数学物理 · 物理学 2009-11-11 A. D. Alhaidari
‹ 上一页 1 2 3 10 下一页 ›