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

Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…

We construct scattering diagrams for Chekhov-Shapiro's generalized cluster algebras where exchange polynomials are factorized into binomials, generalizing the cluster scattering diagrams of Gross, Hacking, Keel and Kontsevich. They turn out…

Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…

Let $G$ be a bipartite planar graph with edges directed from black to white. For each vertex $v$ let $n_v$ be a positive integer. A multiweb in $G$ is a multigraph with multiplicity $n_v$ at vertex $v$. A connection is a choice of linear…

In their "Cluster Algebras IV" paper, Fomin and Zelevinsky defined F-polynomials and g-vectors, and they showed that the cluster variables in any cluster algebra can be expressed in a formula involving the appropriate F-polynomial and…

We consider an arbitrary polynomial map $f:{\mathbb C}^{n+1}\to {\mathbb C} $ and we study the Alexander invariants of ${\mathbb C}^{n+1}\setminus X$ for any fiber $X$ of $f$. The article has two major messages. First, the most important…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a…

We give a quiver representation theoretic interpretation of generalized cluster complexes defined by Fomin and Reading. By using $d-$cluster categories which are defined by Keller as triangulated orbit categories of (bounded) derived…

Let $P\subset \mathbb R^n$ be a belt polytope, that is a polytope whose normal fan coincides with the fan of some hyperplane arrangement $\mathcal A$. Also, let $G:\mathbb R^n\to\mathbb R^d$ be a linear map of full rank whose kernel is in…

We study cluster algebra of affine type $A_1^{(1)}$ by using two methods including counting the numbers of perfect matchings on snake graphs and compatible pairs on maximal Dyck paths. We find that the sum of coefficients of the terms in…

Let $D$ be division algebra over its center $C$, let $\sigma$ be an endormorphism of $D$, let $\delta$ be a left $\sigma$-derivation of $D$, and let $R=D[t;\sigma,\delta]$ be a skew polynomial ring. We study the structure of a class of…

Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…

We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…

Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…

Let $A = \Bbbk Q / I$ be the path algebra of any finite quiver $Q$ modulo any two-sided ideal $I$ of relations and let $R$ be any reduction system satisfying the diamond condition for $I$. We introduce an intrinsic notion of deformation of…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

To each quadratic number field $K$ and each quadratic polynomial $f$ with $K$-coefficients, one can associate a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, and whose edges reflect the…

Harary et al. and Klein and Randic proposed the forcing number of a perfect matching in mathematics and chemistry, respectively. In detail, the forcing number of a perfect matching M of a graph G is the smallest cardinality of subsets of M…

Categorification of scattering amplitudes for planar Feynman diagrams in scalar field theories with a polynomial potential is reported. Amplitudes for cubic theories are directly written down in terms of projectives of hearts of…