Related papers: Equiangular lines and the Lemmens-Seidel conjectur…
In his study of finite (Vassiliev's) knot invariants,Vogel introduced the so-called universal parameters, belonging to the projective plane, which particularly parameterize the simple Lie algebras by the Vogel's table. Subsequently a number…
We confirm the following conjecture of Fekete and Woeginger from 1997: for any sufficiently large even number $n$, every set of $n$ points in the plane can be connected by a spanning tour (Hamiltonian cycle) consisting of straight-line…
We conjecture infrared emergent $\mathcal{N}=4$ supersymmetry for a class of three-dimensional $\mathcal{N}=2$ $U(1)$ gauge theories coupled with a single chiral multiplet. One example is the case where $U(1)$ gauge group has the…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…
A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…
Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…
We show that a unital $U$ in $\mathrm{PG}(2,q^2)$ containing a point $P$, such that at least $q^2-\epsilon$ of the secant lines through $P$ intersect $U$ in a Baer subline, is an ovoidal Buekenhout-Metz unital (where $\epsilon\approx 2q$…
Models in Algebraic Quantum Field Theory (AQFT) may be generalized including Lie groups of symmetries whose Lie algebras admit an Euler element $h$, characterized by the property that $ad h$ is diagonalizable with eigenvalues in $\{-1, 0,…
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…
In the last two decades, one of the most important developments in Riemannian geometry is the collapsing theory of Cheeger-Fukaya-Gromov. A Riemannian manifold is called (sufficiently) collapsed if its dimension looks smaller than its…
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
We formulate an equivariant conservation of number, which proves that a generalized Euler number of a complex equivariant vector bundle can be computed as a sum of local indices of an arbitrary section. This involves an expansion of the…
We give an extensive study on the Bergman kernel expansions and the random zeros associated with the high tensor powers of a semipositive line bundle on a complete punctured Riemann surface. We prove several results for the zeros of…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
It is proved that every series-parallel digraph whose maximum vertex-degree is $\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\Delta$ distinct slopes. This is shown to be…
A pair of sequences of natural numbers is called planar if there exists a simple, bipartite, planar graph for which the given sequences are the degree sequences of its parts. For a pair to be planar, the sums of the sequences have to be…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
In this paper we study the behaviour of the Neumann data of Dirichlet eigenfunctions on triangles. We prove that the $L^2$ norm of the (semi-classical) Neumann data on each side is equal to the length of the side divided by the area of the…