Related papers: Tower Diagrams and Pieri's Rule

We give an explanation for the Pieri coefficients for the stable and dual stable Grothendieck polynomials; their non-leading terms are obtained by taking an alternating sum of meets (or joins) of their leading terms.

We use a method of translation to recover Borweins' quadratic and quartic iterations. Then, by using the WZ-method, we obtain some initial values which lead to the limit $1/\pi$. We will not use the modular theory nor either the Gauss'…

An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including Stirling's formula and a logarithmic version of the…

In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.

We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…

In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.

In this paper, we consider Hermite and poly-Bernoulli mixed-type polynomials and investigate the properties of those polynomials which are derived from umbral calculus. Finally, we give various identities associated with Stirling numbers,…

We give the explicit analytic development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments…

In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…

A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

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.

Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by A.E. Pellet [Bulletin des Sciences Math\'ematiques, (2), vol 5 (1881), pp.393-395], some results of D.A.…

Motivated by a recent conjecture of R. P. Stanley we offer a lower bound for the sum of the coefficients of a Schubert polynomial in terms of $132$-pattern containment.

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

A one-parameter generalisation R_{\lambda}(X;b) of the symmetric Macdonald polynomials and interpolations Macdonald polynomials is studied from the point of view of branching rules. We establish a Pieri formula, evaluation symmetry,…

In this article we will introduce the way to extend the mitosis algorithm for Schubert polynomials, developed by Ezra Miller, to the case of Grothendieck polynomials.