Related papers: Broken Bracelets and Kostant's Partition Function
Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra $\mathfrak{g}$ as a nonnegative integral linear combination of the positive roots of $\mathfrak{g}$.…
Kostant's partition function counts the number of distinct ways to express a weight of a classical Lie algebra $\mathfrak{g}$ as a sum of positive roots of $\mathfrak{g}$. We refer to each of these expressions as decompositions of a weight.…
Kostant's partition function counts the number of ways to represent a particular vector (weight) as a nonnegative integral sum of positive roots of a Lie algebra. For a given weight the $q$-analog of Kostant's partition function is a…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
This paper introduces the concept of necklace binomial coefficients motivated by the enumeration of a special type of sequences. Several properties of these coefficients are described, including a connection between their roots and an…
In this paper, we develop the theory of the necklace ring and the logarithmic function. Regarding the necklace ring, we introduce the necklace ring functor $Nr$ from the category of special $\ld$-rings into the category of special…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We introduce the notion of brick-splitting torsion pairs as a modern analogue and generalization of the classical notion of splitting torsion pairs. A torsion pair is called brick-splitting if any given brick is either torsion or…
Inspired by Morse theory, we introduce a topological stack Broken, which we refer to as the moduli stack of broken lines. We show that Broken can be presented as a Lie groupoid with corners and provide a combinatorial description of sheaves…
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…
A vector partition function is the number of ways to write a vector as a non-negative integer-coefficient sum of the elements of a finite set of vectors $\Delta$. We present a new algorithm for computing closed-form formulas for vector…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every $k$-colored necklace can be fairly split by at most $k$…
The multiplicity of a weight in a finite-dimensional irreducible representation of a simple Lie algebra g can be computed via Kostant's weight multiplicity formula. This formula consists of an alternating sum over the Weyl group (a finite…
A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
We develop the notion of deformations using a valuation ring as ring of coefficients. This permits to consider in particular the classical Gerstenhaber deformations of associative or Lie algebras as infinitesimal deformations and to solve…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…