Related papers: Signed Alternating-runs enumeration in Classical W…
We prove refined enumeration results on several symmetry classes as well as related classes of alternating sign matrices with respect to classical boundary statistics, using the six-vertex model of statistical physics. More precisely, we…
Let $E_n^r=\{[\tau]_a=(\tau_1^{(a_1)},...,\tau_n^{(a_n)})| \tau\in S_n,\ 1\leq a_i\leq r\}$ be the set of all signed permutations on the symbols 1,2,...,n with signs 1,2,...,r. We prove, for every 2-letter signed pattern $[\tau]_a$, that…
The generating polynomial of permutations of size $n$, counted by the number of alternating runs, has a root at $-1$ of multiplicity $\lfloor (n-2)/2 \rfloor$ for all $n \ge 2$. This result can be derived by combining the David--Barton…
An alternating sign matrix is a square matrix with entries 1, 0 and -1 such that the sum of the entries in each row and each column is equal to 1 and the nonzero entries alternate in sign along each row and each column. To some of the…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both…
Motivated by a recent conjecture of Zabrocki, Wallach described the alternants in the super-coinvariant algebra of the symmetric group in one set of commuting and one set of anti-commuting variables under the diagonal action. We give a…
This paper highlights three known identities, each of which involves sums over alternating sign matrices. While proofs of all three are known, the only known derivations are as corollaries of difficult results. The simplicity and natural…
Fischer provided a new type of binomial determinant for the number of alternating sign matrices involving the third root of unity. In this paper we prove that her formula, when replacing the third root of unity by an indeterminate $q$, is…
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
For W a finite Coxeter group, a formula is found for the size of W equivalence classes of subsets of a base. The proof is a case-by-case analysis using results and tables of Carter and Orlik/Solomon. As a corollary we obtain an alternating…
Mills, Robbins, and Rumsey conjectured, and Zeilberger proved, that the number of alternating sign matrices of order $n$ equals $A(n):={{1!4!7! ... (3n-2)!} \over {n!(n+1)! ... (2n-1)!}}$. Mills, Robbins, and Rumsey also made the stronger…
Alternating sign triangles were introduced by Carroll and Speyer in relation to cube recurrence, by analogy to alternating sign matrices for octahedron recurrence. Permutation triangles are the alternating sign triangles whose entries are…
In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…
It is known that summations over Weyl groups of Lie algebras is a problem which enters in many areas of physics as well as in mathematics. For this, a method which we would like to call {\bf permutation weights} has been previously proposed…
An explicit expression for the numbers $A(n,r;3)$ describing the refined 3-enumeration of alternating sign matrices is given. The derivation is based on the recent results of Stroganov for the corresponding generating function. As a result,…
We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…
A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer $k \geq 1.$ In this paper, we find the sign-balance for mod-k-alternating permutations with respect to…