Related papers: Rational Noncrossing Coxeter-Catalan Combinatorics
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…
We introduce the notion of Rota-Baxter coalgebra which can be viewed as the dual notion of Rota-Baxter algebra. We provide some concrete examples and establish various properties of this new object. We also consider comodules over…
We show that the wall crossing bijections between simples of the category O of the rational Cherednik algebras reduce to particular crystal isomorphisms which can be computed by a simple combinatorial procedure on multipartitions of fixed…
Using the geometry of the associated Calogero-Moser space, R. Rouquier and the author have attached to any finite complex reflection group $W$ several notions (Calogero-Moser left, right or two-sided cells, Calogero-Moser cellular…
A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.
Connections between set-theoretic Yang-Baxter and reflection equations and quantum integrable systems are investigated. We show that set-theoretic $R$-matrices are expressed as twists of known solutions. We then focus on reflection and…
We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of…
For a coincidental Coxeter group, i.e. of type $A_{n-1}, BC_n, H_3,$ or $I_2(m)$, we define the corresponding $q$-Kreweras numbers attached to limit symbols in the sense of Shoji. The construction of these numbers resembles the argument of…
We study generalized comatrix coalgebras and upper triangular comatrix coalgebras, which are not only a dualization but also an extension of classical generalized matrix algebras. We use these to answer several questions on Noetherian and…
Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…
We provide the combinatorial proofs of the log-convexity for the derangement numbers in the symmetric group $\mathfrak{S}_n$, hyperoctahedral group $\mathfrak{B}_n$, and the demihyperoctahedral group $\mathfrak{D}_n$. We also show that the…
The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…
Our basic objects are partitions of finite sets of points into disjoint subsets. We investigate sets of partitions which are closed under taking tensor products, composition and involution, and which contain certain base partitions. These…
Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…
We introduce and study certain topological spaces associated with connected rooted graphs. These spaces reflect combinatorial and order theoretic properties of the underlying graph and relate in the case of hyperbolic graphs to Gromov's…
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…
Given an irreducible well-generated complex reflection group W with Coxeter number h, we call a Coxeter element any regular element (in the sense of Springer) of order h in W; this is a slight extension of the most common notion of Coxeter…
We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.
In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…
The higher $q,t$-Catalan polynomial $C^{(m)}_n(q,t)$ can be defined combinatorially as a weighted sum of lattice paths contained in certain triangles, or algebraically as a complicated sum of rational functions indexed by partitions of $n$.…