Related papers: A bijection between noncrossing and nonnesting par…
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…
We establish a general method for generating reflections between categories. We then apply our technique to generate adjunctions starting from geometric morphisms between Grothendieck toposes; as particular cases, we recover various…
We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.
In this work, I investigate the noncommutative Poisson algebra of classical observables corresponding to a proposed general Noncommutative Quantum Mechanics, \cite{1}. I treat some classical systems with various potentials and some Physical…
We establish a bijection between rigged configurations and highest weight elements of a tensor product of Kirillov-Reshetikhin crystals for all nonexceptional types. A key idea for the proof is to embed both objects into bigger sets for…
Indistinguishability of particles is normally considered to be an inherently quantum property which cannot be possessed by a classical theory. However, Saunders has argued that this is incorrect, and that classically indistinguishable…
An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…
Else from the quotient algebra partition considered in the preceding episodes, two kinds of partitions on unitary Lie algebras are created by nonabelian bi-subalgebras. It is of interest that there exists a partition duality between the two…
A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…
We examine the enumeration of certain Motzkin objects according to the numbers of crossings and nestings. With respect to continued fractions, we compute and express the distributions of the statistics of the numbers of crossings and…
Matchings are frequently used to model RNA secondary structures; however, not all matchings can be realized as RNA motifs. One class of matchings, called the L $\&$ P matchings, is the most restrictive model for RNA secondary structures in…
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…
Classification of noncommutative quadric hypersurfaces is one of the major projects in noncommutative algebraic geometry. In recent years, we are dedicated to complete the classification of noncommutative central conics. To achieve this…
We apply the loop module construction of arXiv:1504.05114 in the context of Lie colour algebras. We construct a bijection between the equivalence classes of all finite-dimensional graded irreducible Lie colour algebra representations from…
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a x b x c. In this note, this result is proved by constructing…
We present a simple a bijection between permutations of $\{1,..., n\}$ with $k$ descents and permutation tableaux of length $n$ with $k$ columns.
We prove that if $X$ and $Y$ are first countable compact Hausdorff spaces, then the set of all diameter-preserving linear bijections from $C(X)$ to $C(Y)$ is algebraically reflexive.
We prove generalized versions of some conjectures of Joel Lewis on the number of alternating permutations avoiding certain patterns. Our main tool is the perhaps surprising observation that a classic bijection on pattern avoiding…
To a big n-tilting object in a complete, cocomplete abelian category A with an injective cogenerator we assign a big n-cotilting object in a complete, cocomplete abelian category B with a projective generator, and vice versa. Then we…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…