Related papers: Independent sets in the hypercube revisited
We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparabilty graphs and counting independent sets in…
We obtain large $n$ asymptotics of $n \times n$ Hankel determinants whose weight has a one-cut regular potential and Fisher-Hartwig singularities. We restrict our attention to the case where the associated equilibrium measure possesses…
The classical Painlev\'e equations are so well known that it may come as a surprise to learn that the asymptotic description of its solutions remains incomplete. The problem lies mainly with the description of families of solutions in the…
We develop some basic Lipschitz homotopy technique and apply it to manifolds with finite asymptotic dimension. In particular we show that the Higson compactification of a uniformly contractible manifold is mod $p$ acyclic in the finite…
We study the numerical approximation by space-time finite element methods of a multi-physics system coupling hyperbolic elastodynamics with parabolic transport and modeling poro- and thermoelasticity. The equations are rewritten as a…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…
We provide a refined combinatorial identity for the set of partitions of $\{1,\dots, n\}$, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free…
We give a criterion for a set of $n$ hyperbolic isometries of a $\mathrm{CAT}(0)$ metric space $X$ to generate a free group on $n$ generators. This extends a result by Alperin, Farb and Noskov who proved this for 2 generators under the…
Since the work of Mirzakhani and Petri on random hyperbolic surfaces of large genus, length statistics of closed geodesics have been studied extensively. We focus on the case of random hyperbolic surfaces with cusps, the number of which…
The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…
It has been shown by Voiculescu that important classes of square independent random matrices are asymptotically free, where freeness is a noncommutative analog of classical independence. Recently, we introduced the concept of matricial…
Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwani [STOC 1999, SIDMA 2003] as a tool to solve partitioning problems. In this paper, the following result concerning independent sets in graphs having sparse-dense…
In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…
In this paper we study two properties related to the structure of hyperbolic sets. First we construct new examples answering in the negative the following question posed by Katok and Hasselblatt. Let $\Lambda$ be a hyperbolic set, and let…
We employ an extension of ergodic theory to the random setting to investigate the existence of random periodic solutions of random dynamical systems. Given that a random dynamical system has a dissipative structure, we proved that a random…
The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution function, which is a step function with jumps one unit at the points $x=0,1,..., N-1$, N being a fixed positive integer. By using a double integral…
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical…
Hyperasymptotics is an analytical method that incorporates exponentially small contributions into asymptotic approximations, thereby expanding their domain of validity, improving accuracy, and providing deeper insight into the underlying…
An independent set may not contain both a vertex and one of its neighbours. This basic fact makes the uniform distribution over independent sets rather special. We consider the hard-core model, an essential generalization of the uniform…