Related papers: Permutation totally symmetric self-complementary p…
We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N,E) where N is a (so called) ``neutral'' alternating sign matrix (with one -1) and E is an integer. The bijection preserves the classical…
We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…
Permutation modules play an important role in the representation theory of the symmetric group. Hartmann and Paget defined permutation modules for non-degenerate Brauer algebras. We generalise their construction to a wider class of…
We construct a non-commutative, non-cocommutative, graded bialgebra $\mathbf{\Pi}$ with a basis indexed by the permutations in all finite symmetric groups. Unlike the formally similar Malvenuto-Poirier-Reutenauer Hopf algebra, this…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
We present novel equivalences in random matrix and tensor models between complex and self-adjoint theories with nontrivial quadratic terms in the action, established through an intermediate field representation. More precisely, we show that…
A \emph{set partition} of the set $[n]=\{1,...c,n\}$ is a collection of disjoint blocks $B_1,B_2,...c, B_d$ whose union is $[n]$. We choose the ordering of the blocks so that they satisfy $\min B_1<\min B_2<...b<\min B_d$. We represent such…
We define noncrossing partitions of a marked surface without punctures (interior marked points). We show that the natural partial order on noncrossing partitions is a graded lattice and describe its rank function topologically. Lower…
Employing the currently discussed notion of pseudo-Hermiticity, we define a pseudo-unitary group. Further, we develop a random matrix theory which is invariant under such a group and call this ensemble of pseudo-Hermitian random matrices as…
We present an equivariant bijection between two actions--promotion and rowmotion--on order ideals in certain posets. This bijection simultaneously generalizes a result of R. Stanley concerning promotion on the linear extensions of two…
We give another proof for the (-1)-enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley's proof for the ordinary…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
We discuss the conditions under which identical particles may yet be distinguishable and the relationship between particle permutation and exchange. We show that we can always define permutation-symmetric state vectors. When the particles…
This article gives a new matrix function named "twisted immanant," which can be regarded as an analogue of the immanant. This is defined for each self-conjugate partition through a "twisted" analogue of the irreducible character of the…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
It was shown by Kuperberg that the partition function of the square-ice model related to half-turn symmetric alternating-sign matrices of even order is the product of two similar factors. We propose a square-ice model whose states are in…
We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…
Reasonable requirements of (a) physical invariance under particle permutation and (b) physical completeness of state descriptions, enable us to deduce a Symmetric Permutation Rule(SPR): that by taking care with our state descriptions, it is…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…