相关论文: A proof of Pieri's formula using the generalized S…

Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.

We present a new geometric proof of Pieri's formula, exhibiting an explicit chain of rational equivalences from a suitable sum of distinct Schubert varieties to the intersection of a Schubert variety with a special Schubert variety. The…

Given an rc-graph $R$ of permutation $w$ and an rc-graph $Y$ of permutation $v$, we provide an insertion algorithm, which defines an rc-graph $R\leftarrow Y$ in the case when $v$ is a shuffle with the descent at $r$ and $w$ has no descents…

In O'Connell-Pei(2013) a q-weighted version of the Robinson-Schensted algorithm was introduced. In this paper we show that this algorithm has a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted…

We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm that describes Monk's Rule. Our result is different from…

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…

The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…

We generalize a formula obtained independently by A. Reifegerste and J. Sj\"ostrand for the sign of a permutation under the classical Robinson-Schensted map to a family of domino Robinson-Schensted algorithms.

The aim of this paper is to give a corrected bijective proof of Vershik's relations for the Kostka numbers. Our proof uses insertion and reverse insertion algorithms, as in the combinatorial proof of the Pieri rule.

The Pieri rule is a nonnegative, multiplicity-free formula for the Schur function expansion of the product of an arbitrary Schur function with a single row Schur function. Key polynomials are characters of Demazure modules for the general…

Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…

Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…

In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…

We prove the Pieri formulas for Schur multiple zeta functions, which are generalizations of the Pieri formulas proved by Nakasuji and Takeda for hook type Schur multiple zeta functions. Moreover, we also prove the Littlewood-Richardson rule…

Graph encoder embedding, a recent technique for graph data, offers speed and scalability in producing vertex-level representations from binary graphs. In this paper, we extend the applicability of this method to a general graph model, which…

We prove Pieri formulas for the multiplication with special Schubert classes in the K-theory of all cominuscule Grassmannians. For Grassmannians of type A this gives a new proof of a formula of Lenart. Our formula is new for Lagrangian…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

By the Pieri rule, the tensor product of an exterior power and a finite-dimensional irreducible representation of a general linear group has a multiplicity-free decomposition. The embeddings of the constituents are called Pieri inclusions…

We explore properties of generalized Paley graphs and we extend a result of Lim and Praeger by providing a more precise description of the connected components of disconnected generalized Paley graphs. This result leads to a new…