English
Related papers

Related papers: Enumerating m-clusters using exceptional sequences

200 papers

In this article, we provide a bijection between the set of inversion sequences avoiding the pattern 102 and the set of 2-Schr\"{o}der paths having neither peaks nor valleys and ending with a diagonal step. To achieve this, we introduce two…

Combinatorics · Mathematics 2025-06-04 JiSun Huh , Sangwook Kim , Seunghyun Seo , Heesung Shin

Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in different domains. Apart from conventional clustering techniques,…

Artificial Intelligence · Computer Science 2017-02-20 Dmitry I. Ignatov , Bruce W. Watson

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete $m$-partite graphs $K_{n,n,\ldots,n}$. This bijection allows us to derive closed inclusion-exclusion…

Combinatorics · Mathematics 2025-10-31 El-Mehdi Mehiri

We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.

Combinatorics · Mathematics 2022-10-12 Mario Midence-Ordóñez

For any graded commutative noetherian ring, where the grading group is abelian and where commutativity is allowed to hold in a quite general sense, we establish an inclusion-preserving bijection between, on the one hand, the twist-closed…

Category Theory · Mathematics 2012-11-07 Ivo Dell'Ambrogio , Greg Stevenson

We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…

Number Theory · Mathematics 2026-02-17 Hichem Gargoubi , Sayed Kossentini

In this paper, we define the set of singular grid diagrams $\mathcal{SG}$ which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set…

Geometric Topology · Mathematics 2021-01-11 Byung Hee An , Hwa Jeong Lee

Cluster categories of hereditary algebras have been introduced as orbit categories of their derived categories. Keller has pointed out that for non-hereditary algebras orbit categories need not be triangulated, and he introduced the notion…

Representation Theory · Mathematics 2010-10-07 Claire Amiot , Steffen Oppermann

We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…

Rings and Algebras · Mathematics 2008-05-19 Shih-Wei Yang , Andrei Zelevinsky

We consider an orbit category of the bounded derived category of a path algebra of type A_n which can be viewed as a -(m+1)-cluster category, for m >= 1. In particular, we give a characterisation of those maximal m-rigid objects whose…

Representation Theory · Mathematics 2016-02-18 Raquel Coelho Simoes , Mark James Parsons

Let $\A$ be a finitary hereditary abelian category with enough projectives. We study the Hall algebra of complexes of fixed size over projectives. Explicitly, we first give a relation between Hall algebras of complexes of fixed size and…

Representation Theory · Mathematics 2019-04-05 Haicheng Zhang

We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…

Category Theory · Mathematics 2010-01-06 Petter Andreas Bergh , Steffen Oppermann

We give a complete description of finitely generated modules over artin algebras which are not the middle of a short chain of modules, using injective and tilting modules over hereditary artin algebras.

Representation Theory · Mathematics 2013-12-13 Alicja Jaworska , Piotr Malicki , Andrzej Skowroński

Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…

Discrete Mathematics · Computer Science 2021-12-30 Aleksander Kiryk

Abstract algebra provides a large hierarchy of properties that a collection of objects can satisfy, such as forming an abelian group or a semiring. These classifications can arranged into a broad and typically acyclic directed graph. This…

Logic in Computer Science · Computer Science 2023-07-24 Eric Wieser

We show that picture groups are directly related to maximal green sequences for valued Dynkin quivers of finite type. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without…

Representation Theory · Mathematics 2025-06-25 Kiyoshi Igusa , Gordana Todorov

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Combinatorics · Mathematics 2013-04-05 Adrian Ocneanu

Let $A$ be a finite dimensional hereditary algebra over an algebraically closed field $k$, $A^{(m)}$ be the $m$-replicated algebra of $A$ and $\mathscr{C}_{m}(A)$ be the $m$-cluster category of $ A$. We investigate properties of complements…

Representation Theory · Mathematics 2013-01-24 Hongbo Lv , Shunhua Zhang

In this paper, we will study some connections between Hilbert al- gebras and binary block-codes.With these codes, we can eassy obtain orders which determine suplimentary properties on these algebras. We will try to emphasize how, using…

Information Theory · Computer Science 2015-05-01 Cristina Flaut