Related papers: On two-point configurations in random set

Let $\mathbb{Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $\mathbb{Z}^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,2,\ldots,n\}$. Let $f(n, k) =…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

We prove a quantitative version of a Silverstein's Theorem on a condition for convergence in probability of the norm of random matrix. More precisely, we show that for a random matrix whose entries are i.i.d. random variables, $w_{i,j}$,…

Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds…

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

S\'ark\"ozy's theorem states that dense sets of integers must contain two elements whose difference is a $k^{th}$ power. Following the polynomial method breakthrough of Croot, Lev, and Pach, Green proved a strong quantitative version of…

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…

We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a…

It is shown that there is a constant A and a density one subset S of the positive integers, such that for all q in S there is some 1<=p<q, (p, q)=1, so that p/q has all its partial quotients bounded by A.

At a social gathering of mathematicians, Herb Wilf noted that the numbers $\zeta(k) - 1$ sum to 1, and challenged the assembly to interpret the sequence as probabilities in some interesting number theoretic context. This short note provides…

Let $n,d$, and $k$ be positive integers where $n$ and $d$ are coprime. Our two main results are Theorem 1. There is a partition of the infinite interval $[kd,\infty)$ of positive integers into a family of finite sets $X$ for which the sum…

Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…

Suppose that $A \subset \{1,\dots, N\}$ has no two elements differing by a square. Then $|A| \ll N e^{-c\sqrt{\log N}}$.

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Define $I_n^k(\alpha)$ to be the set of involutions of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_i$, for some $i \geq 2$, and define $I_n^k(\emptyset;\alpha)$ to be the set of involutions of…

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

For any small constant $\epsilon>0$, the Erd\H{o}s-R\'enyi random graph $G(n,\frac{1+\epsilon}{n})$ with high probability has a unique largest component which contains $(1\pm O(\epsilon))2\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by…

Let $i(n,k)$ be the proportion of permutations $\pi\in\mathcal{S}_n$ having an invariant set of size $k$. In this note we adapt arguments of the second author to prove that $i(n,k) \asymp k^{-\delta} (1+\log k)^{-3/2}$ uniformly for $1\leq…

Fix $\alpha >0$, and sample $N$ integers uniformly at random from $\{1,2,\ldots ,\lfloor e^{\alpha N}\rfloor \}$. Given $\eta >0$, the probability that the maximum of the pairwise GCDs lies between $N^{2-\eta }$ and $N^{2+\eta}$ converges…

We apply the version of P\'{o}lya-Redfield theory obtained by White to count patterns with a given automorphism group to the enumeration of strong dichotomy patterns, that is, we count bicolor patterns of $\mathbb{Z}_{2k}$ with respect to…