Related papers: Direction-Critical Configurations in Noncentral Ge…

We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…

In this paper we establish combinatorial characterisations of symmetry-generic infinitesimally rigid frameworks in the Euclidean plane for rotational groups of order 4 and 6, and of odd order between 5 and 1000, where a joint may lie at the…

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general…

Motivated by a uniform boundedness conjecture of Morton and Silverman, we study the graphs of pre-periodic points for maps in three families of dynamical systems, namely the collections of rational functions of degree two having a periodic…

We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…

On the phase diagram of a system undergoing a continuous phase transition of the second order, three lines, hyper-surfaces, convergent into the critical point feature prominently: the ordered and disordered phases in the thermodynamic…

$O(n) \times O(m)$ symmetric Landau-Ginzburg models in $d=3$ dimension possess a rich structure of the renormalization group and its understanding offers a theoretical prediction of the phase diagram in frustrated spin models with…

We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have so far discovered has 1581 vertices.

We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric…

We prove that the (non-symmetric) adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices is asymptotically almost surely invertible, assuming $\min(d,n-d)\ge C\log^2n$ for a sufficiently large constant $C>0$. The…

Three lines are concurrent if they intersect at a single point. In this paper I prove that if $F$ is a bounded family of compact connected sets in the plane, such that every three sets in $F$ can be pierced by a single line, then there…

In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

We prove that any continuous and convex stationary ergodic Hamiltonian admits critical subsolutions, which are strict outside the random Aubry set. They make up, in addition, a dense subset of all critical subsolutions with respect to a…

We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…

We construct a hierarchy of exactly solvable spin-1/2 chains with so(N)_1 critical points. Our construction is based on the framework of condensate-induced transitions between topological phases. We employ this framework to construct a…

Consider a $3$-uniform hypergraph of order $n$ with clique number $k$ such that the intersection of all its $k$-cliques is empty. Szemer\'edi and Petruska proved $n\leq 8m^2+3m$, for fixed $m=n-k$, and they conjectured the sharp bound $n…

We establish a direct connection between inhomogeneous XX spin chains (or free fermion systems with nearest-neighbors hopping) and certain QES models on the line giving rise to a family of weakly orthogonal polynomials. We classify all such…

A group topology is said to be linear if open subgroups form a base of neighborhoods of the identity element. It is proved that the existence of a nondiscrete extremally disconnected group of Ulam nonmeasurable cardinality with linear…