Related papers: Permutation sign under the Robinson-Schensted-Knut…

The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

This note is devoted to a combinatorial proof of a Schmidt type theorem due to Andrews and Paule. A four-variable refinement of Andrews and Paule's theorem is also obtained based on this combinatorial construction.

We give a new formula for the Littlewood--Richardson coefficients in terms of peelable tableaux compatible with shuffle tableaux, in the same fashion as Remmel--Whitney rule. This gives an efficient way to compute generalized…

Let $\lambda (n)$ denote the Liouville function. Complementary to the prime number theorem, Chowla conjectured that \vspace{1mm} \noindent {\bf Conjecture (Chowla).} {\em \begin{equation} \label{a.1} \sum_{n\le x} \lambda (f(n)) =o(x)…

We give a simple explanaition of classical boson-fermion correspondence.

In [F. Caselli, Involutory reflection groups and their models, J. Algebra 24 (2010), 370--393] there is constructed a uniform Gelfand model for all non-exceptional irreducible complex reflection groups which are involutory. Such model can…

The change of signature of a metric is explained using simple examples and methods. The Klein-Gordon field on a signature-changing background is discussed, and it is shown how the approach of Dray et al.\ can be corrected to ensure that the…

A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…

Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.

We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

We introduce diagrams and essential sets for signed permutations, extending the analogous notions for ordinary permutations. In particular, we show that the essential set provides a minimal list of rank conditions defining the Schubert…

We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are…

Stanley associated with a graph G a symmetric function X_G which reduces to G's chromatic polynomial under a certain specialization of variables. He then proved various theorems generalizing results about the chromatic polynomial, as well…

Invariance-based randomization tests -- such as permutation tests, rotation tests, or sign changes -- are an important and widely used class of statistical methods. They allow drawing inferences under weak assumptions on the data…

Andrews recently introduced k-marked Durfee symbols which are connected to moments of Dyson's rank. By these connections, Andrews deduced their generating functions and some combinatorial properties and left their purely combinatorial…

In this paper, we start by giving the definitions and basic facts about hyperoctahedral number system. There is a natural correspondence between the integers expressed in the latter and the elements of the hyperoctahedral group when we use…

We prove that the polynomial invariants of a permutation group are Cohen-Macaulay for any choice of coefficient field if and only if the group is generated by transpositions, double transpositions, and 3-cycles. This unites and generalizes…

In this article, we give a polynomial algorithm to decide whether a given permutation $\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack…