Related papers: A certain sequence on pure $\kappa-$sparse gapsets

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

From large cardinals we show the consistency of normal, fine, $\kappa$-complete $\lambda$-dense ideals on $\mathcal{P}_\kappa(\lambda)$ for successor $\kappa$. We explore the interplay between dense ideals, cardinal arithmetic, and squares,…

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…

Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

A generic uniformly distributed sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ possesses Poissonian pair correlations (PPC). Vice versa, it has been proven that a sequence with PPC is uniformly distributed. Grepstad and Larcher gave an…

Let $\lambda$ and $\kappa$ be cardinal numbers such that $\kappa$ is infinite and either $2\leq \lambda\leq \kappa$, or $\lambda=2^\kappa$. We prove that there exists a lattice $L$ with exactly $\lambda$ many congruences, $2^\kappa$ many…

Let p be a puncture of a punctured sphere, and let Q be the set of all other punctures. We prove that the maximal cardinality of a set of arcs pairwise intersecting at most once, which start at p and end in Q, is |X|(|X| + 1). We deduce…

We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…

Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset…

A finite set of points in $\mathbb R^d$ is called almost-equidistant if among any three distinct points in the set, some two are at unit distance. We prove that an almost-equidistant set in $\mathbb R^d$ has cardinality at most $5d^{13/9}$.

The research in this paper is a continuation of the investigation of the cardinality of the $\theta$-closed hull of subsets of spaces. This research obtains new upper bounds of the cardinality of the $\theta$-closed hull of subsets using…

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Let G be a group. A subset X of G is a set of pairwise non-commuting elements if xy is not equal to yx for any two distinct elements x and y in X. If |X|>=|Y| for any other set of pairwise non-commuting elements Y in G, then X is said to be…

In [BKS15] examples of incomplete sentences are given with maximal models in more than one cardinality. The question was raised whether one can find similar examples of complete sentences. In this paper we give examples of complete…

We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen…

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

In this paper we study the diameter of the random graph $G(n,p)$, i.e., the the largest finite distance between two vertices, for a wide range of functions $p=p(n)$. For $p=\la/n$ with $\la>1$ constant, we give a simple proof of an…