Related papers: Rediscovered theorem of Luzin
A generalization of the Lebesgue number lemma is obtained. It is proved that, if each countably infinite locally finite open cover of a chainable metric space $X$ has a Lebesgue number, then $X$ is totally bounded. A property of metric…
In this paper, we prove the following result conjectured by Z.-W. Sun: $$ (2n-1){3n\choose n}| \sum_{k=0}^{n}{6k\choose 3k}{3k\choose k}{6(n-k)\choose 3(n-k)}{3(n-k)\choose n-k}. $$ by showing that the left-hand side divides each summand on…
New Mersenne conjectures. The problems of simplicity, common prime divisors and free from squares of numbers $L(n) = 2^{2n}\pm2^n\pm1$ are investigated. Wonderful formulas $gcd $ for numbers $L (n) $ and numbers repunit are proved.
In this paper we give a detailed measure theoretical analysis of what we call sum-level sets for regular continued fraction expansions. The first main result is to settle a recent conjecture of Fiala and Kleban, which asserts that the…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
During the last decade the Subspace Theorem found several quite unexpected applications, mainly in the Diophantine Analysis and in the Transcendence Theory. Among the great variety of spectacular results, I have chosen several which are…
Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…
Renling Jin proved that if A and B are two subsets of the natural numbers with positive Banach density, then A+B is piecewise syndetic. In this paper, we prove that, under various assumptions on positive lower or upper densities of A and B,…
This exposition reviews what exactly Gauss asserted and what did he prove in the last chapter of {\sl Disquisitiones Arithmeticae} about dividing the circle into a given number of equal parts. In other words, what did Gauss claim and…
The algebraic Hodge theorem was proved in a beautiful 1987 paper by Deligne and Illusie, using positive characteristic methods. We argue that the central algebraic object of their proof can be understood geometrically as a line bundle on a…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…
The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…
In 1967, Kadison asked ``does every type $\mathrm{II}_1$ factor have an orthonormal (with respect to the trace) basis consisting of unitaries?'' Using a noncommutative Lyapunov theorem of Akemann and Weaver, we prove that if $M$ is a…
In the town of Saratov where he was prisonner, Poncelet, continuing the work of Euler and Steiner on polygons simultaneously inscribed in a circle and circumscribed around an other circle, proved the following generalization : "Let C and D…
We prove that if all shifts of a measure in the Euclidean space are close in a sense to each other, then this measure is close to the Lebesgue one.
The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how…
We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.
In this paper we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$…
Talagrand conjectured that if a family of sets $\mathcal{F}$ over $X = \{ 1,2,\cdots, N \}$ is of large measure, then constant times of unions of sets in $\mathcal{F}$ will cover a large portion of the power set of $X$. This conjecture is a…