Related papers: The de Bruijn-Erd\"os-Hanani theorem
Recent results of several authors have led to constructions of parallelotopes which are bounded remainder sets for totally irrational toral rotations. In this brief note we explain, in retrospect, how some of these results can easily be…
The celebrated K\H{o}v\'ari-S\'os-Tur\'an theorem states that any $n$-vertex graph containing no copy of the complete bipartite graph $K_{s,s}$ has at most $O_s(n^{2-1/s})$ edges. In the past two decades, motivated by the applications in…
In the ergodic theory of semi-dispersing billiards the Local Ergodic Theorem, proved by Chernov and Sinai in 1987, plays a central role. So far, all existing proofs of this theorem had to use an annoying global hypothesis, namely the almost…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive…
It is shown that every complete n-vertex simple topological graph has at least Omega(n^{1/3}) pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and T\'oth.
This paper focuses on the metric properties of L\"uroth well approximable numbers, studying analogous of classical results, namely the Khintchine Theorem, the Jarn\'ik--Besicovitch Theorem, and the result of Dodson. A supplementary proof is…
We present a new, simpler proof of the unconditional uniqueness of solutions to the cubic Gross-Pitaevskii hierarchy in $\R^3$. One of the main tools in our analysis is the quantum de Finetti theorem. Our uniqueness result is equivalent to…
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one…
We describe a new relation between the topology of hypersurface complements, Milnor fibers and degree of gradient mappings. The main tools are polar curves and the affine Lefschetz theory developped by H. Hamm and A. N\'emethi. In the…
Gordon and Litherland showed that all compact, unoriented, possibly non-orientable surfaces in $S^3$ bounded by a link are realted by attaching/deleting tubes and half twisted bands. In this note we give an elementary proof for this result.
Our main theorem is an extension of the well-known Mizoguchi-Takahaashi's fixed point theorem [N. Mizogochi and W. Takahashi, Fixed point theorems for multi-valued mappings on complete metric space, {\it J. Math. Anal. Appl.} 141 (1989)…
In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…
This paper surveys the theory of compactness of the d-bar-Neumann problem. It also contains several results which improve upon what was previously known.
In this paper, we prove a theorem which adds a new member to the famous G\"oellnitz-Gordon identities. We construct a "new system of recurrence formulas" in order to prove it.
``Real Normed Algebras Revisited,'' the last paper of the late Gadi Moran, attempts to reconstruct the discovery of the complex numbers, the quaternions and the octonions, as well as proofs of their properties, using only what was known to…
In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.
The number of Lame equations with finite (ordinary or projective) monodromy has been conjectured by S. R. Dahmen, and a few proofs have been proposed. It is known that Lame equations with unitary monodromy are corresponding to spherical…
We give two equivalent formulations of a conjecture [2,4] on the number of arc-disjoint Hamiltonian cycles in De Bruijn graphs.