Related papers: Loop statistics in the toroidal honeycomb dimer mo…
2-boostrap percolation on a graph is a diffusion process where a vertex gets infected whenever it has at least 2 infected neighbours, and then stays infected forever. It has been much studied on the infinite grid for random Bernoulli…
A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
Minimum numbers of fixed points or of coincidence components (realized by maps in given homotopy classes) are the principal objects of study in topological fixed point and coincidence theory. In this paper we investigate fiberwise analoga…
We study the unwheeled rational Kontsevich integral of torus knots. We give a precise formula for these invariants up to loop degree 3 and show that they appear as colorings of simple diagrams. We show that they behave under cyclic branched…
We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…
Honeycomb toroidal graphs are trivalent Cayley graphs on generalized dihedral groups. We examine the two historical threads leading to these graphs, some of the properties that have been established, and some open problems.
Linde, Moore, and Nordahl introduced a generalisation of the honeycomb dimer model to higher dimensions. The purpose of this article is to describe a number of structural properties of this generalised model. First, it is shown that the…
We prove that the complement of a toric arrangement has the homotopy type of a minimal CW complex. As a corollary we obtain that the integer cohomology of these spaces is torsion free. We use Discrete Morse Theory, providing a sequence of…
Recent Monte Carlo simulations of a grafted semiflexible polymer in 1+1 dimensions have revealed a pronounced bimodal structure in the probability distribution of the transverse (bending) fluctuations of the free end, when the total contour…
In this paper I present three new results of astronomical interest concerning the theory of Abel inversion. 1) I show that in the case of a spatial emissivity that is constant on toroidal surfaces and projected along the symmetry axis…
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…
We identify a link between regular matroids and torus representations all of whose isotropy groups have an odd number of components. Applying Seymour's 1980 classification of the former objects, we obtain a classification of the latter. In…
We consider the topologically constrained random walk model for topological polymers. In this model, the polymer forms an arbitrary graph whose edges are selected from an appropriate multivariate Gaussian which takes into account the…
This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy…
We show that set of points nondense under the $\times n$-map on the circle and dense for the geodesic flow under the induced map on the circle corresponding to the expanding horospherical subgroup has full Haudorff dimension. We also show…
In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of $\mathbb Z^2$ (a.k.a. dimer configurations or domino tilings) and developed a large deviation theory for the associated height…
In 2021, motivated by graph limit theory Lov\'asz extended most of the theory of flows to a measure theoretic setting. Using this framework, the first author constructed $d$-regular treeings that are measurably bipartite, and have no…
On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…
We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…