Related papers: Machine Checked Proofs and Programs in Algebraic C…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
Modern advances in general-purpose computer algebra systems offer solutions to a variety of problems, which in the past required substantial time investments by trained mathematicians. An excellent example of such development are the…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
We discuss several well known results about Schur functions that can be proved using cancellations in alternating summations; notably we shall discuss the Pieri and Murnaghan-Nakayama rules, the Jacobi-Trudi identity and its dual (Von…
We show that some of the main structural constants for symmetric functions (Littlewood-Richardson coefficients, Kronecker coefficients, plethysm coefficients, and the Kostka--Foulkes polynomials) share symmetries related to the operations…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
We explore an application of the Robinson-Schensted-Knuth (RSK) algorithm in the context of the quantum product of multi-symmetric functions. After reviewing the combinatorial foundations of quantum symmetric functions, we establish…
In the seminal work of Stanley, several conjectures were made on the structure of Littlewood-Richardson coefficients for the multiplication of Jack symmetric functions. Motivated by recent results of Alexandersson and the present author, we…
In the prequel to this paper, we showed how results of Mason involving a new combinatorial formula for polynomials that are now known as Demazure atoms (characters of quotients of Demazure modules, called standard bases by Lascoux and…
In this paper an algebraic proof of Christoph's theorem is provided. This theorem from algebraic-geometry is about the existence of a finite automaton for computing coefficient of a series for an algebraic function.
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
This paper presents novel algorithms which exploit the intrinsic algebraic and combinatorial structure of the matrix completion task for estimating missing en- tries in the general low rank setting. For positive data, we achieve results…
The ring of symmetric functions occupies a central place in algebraic combinatorics, with a particularly notable role in Schubert calculus, where the standard cell decompositions of Grassmannians yield the celebrated family of Schur…
We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic program. 2. A propositional characterization of stable models of…
We present a novel characterization of stable mergesort functions using relational parametricity, and show that it implies the functional correctness of mergesort. As a result, one can prove the correctness of several variations of…
We demonstrate the use of several tools from Algebraic Combinatorics such as Young tableaux, symmetry operators, the Littlewood-Richardson rule and discrete Fourier transforms of symmetric groups in investigations of algebraic curvature…
We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…