Related papers: Combinatorial Identities for Vacillating Tableaux
We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…
The sequence of so-called signature moments describes the laws of many stochastic processes in analogy with how the sequence of moments describes the laws of vector-valued random variables. However, even for vector-valued random variables,…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
In this paper, we investigate statistics on alternating words under correspondence between ``possible reflection paths within several layers of glass'' and ``alternating words''. For $v=(v_1,v_2,\cdots,v_n)\in\mathbb{Z}^{n}$, we say $P$ is…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
The Laver tables are finite combinatorial objects with a simple elementary definition, which were introduced by R. Laver from considerations of logic and set theory. Although these objects exhibit some fascinating properties, they seem to…
An independent coalition in a graph $G$ consists of two disjoint sets of vertices $V_1$ and $V_2$ neither of which is an independent dominating set but whose union $V_1 \cup V_2$ is an independent dominating set. An independent coalition…
Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent…
We consider a billiard model of a self-bound, interacting three-body system in two spatial dimensions. Numerical studies show that the classical dynamics is chaotic. The corresponding quantum system displays spectral fluctuations that…
In this thesis, I go through the well-known solutions to the one and two-particle systems trapped in a quantum harmonic oscillator and then continue to the three, four and many-body quantum systems. This is done by developing new analytical…
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
Oscillations are a powerful tool for building examples of colorings witnessing negative partition relations. We survey several results illustrating the general technique and present a number of applications.
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…
We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…