English
Related papers

Related papers: Dimer face polynomials in knot theory and cluster …

200 papers

We prove that the semi-invariant ring of the standard representation space of the $l$-flagged $m$-arrow Kronecker quiver is an upper cluster algebra for any $l,m\in \mathbb{N}$. The quiver and cluster are explicitly given. We prove that the…

Representation Theory · Mathematics 2021-12-01 Jiarui Fei

The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…

Combinatorics · Mathematics 2023-09-27 Theo Douvropoulos , Matthieu Josuat-Vergès

Motivated by work of Barot, Geiss and Zelevinsky, we study a collection of Z-bases (which we call companion bases) of the integral root lattice of a root system of simply-laced Dynkin type. Each companion basis is associated with the quiver…

Representation Theory · Mathematics 2011-11-03 Mark James Parsons

Defect characterizes the depth of factorization of terms in differential (cyclotomic) expansions of knot polynomials, i.e. of the non-perturbative Wilson averages in the Chern-Simons theory. We prove the conjecture that the defect can be…

High Energy Physics - Theory · Physics 2023-03-16 E. Lanina , A. Morozov

Given a knot presented as a braid closure, we construct a unified intersection model for the Alexander and Jones polynomials of the knot via what we call quantum Heegaard diagrams. These diagrams are obtained by stabilising the disc model…

Geometric Topology · Mathematics 2026-01-21 Cristina Ana-Maria Anghel , András Juhász

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…

Probability · Mathematics 2015-03-19 Richard Kenyon

We prove that the $f$-vector of members in a certain class of meet semi-lattices satisfies Macaulay inequalities. We construct a large family of meet semi-lattices belonging to this class, which includes all posets of multicomplexes, as…

Combinatorics · Mathematics 2007-05-23 Eran Nevo

We present an application of the Grassmann algebra to the problem of the monomer-dimer statistics on a two-dimensional square lattice. The exact partition function, or total number of possible configurations, of a system of dimers with a…

Statistical Mechanics · Physics 2015-06-18 Nicolas Allegra , Jean-Yves Fortin

We give a general method to construct a complete set of linearly independent Casimir operators of a Lie algebra with rank N. For a Casimir operator of degree p, this will be provided by an explicit calculation of its symmetric coefficients…

High Energy Physics - Theory · Physics 2009-10-30 H. R. Karadayi , M. Gungormez

We introduce a new bivariate polynomial which we call the defensive alliance polynomial and denote it by da(G; x, y). It is a generalization of the alliance polynomial [Carballosa et al., 2014] and the strong alliance polynomial [Carballosa…

Combinatorics · Mathematics 2018-11-27 Hany Ibrahim

In this article we use the cluster structure on the Grassmannian and the combinatorics of plabic graphs to exhibit a new aspect of mirror symmetry for Grassmannians in terms of polytopes. For our $A$-model, we consider the Grassmannian…

Algebraic Geometry · Mathematics 2017-12-06 Konstanze Rietsch , Lauren Williams

A quiver is an oriented graph. Quiver mutation is an elementary operation on quivers. It appeared in physics in Seiberg duality in the nineties and in mathematics in the definition of cluster algebras by Fomin-Zelevinsky in 2002. We show,…

Combinatorics · Mathematics 2017-09-13 Bernhard Keller

Associated to a convex integral polygon $N$ is a cluster integrable system $\mathcal X_N$ constructed from the dimer model. We compute the group $G_N$ of symmetries of $\mathcal X_N$, called the (2-2) cluster modular group, showing that it…

Combinatorics · Mathematics 2021-11-16 Terrence George , Giovanni Inchiostro

We discuss the relation between knot polynomials and the KP hierarchy. Mainly, we study the scaling 1-hook property of the coloured Alexander polynomial: $\mathcal{A}^\mathcal{K}_R(q)=\mathcal{A}^\mathcal{K}_{[1]}(q^{\vert R\vert})$ for all…

High Energy Physics - Theory · Physics 2018-07-20 A. Mironov , S. Mironov , V. Mishnyakov , A. Morozov , A. Sleptsov

Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…

Rings and Algebras · Mathematics 2007-11-05 Isabel Goffa , Eric Jespers , Jan Okninski

For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…

Data Structures and Algorithms · Computer Science 2013-09-05 Marc Lelarge , Hang Zhou

A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer , H. Lakser

We develop a dimer model for the Alexander polynomial of a knot. This recovers Kauffman's state sum model for the Alexander polynomial using the language of dimers. By providing some additional structure we are able to extend this model to…

Geometric Topology · Mathematics 2014-05-14 Moshe Cohen , Oliver T. Dasbach , Heather M. Russell

We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…

Rings and Algebras · Mathematics 2007-05-23 Sergey Fomin , Andrei Zelevinsky

A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…

Computational Complexity · Computer Science 2020-06-11 Fedor V. Fomin , Petr A. Golovach , Torstein J. F. Strømme , Dimitrios M. Thilikos
‹ Prev 1 3 4 5 6 7 10 Next ›