Related papers: Enumerating m-clusters using exceptional sequences
We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…
In this paper, we consider several special polynomials related to associated sequences of polynomials. Finally, we give some new and interesting identities of those polynomials arising from transfer formula for the associated sequences.
We give necessary and sufficient conditions for torsion pairs in a hereditary category to be in bijection with $t$-structures in the bounded derived category of that hereditary category. We prove that the existence of a split $t$-structure…
We provide a complete classification of the singularities of cluster algebras of finite type with trivial coefficients. Alongside, we develop a constructive desingularization of these singularities via blowups in regular centers over fields…
Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant…
We establish a bijective correspondence between certain non-self-intersecting curves in an $n$-punctured disc and positive ${\mathbf c}$-vectors of acyclic cluster algebras whose quivers have multiple arrows between every pair of vertices.…
Motivated by the relation holding for the m-generalized Catalan numbers of type A and C, the connection between dominant regions of the m-Shi arrangement of type A and C is investigated. In the same line of thought, a bijection between mn+1…
A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…
A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.
We prove the existence of an $m$-cluster tilting object in a generalized $m$-cluster category which is $(m+1)$-Calabi-Yau and Hom-finite, arising from an $(m+2)$-Calabi-Yau dg algebra. This is a generalization of the result for the ${m =…
We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense,…
We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…
We give a geometric realization of a subcategory of the $m$-cluster category $\mathcal{C}^m$ of type $\widetilde{A}_{p,q}$, by using $(m+2)$-angulations of an annulus with $p+q$ marked points. We also give a bijection between an equivalence…
This note discusses the bijection between the exceptional subcategories of representations of quivers and generalized non-crossing partitions of Weyl groups. We give a new proof of the Ingalls-Thomas-Igusa-Schiffler bijection by using the…
We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…
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…
We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…