Related papers: The de Bruijn-Erd\"os-Hanani theorem

We survey the proof of the Nash conjecture for surfaces and show how geometric and topological ideas developed in previous articles by the authors influenced it. Later we summarize the main ideas in the higher dimensional statement and…

While exploring dynamical systems, we often come across the principle of contraction mapping, or better known as the Banach fixed point theorem. It is an essential concept based on successive approximation, whose utility comes from two main…

We present a new proof of the bi-Lipschitz model theorem, which occupies the main part of the Ending Lamination Conjecture proved by Minsky and Brock-Canary-Minsky. Our proof is done by using techniques of standard hyperbolic geometry as…

In this paper, several generalizations of the classical Halpern-L\"{a}uchli Theorem are proven for Marczewski and Ellentuck structures using only combinatorial methods.

It is shown that the Poincar\'e-Birkhoff fixed point theorem may be proven by extending the geometric approach originally devised by Henri Poincar\'e himself, along with several results from elementary differential topology. Beginning with…

In this note, while giving an overview of the state of art of the well known Hadamard conjecture, which is more than a century old and now it has been established by using the methods given in the two papers by Mohan et al [6,7].

We construct the geometric Langlands functor in one direction (from the automorphic to the spectral side) in characteristic zero settings (i.e., de Rham and Betti). We prove that various forms of the conjecture (de Rham vs Betti, restricted…

We give a geometric proof of the Affability Theorem of T. Giordano, H. Matui, I. Putnam and C. Skau for aperiodic and repetitive planar tilings.

We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected…

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

We discuss and give elementary proofs of results of Brion and of Lawrence-Varchenko on the lattice-point enumerator generating functions for polytopes and cones. This largely expository note contains a new proof of Brion's Formula using…

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

Edwards, van den Heuvel, Kang, and Sereni conjectured the following strengthening of Vizing's Theorem: let $G$ be a simple graph, and let $K = \Delta(G) + 1$. For any matching $M$ in $G$ and any precoloring of the edges in $M$ using the…

In this paper we present another proof of the analytic version of the Hahn-Banach theorem in terms of convex functionals.

The Ramanujan conjecture for modular forms of holomorphic type was proved by Deligne almost half a century ago: the proof, based on his earlier proof of Weil's conjectures, was an achievement of algebraic geometry. We give here a short…

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as…

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

A classic theorem of Erd\H{o}s and P\'osa (1965) states that every graph has either $k$ vertex-disjoint cycles or a set of $O(k \log k)$ vertices meeting all its cycles. While the standard proof revolves around finding a large `frame' in…

In this note we shall give a new proof to a quadrature formulae due to Newton.

In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every…