Related papers: Greedy elements in rank 2 cluster algebras
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…
In this paper we determine a class of critical sets in the abelian {2--group} that may be obtained from a greedy algorithm. These new critical sets are all 2--critical (each entry intersects an intercalate, a trade of size 4) and completes…
We characterize mutation-finite cluster algebras of rank at least 3 using positive semi-definite quadratic forms. In particular, we associate with every unpunctured bordered surface a positive semi-definite quadratic space $V$, and with…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
A cluster algebra is a commutative algebra whose structure is decided by a skew-symmetrizable matrix or a quiver. When a skew-symmetrizable matrix is invariant under an action of a finite group and this action is admissible, the folded…
We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalized Dyck words.
Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…
An $\alpha$-greedy balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of greedy linear extensions of $P$ that put $x$ before $y$ among all greedy linear extensions is in the real…
Partially greedy bases in Banach spaces were introduced by Dilworth et al. as a strictly weaker notion than the (almost) greedy bases. In this paper, we study two natural ways to strengthen the definition of partial greediness. The first…
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…
This article develops a new theoretical basis for decomposing signals that are formed by the linear superposition of a finite number of modes. Each mode depends nonlinearly upon several parameters; we seek both these parameters and the…
Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning directed acyclic graphs, greedy algorithms are popular despite…
We introduce a family of cluster algebras of infinite rank associated with root systems of type $A$, $D$, $E$. We show that suitable completions of these cluster algebras are isomorphic to the Grothendieck rings of the categories…
The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…
In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately…
We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this…
It was conjectured at the end of the book "Representation theory of Artin algebras" by M. Auslander, I. Reiten and S. Smalo that an Artin algebra with the property that its finitely generated indecomposable modules are up to isomorphism…
Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and…