Inhomogeneous lattice paths, generalized Kostka polynomials and An−1_{n-1} supernomials

Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works and by Kashiwara's theory of crystal bases we define a statistic on paths yielding two novel classes of polynomials. One of these provides a generalization of the Kostka polynomials while the other, which we name the A$_{n-1}$ supernomial, is a $q$-deformation of the expansion coefficients of products of Schur polynomials. Many well-known results for Kostka polynomials are extended leading to representations of our polynomials in terms of a charge statistic on Littlewood-Richardson tableaux and in terms of fermionic configuration sums. Several identities for the generalized Kostka polynomials and the A$_{n-1}$ supernomials are proven or conjectured. Finally, a connection between the supernomials and Bailey's lemma is made.Comment: 44 pages, figures, AMS-latex; improved version to appear in Commun. Math. Phys., references added, some statements clarified, relation to other work specifie

Young tableaux with applications to representation theory and flag manifolds

We outline the use of Young tableaux to describe geometric and algebraic objects using combinatorial methods. In particular, we discuss applications to representations of the symmetric group and the general linear group, flag varieties, and Schubert varieties. We also describe some recent work, including proofs of the Saturation Conjecture and a theorem on the eigenvalues of sums of Hermitian matrices

Many-valued logics. A mathematical and computational introduction.

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics