English
Related papers

Related papers: On two-point configurations in random set

200 papers

We consider a simple model of a growing cluster of points in $\Re^d,d\geq 2$. Beginning with a point $X_1$ located at the origin, we generate a random sequence of points $X_1,X_2,\ldots,X_i,\ldots,$. To generate $X_{i},i\geq 2$ we choose a…

Probability · Mathematics 2025-01-08 Alan Frieze , Ravi Kannan , Wesley Pegden

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

Combinatorics · Mathematics 2015-06-02 Przemysław Mazur

Let $\Theta=(\alpha,\beta)$ be a point in $\bR^2$, with $1,\alpha,\beta$ linearly independent over $\bQ$. We attach to $\Theta$ a quadruple $\Omega(\Theta)$ of exponents which measure the quality of approximation to $\Theta$ both by…

Number Theory · Mathematics 2007-05-23 Michel Laurent

For a set of distances D={d_1,...,d_k} a set A is called D-avoiding if no pair of points of A is at distance d_i for some i. We show that the density of A is exponentially small in k provided the ratios d_1/d_2, d_2/d_3, ..., d_{k-1}/d_k…

Combinatorics · Mathematics 2008-02-24 Boris Bukh

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

Combinatorics · Mathematics 2018-08-14 Tuan Tran

We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2019-03-06 Juho Salmensuu

In this paper we make a comparison between certain probabilistic and deterministic point sets and show that some deterministic constructions (spherical $t$-designs) are better or as good as probabilistic ones. We find asymptotic equalities…

Classical Analysis and ODEs · Mathematics 2020-07-27 Peter Grabner , Tetiana Stepanyuk

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

Combinatorics · Mathematics 2016-08-17 Arran Hamm , Jeff Kahn

We prove the existence of similar and multi-similar point configurations (or simplexes) in sets of fractional Hausdorff measure in Euclidean space. These results can be viewed as variants, for thin sets, of theorems for sets of positive…

Classical Analysis and ODEs · Mathematics 2021-04-28 Allan Greenleaf , Alex Iosevich , Sevak Mkrtchyan

Let $K$ be an imaginary quadratic field and let $\mathcal{O}_K$ be the ring of algebraic integers of $K$. For $\alpha \in \mathcal{O}_K$ with $|\alpha| > 1$, define \[ \mathcal{D}_\alpha = \bigcup_{n=0}^\infty…

Number Theory · Mathematics 2025-12-09 Wenxia Li , Zhiqiang Wang , Jiuzhou Zhao

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

Combinatorics · Mathematics 2015-02-20 Pat Devlin , Jeff Kahn

We show any subset $A\subset\mathbb{N}$ with positive upper Banach density contains the pattern $\{m,m+[n\alpha],\dots,m+k[n\alpha]\}$, for some $m\in\mathbb{N}$ and $n=p-1$ for some prime $p$, where…

Dynamical Systems · Mathematics 2015-07-08 Wenbo Sun

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely many solution pairs (a,b), where $\phi$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Sergei Konyagin

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

Combinatorics · Mathematics 2024-09-24 János Nagy , Péter Pál Pach

The Oldenburger-Kolakoski sequence is the only infinite sequence over the alphabet $\{1,2\}$ that starts with $1$ and is its own run-length encoding. In the present work, we take a step back from this largely known and studied sequence by…

Discrete Mathematics · Computer Science 2023-01-04 Chloé Boisson , Damien Jamet , Irène Marcovici

For a fixed integer $r\ge1$, we say $k$-tuple integers $(x_1,\ldots,x_k)$ are relatively $r$-prime if there exists no prime $p$ such that all $k$ integers is multiple of $p^r$. Benkoski proved that the number of relatively $r$-prime…

Number Theory · Mathematics 2016-11-09 Wataru Takeda

We are discussing the theorem about the volume of a set $A$ of $Z^n$ having a small doubling property $|2A| < Ck, k=|A|$ and oher problems of Structure Theory of Set Addition (Additive Combinatorics).

Number Theory · Mathematics 2012-04-25 Gregory A. Freiman

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

Number Theory · Mathematics 2014-01-14 Dzmitry Badziahin , Jason Levesley , Sanju Velani

Given two integers $k\geq 2$ and $a>1$, let $N_k(a)$ stand for the number of multinomial coefficients, with $k$ terms, equal to $a$. We study the behavior of $N_k(a)$ and show that its average and normal orders are equal to $k(k-1)$. We…

Number Theory · Mathematics 2021-07-21 Jean-Marie de Koninck , Nicolas Doyon , William Verreault
‹ Prev 1 3 4 5 6 7 10 Next ›