Related papers: Cluster Monomials in Graph Laurent Phenomenon Alge…
The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When…
Generalized cluster algebras from orbifolds were defined by Chekhov and Shapiro to give a combinatorial description of their Teichm\"uller spaces. One can also assign a gentle algebra to a triangulated orbifold, as in the work of…
The classification of Grassmannian cluster algebras resembles that of regular polygonal tilings. We conjecture that this resemblance may indicate a deeper connection between these seemingly unrelated structures.
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…
We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its…
In this paper, we simplify and generalize formulas for the expansion of rank 2 cluster variables. In particular, we prove an equivalent, but simpler, description of the colored Dyck subpaths framework introduced by Lee and Schiffler. We…
A generalization of down-up algebras was introduced by Cassidy and Shelton (J. Algebra 279 (2004), no. 1), the so-called generalized down-up algebras. We describe the automorphism group of conformal Noetherian generalized down-up algebras…
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…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
Weakly separated collections arise in the cluster algebra derived from the Pl\"ucker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$…
In this paper we find the exchange graph of the rank n binomial Laurent phenomenon algebra associated to the complete graph on n vertices. More specifically, we prove that this exchange graph is isomorphic to that of the rank n linear…
The magnitude of a graph can be thought of as an integer power series associated to a graph; Leinster introduced it using his idea of magnitude of a metric space. Here we introduce a bigraded homology theory for graphs which has the…
We describe all the quasi-bialgebra structures of a group algebra over a torsion-free abelian group. They all come out to be triangular in a unique way. Moreover, up to an isomorphism, these quasi-bialgebra structures produce only one…
In 1882, Kronecker established that a given univariate formal Laurent series over a field can be expressed as a fraction of two univariate polynomials if and only if the coefficients of the series satisfy a linear recurrence relation. We…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
We study the relationship between two sets of coordinates on a double Bruhat cell, the cluster variables introduced by Berenstein, Fomin, and Zelevinsky and the $\CX$-coordinates defined by the coweight parametrization of Fock and…
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization of directed graphs, consisting of an undirected graph…
It is conjectured by Ibrahim Assem, Ralf Schiffler and Vasilisa Shramchenko in "Cluster Automorphisms and Compatibility of Cluster Variables" that every cluster algebra is unistructural, that is to say, that the set of cluster variables…
Motivated by chemical applications, we revisit and extend a family of positive definite kernels for graphs based on the detection of common subtrees, initially proposed by Ramon et al. (2003). We propose new kernels with a parameter to…