English
Related papers

Related papers: Enumerating m-clusters using exceptional sequences

200 papers

For an exact category having enough projective objects, we establish a bijection between thick subcategories containing the projective objects and thick subcategories of the stable derived category. Using this bijection we classify thick…

Category Theory · Mathematics 2015-01-14 Henning Krause , Greg Stevenson

In this paper we explore the concept of {\em good heredity} for fields from a group theoretic perspective. Extending results from \cite{alice}, we show that several natural families of fields are of good heredity, and some others are not.…

Rings and Algebras · Mathematics 2016-01-15 Alice Medvedev , Ramin Takloo-Bighash

A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.

Combinatorics · Mathematics 2018-08-17 Helmut Prodinger , Sarah J. Selkirk

In many situations it is desirable to identify clusters that differ with respect to only a subset of features. Such clusters may represent homogeneous subgroups of patients with a disease, such as cancer or chronic pain. We define a…

Methodology · Statistics 2014-07-14 Qian Liu , Guanhua Chen , Michael R. Kosorok , Eric Bair

We give a survey on Auslander-Gorenstein algebras with a focus on finite-dimensional algebras. We put an emphasis on recent classification results for special classes of algebras and the newly discovered interactions of the Auslander-Reiten…

Representation Theory · Mathematics 2025-08-27 Viktória Klász , Rene Marczinzik

The article concerns the existence and uniqueness of quantisations of cluster algebras. We prove that cluster algebras with an initial exchange matrix of full rank admit a quantisation in the sense of Berenstein-Zelevinsky and give an…

Quantum Algebra · Mathematics 2017-09-11 Florian Gellert , Philipp Lampe

In this paper, we generalise part of the theory of hereditary algebras to the context of prospecies of algebras. Here, a prospecies is a generalisation of Gabriel's concept of species gluing algebras via projective bimodules along a quiver…

Representation Theory · Mathematics 2017-03-07 Julian Külshammer

Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with natural involutions. In this paper, we add a combinatorial family to the list, and show that the known bijections between these…

Combinatorics · Mathematics 2014-02-13 Kevin Dilks

We call a triangulated category \emph{hereditary} provided that it is equivalent to the bounded derived category of a hereditary abelian category, where the equivalence is required to commute with the translation functors. If the…

Rings and Algebras · Mathematics 2019-02-19 Xiao-Wu Chen , Claus Michael Ringel

This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…

Representation Theory · Mathematics 2012-03-14 Bernhard Keller

In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this…

Combinatorics · Mathematics 2016-10-10 Eugen J. Ionascu , Thor Martinsen , Pantelimon Stanica

Biclustering is a class of techniques that simultaneously clusters the rows and columns of a matrix to sort heterogeneous data into homogeneous blocks. Although many algorithms have been proposed to find biclusters, existing methods suffer…

Machine Learning · Statistics 2020-02-11 Michelle N. Ngo , Dustin S. Pluta , Alexander N. Ngo , Babak Shahbaba

We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…

Logic · Mathematics 2021-03-19 Luiz F. Monteiro , Juan Manuel Cornejo , Ignacio D. Viglizzo

We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…

Algebraic Geometry · Mathematics 2019-12-30 Miguel N. Walsh

We study the cluster algebras arising from cluster tubes with rank bigger than $1$. Cluster tubes are $2-$Calabi-Yau triangulated categories which contain no cluster tilting objects, but maximal rigid objects. Fix a certain maximal rigid…

Representation Theory · Mathematics 2017-05-17 Yu Zhou , Bin Zhu

We show that a certain orbit category considerd by Keller encodes the combinatorics of the $m$-clusters of Fomin and Reading in a fashion similar to the way the cluster category of Buan, Marsh, Reineke, Reiten, and Todorov encodes the…

Representation Theory · Mathematics 2007-09-10 Hugh Thomas

The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called a class of mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs.…

Discrete Mathematics · Computer Science 2026-05-27 Ashok Kumar Das , Rajkamal Sahu , Amina Khatun

Given a finite acyclic quiver Q with path algebra kQ, Ingalls and Thomas have exhibited a bijection between the set of Morita equivalence classes of support-tilting modules and the set of thick subcategories of mod kQ and they have…

Representation Theory · Mathematics 2015-12-01 Mustafa A. A. Obaid , S. Khalid Nauman , Wafaa M. Fakieh , Claus Michael Ringel

We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…

Combinatorics · Mathematics 2017-08-15 Glenn Tesler

Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…

Number Theory · Mathematics 2016-04-04 Bengt Månsson
‹ Prev 1 4 5 6 7 8 10 Next ›