Related papers: Q-systems, Heaps, Paths and Cluster Positivity
We give the path model solution for the cluster algebra variables of the $A_r$ $T$-system with generic boundary conditions. The solutions are partition functions of (strongly) non-intersecting paths on weighted graphs. The graphs are the…
We review the solution of the $A_r$ Q-systems in terms of the partition function of paths on a weighted graph, and show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of…
In this review article, we present a unified approach to solving discrete, integrable, possibly non-commutative, dynamical systems, including the $Q$- and $T$-systems based on $A_r$. The initial data of the systems are seen as cluster…
We provide a concrete realization of the cluster algebras associated with Q-systems as amalgamations of cluster structures on double Bruhat cells in simple algebraic groups. For nonsimply-laced groups, this provides a cluster-algebraic…
Q-systems first appeared in the analysis of the Bethe equations for the XXX-model and generalized Heisenberg spin chains. Such systems are known to exist for any simple Lie algebra and many other Kac-Moody algebras. We formulate the…
We define the cluster algebra associated with the Q-system for the Kirillov-Reshetikhin characters of the quantum affine algebra $U_q(\hat{\g})$ for any simple Lie algebra g, generalizing the simply-laced case treated in [Kedem 2007]. We…
In this paper we give a direct proof of the positivity conjecture for adapted quantum cluster variables. Moreover, our process allows one to explicitly compute formulas for all adapted cluster monomials and certain ordered products of…
The quantum extreme reservoir computation (QERC) is a versatile quantum neural network model that combines the concepts of extreme machine learning with quantum reservoir computation. Key to QERC is the generation of a complex quantum…
For any acyclic quiver $Q$ without multiple edges, we construct a monoidal category $\mathcal{R}_Q$ whose indecomposable objects are tensor products (over the base field) of finite-dimensional modules over the path algebra of $Q$. We show…
$Q$-systems are recursion relations satisfied by the characters of the restrictions of special finite-dimensional modules of quantum affine algebras. They can also be viewed as mutations in certain cluster algebras, which have a natural…
We discuss the relation between the cluster integrable systems and $q$-difference Painlev\'e equations. The Newton polygons corresponding to these integrable systems are all 16 convex polygons with a single interior point. The Painlev\'e…
For each simple Lie algebra $\mathfrak{g}$, we construct an algebra embedding of the quantum group $U_q(\mathfrak{g})$ into certain quantum torus algebra $D_\mathfrak{g}$ via the positive representations of split real quantum group. The…
Some models of clustering processes are formulated and analytically solved employing generating functions methods. Those models include events which result from combined action of the coagulation and fragmentation processes. Fragmentation…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
We introduce a new class of combinatorial objects, named tight gradings, which are certain nonnegative integer-valued functions on maximal Dyck paths. Using tight gradings, we derive a manifestly positive formula for any wall-function in a…
We present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the other two make use of quantum approximate counting, and all of…
We derive explicit expressions for the generating series of the fundamental solutions of the $A_r$ quantum $Q$-system of Ref. [P. Di Francesco and R. Kedem, arXiv:1006.4774 [math-ph]], expressed in terms of any admissible initial data.…
In this study, we consider the positive cluster complex, a full subcomplex of a cluster complex the vertices of which are all non-initial cluster variables. In particular, we provide a formula for the difference in face vectors of positive…
A cluster algebra is an algebraic structure generated by operations of a quiver (a directed graph) called the mutations and their associated simple birational mappings. By using a graph-combinatorial approach, we present a systematic way to…
We develop a general theory of cluster categories, applying to a 2-Calabi-Yau extriangulated category $\mathcal{C}$ and cluster-tilting subcategory $\mathcal{T}$ satisfying only mild finiteness conditions. We show that the structure theory…