Related papers: Comments on Exchange Graphs in Cluster Algebras
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
Cluster-tilted algebras are trivial extensions of tilted algebras. This correspondence induces a surjective map from tilted algebras to cluster-tilted algebras. If B is a cluster-tilted algebra, we use the fibre of B under this map to study…
Matrix mutation appears in the definition of cluster algebras of Fomin and Zelevinsky. We give a representation theoretic interpretation of matrix mutation, using tilting theory in cluster categories of hereditary algebras. Using this, we…
For an interval exchange map, the number of discontinuities of its iterates either exhibits linear growth or is bounded. This dichotomy is used to prove that the group of interval exchanges does not contain distortion elements, giving…
Using the well-known free-field formalism for quantum groups, we demonstrate in case of $A(n)_q$, that quantum group is naturally also a cluster variety. Widely used formulae for mutations are direct consequence of independence of group…
Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…
A digraph is attached to any evolution algebra. This graph leads to some new purely algebraic results on this class of algebras and allows for some new natural proofs of known results. Nilpotency of an evolution algebra will be proved to be…
The dilogarithm identities for the central charges of conformal field theories of simply laced type were conjectured by Bazhanov, Kirillov, and Reshetikhin. Their functional generalizations were conjectured by Gliozzi and Tateo. They have…
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs.…
Exchangeable arrays are natural tools to model common forms of dependence between units of a sample. Jointly exchangeable arrays are well suited to dyadic data, where observed random variables are indexed by two units from the same…
We study the tropical dualities and properties of exchange graphs for the totally sign-skew-symmetric cluster algebra under a condition. We prove that the condition always holds for acyclic cluster algebras, then all results hold for the…
The objective of the present paper is to prove cluster multiplication theorem in the quantum cluster algebra of type $A_{2}^{(2)}$. As corollaries, we obtain bar-invariant $\mathbb{Z}[q^{\pm\frac{1}{2}}]$-bases established in [6], and…
We introduce and study a Hamiltonian formalism of mutations in cluster algebras using canonical variables, where the Hamiltonian is given by the Euler dilogarithm. The corresponding Lagrangian, restricted to a certain subspace of the phase…
Clustering mechanisms are essential in certain multiuser networks for achieving efficient resource utilization. This lecture note presents the theory of coalition formation as a useful tool for distributed clustering problems. We reveal the…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…
We develop an elementary formula for certain non-trivial elements of upper cluster algebras. These elements have positive coefficients. We show that when the cluster algebra is acyclic these elements form a basis. Using this formula, we…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
Clifford algebras are used for constructing spin groups, and are therefore of particular importance in the theory of quantum mechanics. But the spin group is not the only subgroup of the Clifford algebra. An algebraist's perspective on…