Related papers: The Littlewood-Richardson rule, and related combin…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…
This work presents a newly renovated approach to the analysis of second-order Riccati equations from the point of view of the theory of Lie systems. We show that these equations can be mapped into Lie systems through certain Legendre…
Recently Watanabe has given an algorithm to compute a bijection, that he calls (quantum) Littlewood-Richardson (LR) map (or quantum LR rule of type AII), between semi-standard Young tableaux of shape a partition with at most $2n$ parts and…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
A fundamental problem in the representation theory of the symmetric group, Sn, is to describe the coefficients in the decomposition of a tensor product of two simple representations. These coefficients are known in the literature as the…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…
The O(a^2) contributions to the chiral effective Lagrangian for lattice QCD with Wilson fermions are constructed. The results are generalized to partially quenched QCD with Wilson fermions as well as to the "mixed'' lattice theory with…
This note discusses Routh reduction for hybrid time-dependent mechanical systems. We give general conditions on whether it is possible to reduce by symmetries a hybrid time-dependent Lagrangian system extending and unifying previous results…
We develop foundations for computing Craig interpolants and similar intermediates of two given formulas with first-order theorem provers that construct clausal tableaux. Provers that can be understood in this way include efficient…
In this paper a list of $R$-matrices on a certain coupled Lie algebra is obtained. With one of these $R$-matrices, we construct infinitely many bi-Hamiltonian structures for each of the two-component BKP and the Toda lattice hierarchies. We…
Chiral perturbation theory gives direct and unambiguous predictions for the form of various two-point hadronic correlators at low momentum in terms of a finite set of couplings in a chiral Lagrangian. In this paper we study the feasibility…
A new combinatorial approach to the ribbon tableaux generating functions and q-Littlewood Richardson coefficients of Lascoux, Leclerc and Thibon is suggested. We define operators which add ribbons to partitions and following Fomin and…
We give counterexamples to Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients.
We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{\lambda\mu}^{\nu}(q,t)$. Namely, we consider the case that the Kostka number $K_{\mu, \nu -\lambda}$ is $1$. This settles a particular…
This chapter concerns edge labeled Young tableaux, introduced by H. Thomas and the third author. It is used to model equivariant Schubert calculus of Grassmannians. We survey results, problems, conjectures, together with their influences…
We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient c({\lambda},{\mu},{\nu}) for given partitions {\lambda}, {\mu}, and {\nu}. This graph was first…
We study two different one-parameter generalizations of Littlewood--Richardson coefficients, namely Hall polynomials and generalized inverse Kostka polynomials, and derive new combinatorial formulae for them. Our combinatorial expressions…
Suppose \mu and \mu' are two partitions. We will let \mu \oplus \mu' denote the "direct sum" of the partitions, defined as the sorted partition made of the parts of $\mu$ and $\mu'$. In this paper, we define a summation operation on two…
We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fourth operation, hopscotch, is new, although specialised…