English
Related papers

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

200 papers

It has been established in recent years how to approach acyclic cluster algebras of finite type using subword complexes. In this paper, we continue this study by describing the c- and g-vectors, and by providing a conjectured description of…

Combinatorics · Mathematics 2016-08-26 Sarah Brodsky , Christian Stump

We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…

Statistics Theory · Mathematics 2024-03-27 Xifan Yu , Ilias Zadik , Peiyuan Zhang

Associated with any composition beta=(a,b,...) is a corresponding fence poset F(beta) whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... The distributive lattice L(beta) of all lower order…

Combinatorics · Mathematics 2022-01-11 Sergi Elizalde , Bruce Sagan

We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, we show that for any…

Combinatorics · Mathematics 2025-09-23 Ragnar Freij-Hollanti , Teemu Lundström , Aki Mori

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…

Combinatorics · Mathematics 2009-02-14 Komei Fukuda , Christophe Weibel

Kempf [1976] studied proper, G-equivariant maps from equivariant vector bundles over flag manifolds to G-representations V, which he called _collapsings_. We give a simple formula for the G-equivariant cohomology class on V,…

Algebraic Geometry · Mathematics 2007-05-23 Allen Knutson , Mark Shimozono

Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…

Combinatorics · Mathematics 2017-03-03 T. Kotek , J. A. Makowsky , E. V. Ravve

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

Combinatorics · Mathematics 2021-01-26 Karim Adiprasito , Geva Yashfe

Let $f(x) = x^{2g+1} + c_1 x^{2g} + \dots + c_{2g+1} \in k[x]$ be a polynomial of nonzero discriminant, and let $J$ denote the Jacobian of the odd hyperelliptic curve $C : y^2 = f(x)$. We show that the morphism $J \to \mathbb{P}^{2^g-1}$…

Number Theory · Mathematics 2025-07-10 Jef Laga , Jack A. Thorne

We study the deformation theory of the Stanley-Reisner rings associated to cluster complexes for skew-symmetrizable cluster algebras of geometric and finite cluster type. In particular, we show that in the skew-symmetric case, these cluster…

Algebraic Geometry · Mathematics 2025-03-03 Nathan Ilten , Alfredo Nájera Chávez , Hipolito Treffinger

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

Computational Geometry · Computer Science 2009-08-13 Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov

In this note we consider the Milnor fiber $F$ associated to a reduced projective plane curve $C$. A computational approach for the determination of the characteristic polynomial of the monodromy action on the first cohomology group of $F$,…

Algebraic Geometry · Mathematics 2017-08-30 Alexandru Dimca , Gabriel Sticlaru

We present a geometrical approach for studying dimers. We introduce a connection for dimer problems on bipartite and non-bipartite graphs. In the bipartite case the connection is flat but has non-trivial ${\bf Z}_2$ holonomy round certain…

High Energy Physics - Theory · Physics 2017-08-10 Charles Nash , Denjoe O'Connor

A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomorphisms of A is a distributive lattice where the meet of two…

Rings and Algebras · Mathematics 2022-11-03 Jānis Cīrulis

Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply…

Commutative Algebra · Mathematics 2014-11-25 Jürgen Herzog , Takayuki Hibi

We present a combinatorial model for cluster algebras of type $D_n$ in terms of centrally symmetric pseudotriangulations of a regular $2n$-gon with a small disk in the centre. This model provides convenient and uniform interpretations for…

Commutative Algebra · Mathematics 2023-11-14 Cesar Ceballos , Vincent Pilaud

Inspired by recent work of Geiss-Leclerc-Schroer, we use Hom-finite cluster categories to give a good candidate set for a basis of (upper) cluster algebras with coefficients arising from quivers. This set consists of generic values taken by…

Representation Theory · Mathematics 2012-03-08 Pierre-Guy Plamondon

A simple application of classical density functional theory is derived and applied to a system of polymers grafted to a plane. The system is assumed to have symmetry in directions parallel to the grafting plane hence it being a…

Soft Condensed Matter · Physics 2016-12-02 Luke Kristopher Davis

For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$. We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial…

Combinatorics · Mathematics 2014-12-09 Gleb Nenashev

Let $G$ be a simple graph of order $n$. The {\em domination polynomial} of $G$ is the polynomial ${D(G, x)=\sum_{i=0}^{n} d(G,i) x^{i}}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Let $n$ be any positive integer…

Combinatorics · Mathematics 2014-08-29 Saeid Alikhani , Jason Brown , Somayeh Jahari