Related papers: Greedy elements in rank 2 cluster algebras

Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…

We show that the main results of Happel-Rickard-Schofield (1988) and Happel-Reiten-Smalo (1996) on piecewise hereditary algebras are coherent with the notion of group action on an algebra. Then, we take advantage of this compatibility and…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…

We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…

Let $\Delta$ be a finite set and $G$ be a subgroup of $\operatorname{Sym}(\Delta)$. An irredundant base for $G$ is a sequence of points of $\Delta$ yielding a strictly descending chain of pointwise stabilisers, terminating with the trivial…

We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…

Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…

Let $\mathcal{O}$ be the category of representations of the Borel subalgebra of a quantum affine algebra introduced by Jimbo and the first author. We show that the Grothendieck ring of a certain monoidal subcategory of $\mathcal{O}$ has the…

An associative division algebra D is said to be _affine_ over a central subfield k if D is finitely generated as a k-algebra. In 1956 Amitsur famously proved that, when k is uncountable, D cannot be k-affine unless D is algebraic over k. In…

In an attempt to create an algebraic framework for dual canonical bases and total positivity in semisimple groups, we initiate the study of a new class of commutative algebras.

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…

In this article we study in detail the category of noncommutative motives of separable algebras Sep(k) over a base field k. We start by constructing four different models of the full subcategory of commutative separable algebras CSep(k).…

The theory of greedy-like bases started in 1999 when S. V. Konyagin and V. N. Temlyakov introduced in \cite{KT} the famous Thresholding Greedy Algorithm. Since this year, different greedy-like bases appeared in the literature, as for…

We compute the class group of a full rank upper cluster algebra in terms of its exchange polynomials. As a corollary, we recover a theorem by Cao, Keller, and Qin from 2023 characterizing the UFDs among these algebras. Furthermore, under…

In this paper we study cluster algebras $\myAA$ of type $A_2^{(1)}$. We solve the recurrence relations among the cluster variables (which form a T--system of type $A_2^{(1)}$). We solve the recurrence relations among the coefficients of…

We determine simplicity criteria in characteristics 0 and $p$ for a ubiquitous class of iterated skew polynomial rings in two indeterminates over a base ring. One obstruction to simplicity is the possible existence of a canonical normal…

We define a class of associative algebras generalizing 'clannish algebras', as introduced by the second author, but also incorporating semilinear structure, like a skew polynomial ring. Clannish algebras generalize the well known 'string…

In the design of algorithms, the greedy paradigm provides a powerful tool for solving efficiently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative…

Decision trees and decision rule systems play important roles as classifiers, knowledge representation tools, and algorithms. They are easily interpretable models for data analysis, making them widely used and studied in computer science.…