Related papers: Cluster Algebras and Dilogarithm Identities

We construct, using the quantum dilogarithm, a series of *-representations of quantized cluster varieties. This includes a construction of infinite dimensional unitary projective representations of their discrete symmetry groups - the…

Clustering is a widely used technique in data mining applications for discovering patterns in underlying data. Most traditional clustering algorithms are limited to handling datasets that contain either numeric or categorical attributes.…

Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…

We introduce a new category C, which we call the cluster category, obtained as a quotient of the bounded derived category D of the module category of a finite-dimensional hereditary algebra H over a field. We show that, in the simply-laced…

When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus \emph{Elements} [1]) are rarely spoken. The…

Loday's dendriform algebras and its siblings pre-Lie and zinbiel have received attention over the past two decades. In recent literature, there has been interest in a generalization of these types of algebra in which each individual…

A quantum generalization of Rogers' five term, or ``pentagon'' dilogarithm identity is suggested. It is shown that the classical limit gives usual Rogers' identity. The case where the quantum identity is realized in finite dimensional space…

We study the dilogarithm identities from algebraic, analytic, asymptotic, $K$-theoretic, combinatorial and representation-theoretic points of view. We prove that a lot of dilogarithm identities (hypothetically all !) can be obtained by…

Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure.…

In this paper, we introduce the enough $g$-pairs property for a principal coefficients cluster algebra, which can be understood as a strong version of the sign-coherence of the $G$-matrices. Then we prove that any skew-symmetrizable…

The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…

Clustering is one of the most fundamental problems in data analysis and it has been studied extensively in the literature. Though many clustering algorithms have been proposed, clustering theories that justify the use of these clustering…

We describe an infinite family of non-Pl\"ucker cluster variables inside the double Bruhat cell cluster algebra defined by Berenstein, Fomin, and Zelevinsky. These cluster variables occur in a family of subalgebras of the double Bruhat cell…

During a first St. Petersburg period Leonhard Euler, in his early twenties, became interested in the Basel problem: summing the series of inverse squares (posed by Pietro Mengoli in mid 17th century). In the words of Andre Weil (1989) "as…

Locally acyclic cluster algebras are Krull domains. Hence their factorization theory is determined by their (divisor) class group and the set of classes containing height-1 prime ideals. Motivated by this, we investigate class groups of…

Let $H$ be a hereditary algebra of Dynkin type $D_n$ over a field $k$ and $\mathscr{C}_H$ be the cluster category of $H$. Assume that $n\geq 5$ and that $T$ and $T'$ are tilting objects in $\mathscr{C}_H$. We prove that the cluster-tilted…

Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby discover, relate, and structure types: of behaviour,…

We formalize the way in which one can think about cluster algebras of infinite rank by showing that every rooted cluster algebra of infinite rank can be written as a colimit of rooted cluster algebras of finite rank. Relying on the proof of…

Clustering is a fundamental machine learning task which has been widely studied in the literature. Classic clustering methods follow the assumption that data are represented as features in a vectorized form through various representation…

We derive precise formulas for the archimedean Euler factors occurring in certain standard Langlands $L$-functions for unitary groups. In the 1980s, Paul Garrett, as well as Ilya Piatetski-Shapiro and Stephen Rallis (independently of…