Related papers: Signed Alternating-runs enumeration in Classical W…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
In this work, we study the discrete observables $$E_k = \sum_{i,j=1}^n (i-j)^k A_{i,j}$$ associated with $n\times n$ alternating sign matrices $A = (A_{i,j})$. This work develops exact formulas for expectations using Bernoulli polynomials,…
We introduce a new family $\mathcal{A}_{n,k}$ of Schur positive symmetric functions, which are defined as sums over totally symmetric plane partitions. In the first part, we show that, for $k=1$, this family is equal to a multivariate…
The group of alternating colored permutations is the natural analogue of the classical alternating group, inside the wreath product $\mathbb{Z}_r \wr S_n$. We present a 'Coxeter-like' presentation for this group and compute the length…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…
Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find…
Let B be a reductive Lie subalgebra of a semi-simple Lie algebra of the same rank both over the complex numbers. To each finite dimensional irreducible representation $V_\lambda$ of F we assign a multiplet of irreducible representations of…
We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs) according to their first two rows instead of just the first row, and more general "d-refined" enumerations of ASMs according to the first…
When it is based on Kac-Peterson form of Affine Weyl Groups, Weyl-Kac character formula could be formulated in terms of Theta functions and a sum over finite Weyl groups. We, instead, give a reformulation in terms of Schur functions which…
In this paper we present grammatical interpretations of the alternating Eulerian polynomials of types A and B. As applications, we derive several properties of the type B alternating Eulerian polynomials, including combinatorial expansions,…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…
We use the author's combinatorial theory of full heaps (defined in math.QA/0605768) to categorify the action of a large class of Weyl groups on their root systems, and thus to give an elementary and uniform construction of a family of…
Zeilberger proved the Refined Alternating Sign Matrix Theorem, which gives a product formula, first conjectured by Mills, Robbins and Rumsey, for the number of alternating sign matrices with given top row. Stroganov proved an explicit…
The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group S_n has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w,…
We provide a generalization of the Littlewood identity, both sides of which are related to alternating sign matrices. The classical Littlewood identity establishes a nice product formula for the sum of all Schur polynomials. Compared to the…
We study three special Dirichlet series, two of them alternating, related to the Riemann zeta function. These series are shown to have extensions to the entire complex plane and we find their values at the negative integers (or residues at…
Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…
We define and enumerate two new two-parameter permutation families, namely, placements of a maximum number of non-attacking rooks on $k$ chained-together $n\times n$ chessboards, in either a circular or linear configuration. The linear case…
We define and study multivariate exponential functions, symmetric with respect to the alternating group A_n, which is a subgroup of the permutation (symmetric) group S_n. These functions are connected with multivariate exponential…