Related papers: Direction-Critical Configurations in Noncentral Ge…
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…
A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…
In this paper we consider kinetically constrained models (KCM) on $\mathbb Z^2$ with general update families $\mathcal U$. For $\mathcal U$ belonging to the so-called "critical class" our focus is on the divergence of the infection time of…
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…
Let $f, g:S^1\to S^1$ be two $C^3$ critical homeomorphisms of the circle with the same irrational rotation number and the same (finite) number of critical points, all of which are assumed to be non-flat, of power-law type. In this paper we…
We study (inhomogeneous) approximation for systems of linear forms using integer points which satisfy additional primitivity constraints. The first family of primitivity constraints we consider were introduced in 2015 by Dani, Laurent, and…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\ge 3$ vertices and minimum degree $\delta(G)\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\delta(G)$ edges…
Two given orbits of a minimal circle homeomorphism $f$ are said to be geometrically equivalent if there exists a quasisymmetric circle homeomorphism identifying both orbits and commuting with $f$. By a well-known theorem due to Herman and…
Central configurations are solutions of the equations $\lambda m_j\boldsymbol{q}_j = \frac{\partial U}{\partial \boldsymbol{q}_j}$, where $U$ denotes the potential function and each $\boldsymbol{q}_j$ is a point in the $d$-dimensional…
Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…
We prove central limit theorems for the random walks on either the mapping class group of a closed, connected, orientable, hyperbolic surface, or on $\text{Out}(F_N)$, each time under a finite second moment condition on the measure (either…
In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…
C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…
Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding…
In 1989, Erd\H{o}s conjectured that for a sufficiently large $n$ it is impossible to place $n$ points in general position in a plane such that for every $1\le i \le n-1$ there is a distance that occurs exactly $i$ times. For small $n$ this…
We consider the critical behavior associated with incommensurate unidirectional charge-density-wave ordering in a weakly orthorhombic system subject to uniaxial strain as an experimentally significant example of $U(1)\times U(1)$…
This paper initiates a theoretical investigation of $\frac{1}{4}$-oscillatory chain sequences $\{a_n\}$, generalizing Szwarc's classical framework for non-oscillatory chains \cite{Sz94, Sz98, Sz02, Sz03} to sequences fluctuating around…