Related papers: The valuation pairing on an upper cluster algebra
We initiate a systematic study of the cohomology of cluster varieties. We introduce the Louise property for cluster algebras that holds for all acyclic cluster algebras, and for most cluster algebras arising from marked surfaces. For…
Many matrices associated with fast transforms posess a certain low-rank property characterized by the existence of several block partitionings of the matrix, where each block is of low rank. Provided that these partitionings are known,…
Economists are blessed with a wealth of data for analysis, but more often than not, values in some entries of the data matrix are missing. Various methods have been proposed to handle missing observations in a few variables. We exploit the…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
We obtain a multiplication formula for cluster characters on (stably) 2-Calabi-Yau (Frobenius or) triangulated categories. This formula generalizes those known for arbitrary pairs of objects and for Auslander-Reiten triangles. As an…
Suppose that X to Y is a generically finite map of nonsingular varieties over a field of characteristic zero, and v is a valuation of the function field of X. We prove that it is possible to perform a sequence of monoidal transforms X' to X…
S. Alesker has shown that if $G$ is a compact subgroup of O(n) acting transitively on the unit sphere $S^{n-1}$ then the vector space $Val^G$ of continuous, translation-invariant, $G$-invariant convex valuations on $R^n$ has the structure…
A main task in data analysis is to organize data points into coherent groups or clusters. The stochastic block model is a probabilistic model for the cluster structure. This model prescribes different probabilities for the presence of edges…
We introduce a pseudo $\mathbb{N}$-grading on the cluster auotmorphism group $\operatorname{Aut}(\mathcal{A})$ with respect to an initial seed of $\mathcal{A}$, which consists of a family of subsets $\{G_i\}_{i\in \mathbb{N}}$ of…
A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large…
Compared to supervised variable selection, the research on unsupervised variable selection is far behind. A forward partial-variable clustering full-variable loss (FPCFL) method is proposed for the corresponding challenges. An advantage is…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
We extend based cluster algebras from the finite rank case to the infinite rank case. By extending (quantum) cluster algebras whose initial seeds are associated with signed words (arising from double Bott--Samelson cells), we recover…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
In the present paper, we first give a characterization for Bongartz completion in $\tau$-tilting theory via $c$-vectors. Motivated by this characterization, we give the definition of Bongartz completion in cluster algebras using…
A prototypical examples of a cluster algebra is the coordinate ring of a finite Grassmannian: using the Pl\"ucker embedding the cluster algebra structure allows one to move between `maximal sets' of algebraically independent Pl\"ucker…
We prove that the cluster monomials in non-initial cluster variables are uniquely determined by the Newton polytopes of their $F$-polynomials for skew-symmetrizable cluster algebras. Accordingly, we prove that the $\tau$-rigid modules and…
A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…
We consider clustering in group decision making where the opinions are given by pairwise comparison matrices. In particular, the k-medoids model is suggested to classify the matrices since it has a linear programming problem formulation…
Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…