Related papers: Double-dimer pairings and skew Young diagrams
Bipartite graph tiling was studied by Zhao who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K_{s,s}. Let s<t be fixed positive integers. Hladk\'y and…
This paper studies Young diagrams of symmetric and pseudo-symmetric numerical semigroups and describes new operations on Young diagrams as well as numerical semigroups. These provide new decompositions of symmetric and pseudo-symmetric…
We study the probabilistic properties of the Greatest Increase Grid (GIG) digraph. We compute the probability of a particular sequence of directed edges connecting two random vertices. We compute the joint probability that a set of vertices…
Symmetric Dyck tilings and ballot tilings are certain tilings in the region surrounded by two ballot paths. We study the relations of combinatorial objects which are bijective to symmetric Dyck tilings such as labeled trees, Hermite…
We consider triangular holes on the hexagonal lattice and we study their interaction when the rest of the lattice is covered by dimers. More precisely, we analyze the joint correlation of these triangular holes in a ``sea'' of dimers. We…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…
Double triangle expansion is an operation on $4$-regular graphs with at least one triangle which replaces a triangle with two triangles in a particular way. We study the class of graphs which can be obtained by repeated double triangle…
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…
Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random…
We introduce a new method for studying gap probabilities in a class of discrete determinantal point processes with double contour integral kernels. This class of point processes includes uniform measures of domino and lozenge tilings as…
We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…
As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…
Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review…
We study the 1/4 BPS geometries corresponding to the 1/4 BPS operators of the dual gauge theory side, in ${\cal N}=4$ SYM. By analyzing asymptotic structure and flux integration of the geometries, we present a mapping between droplet…
The search for satellites around exoplanets represents one of the greatest challenges in advancing the characterization of planetary systems. Currently, we can only detect massive satellites, which resemble additional planetary companions…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
The connectivity structure of graphs is typically related to the attributes of the nodes. In social networks for example, the probability of a friendship between two people depends on their attributes, such as their age, address, and…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…