Related papers: Greedy elements in rank 2 cluster algebras
We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where…
Let $F$ be a field with at least three elements and $G$ a locally finite group. This paper aims to show that if either $F$ is algebraically closed or the characteristic of $F$ is positive, then an element in the group algebra $FG$ is a…
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…
In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a…
Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.~V.~Konyagin and V.~N.~Temlyakov, A…
We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation…
In this paper we study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from…
In this paper, we study weights for the Thresholding Greedy Algorithm (TGA). While previous work focused on sequential weights $\varsigma = (s_n)_{n\in\mathbb{N}}$ on each positive integer, we study a more general weight $\omega =…
We develop an elementary theory of partially additive rings as a foundation of ${\mathbb F}_1$-geometry. Our approach is so concrete that an analog of classical algebraic geometry is established very straightforwardly. As applications, (1)…
We construct "quantum theta bases," extending the set of quantum cluster monomials, for various versions of skew-symmetric quantum cluster algebras. These bases consist precisely of the indecomposable universally positive elements of the…
A popular graph clustering method is to consider the embedding of an input graph into R^k induced by the first k eigenvectors of its Laplacian, and to partition the graph via geometric manipulations on the resulting metric space. Despite…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
Order three elements in the exceptional groups of type G2 are classified up to conjugation over arbitrary fields. Their centralizers are computed, and the associated classification of idempotents in symmetric composition algebras is…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
Consider two ordered positive real number arrays of equal size. The problem is to find such set of indices of given size that the ratio of the sums of the array elements with those indices is minimized. In this work, in order to mitigate…
The greedy algorithm A iterates over a set of uniformly sized independent sets of a given graph G and checks for each set S which non-neighbor of S, if any, is best suited to be added to S, until no more suitable non-neighbors are found for…
In \cite{CK2005} and \cite{SZ}, the authors constructed the bases of cluster algebras of finite types and of type $\widetilde{A}_{1,1}$, respectively. In this paper, we will deduce $\mathbb{Z}$-bases for cluster algebras of affine types.
This paper classifies and constructs explicitly all the irreducible representations of affine Hecke algebras of rank two root systems. The methods used to obtain this classification are primarily combinatorial and are, for the most part, an…
Let $A$ be a hereditary algebra. We construct a fundamental domain for the cluster category of $A$ inside the category of modules over the duplicated algebra $\bar{A}$ of $A$. We then prove that there exists a bijection between the tilting…