English
Related papers

Related papers: Identities between dimer partition functions on di…

200 papers

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

We study a generalisation of the double-dimer model that encompasses several models of interest, including the monomer double-dimer model, spatial random permutations, the dimer model, and the spin $O(N)$ model, and which is also related to…

Probability · Mathematics 2025-11-04 Lorenzo Taggi , Wei Wu

A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors…

Combinatorics · Mathematics 2023-06-22 Ali Dehghan , Mohammad-Reza Sadeghi , Arash Ahadi

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

Combinatorics · Mathematics 2013-11-27 Seyed Saeed Changiz Rezaei , Chris Godsil

We study N=2 supersymmetric four dimensional gauge theories, in a certain N=2 supergravity background, called Omega-background. The partition function of the theory in the Omega-background can be calculated explicitly. We investigate…

High Energy Physics - Theory · Physics 2007-05-23 Nikita Nekrasov , Andrei Okounkov

A discrete analog of the holomorphic map $z^{\gamma}$ is studied. It is given by Schramm's circle pattern with the combinatorics of the square grid. It is shown that the corresponding circle patterns are embedded and described by special…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 S. I. Agafonov

We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…

Statistics Theory · Mathematics 2025-01-22 Yuqi Gu

We derive the exact vortex partition function in 2d $\mathcal{N}$ = (2,2) gauge theory on the Omega-background, applying the localization scheme in the Higgs phase. We show that the partition function at a finite Omega-deformation parameter…

High Energy Physics - Theory · Physics 2015-12-29 Toshiaki Fujimori , Taro Kimura , Muneto Nitta , Keisuke Ohashi

For a graph $G$ on $v(G)$ vertices let $m_k(G)$ denote the number of matchings of size $k$, and consider the partition function $M_{G}(\lambda)=\sum_{k=0}^nm_k(G)\lambda^k$. In this paper we show that if $G$ is a $d$--regular graph and…

Combinatorics · Mathematics 2020-07-01 Márton Borbényi , Péter Csikvári

Let $M_\Sigma$ be an $n$-dimensional Thom-Mather stratified space of depth $1$. We denote by $\beta M$ the singular locus and by $L$ the associated link. In this paper we study the problem of when such a space can be endowed with a wedge…

Differential Geometry · Mathematics 2023-05-16 Boris Botvinnik , Paolo Piazza , Jonathan Rosenberg

Given operator spaces $V$ and $W$, let $\widetilde{W}$ denote the opposite operator space structure on the same underlying Banach space. Although the identity map $W\to \widetilde{W}$ is in general not completely bounded, we show that the…

Operator Algebras · Mathematics 2020-05-21 Yemon Choi

An independent set $I$ in a graph $G$ is maximal if $I$ is not properly contained in any other independent set of $G$. The study of maximal independent sets (MIS's) in various graphs is well-established, often focusing upon enumeration of…

Combinatorics · Mathematics 2025-06-30 Levi Axelrod , Nathan Bickel , Anastasia Halfpap , Luke Hawranick , Alex Parker , Cole Swain

We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…

Data Structures and Algorithms · Computer Science 2007-05-23 David Eppstein

We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…

Formal Languages and Automata Theory · Computer Science 2020-10-01 C. Aiswarya , Paul Gastin

Colored lattice models can be used to describe many different types of special functions of interest in both algebraic combinatorics and representation theory, for example Schur polynomials, nonsymmetric Macdonald polynomials, and…

Combinatorics · Mathematics 2025-05-13 Henrik P. A. Gustafsson , Carl Westerlund

We prove a structural characterization of graphs that forbid a fixed graph $H$ as an immersion and can be embedded in a surface of Euler genus $\gamma$. In particular, we prove that a graph $G$ that excludes some connected graph $H$ as an…

Combinatorics · Mathematics 2013-03-27 Archontia C. Giannopoulou , Marcin Kaminski , Dimitrios M. Thilikos

Let G be the graph of a triangulated surface $\Sigma$ of genus $g\geq 2$. A cycle of G is splitting if it cuts $\Sigma$ into two components, neither of which is homeomorphic to a disk. A splitting cycle has type k if the corresponding…

Computational Geometry · Computer Science 2015-09-02 Vincent Despré , Francis Lazarus

Let S be an immersed horizontal surface in a 3-dimensional graph manifold. We show that the fundamental group of the surface S is quadratically distorted whenever the surface is virtually embedded (i.e., separable) and is exponentially…

Group Theory · Mathematics 2019-02-13 G. Christopher Hruska , Hoang Thanh Nguyen

The classical algebra $\Lambda$ of symmetric functions has a remarkable deformation $\Lambda^*$, which we call the algebra of shifted symmetric functions. In the latter algebra, there is a distinguished basis formed by shifted Schur…

q-alg · Mathematics 2008-02-03 Andrei Okounkov , Grigori Olshanski

We consider the dimer problem on a non-bipartite graph $G$, where there are two types of dimers one of which we regard impurities. Results of simulations using Markov chain seem to indicate that impurities are tend to distribute on the…

Combinatorics · Mathematics 2015-05-13 Fumihiko Nakano , Taizo Sadahiro