Related papers: The squish map and the $\text{SL}_2$ double dimer …
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…
We formulate and study a new coarse (co-)assembly map. It involves a modification of the Higson corona construction and produces a map dual in an appropriate sense to the standard coarse assembly map. The new assembly map is shown to be an…
We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
Our goal is to provide a novel method of representing 2D shapes, where each shape will be assigned a unique fingerprint - a computable approximation to a conformal map of the given shape to a canonical shape in 2D or 3D space (see page 22…
Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire…
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…
In this paper, we provide a comprehensive rigorous modeling for multidimensional spaces with hierarchically structured dimensions in several layers of abstractions and data cubes that live in such spaces. We model cube queries and their…
We consider a two-dimensional bi-layered loop model with a certain interlayer coupling and study its spectrum on a torus. Each layer consists of an $O(n)$ model on a honeycomb lattice with periodic boundary conditions; these layers are…
We design an efficient data structure for computing a suitably defined approximate depth of any query point in the arrangement $\mathcal{A}(S)$ of a collection $S$ of $n$ halfplanes or triangles in the plane or of halfspaces or simplices in…
The partition function of the 2d Ising model with random nearest neighbor coupling is expressed in the dual lattice made of square plaquettes. The dual model is solved in the the mean field and in different types of Bethe-Peierls…
The elegant properties of conformal mappings, when applied to two dimensional (2D) lattices, find interesting applications in 2D foams and other cellular or close packed structures. In particular the 2D honeycomb (whose dual is the…
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…
Plane partitions naturally appear in many problems of statistical physics and quantum field theory, for instance, in the theory of faceted crystals and of topological strings on Calabi-Yau threefolds. In this paper a connection is made…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…