Related papers: Machine Checked Proofs and Programs in Algebraic C…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…
We give arithmetical proofs of the strong normalization of two symmetric $\lambda$-calculi corresponding to classical logic. The first one is the $\bar{\lambda}\mu\tilde{\mu}$-calculus introduced by Curien & Herbelin. It is derived via the…
This paper proves a combinatorial rule expressing the product $s_\tau(s_{\lambda/\mu} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur…
q-Supernomial coefficients are generalizations of the q-binomial coefficients. They can be defined as the coefficients of the Hall-Littlewood symmetric function in a product of the complete symmetric functions or the elementary symmetric…
We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…
By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert…
We provide several ingredients towards a generalization of the Littlewood-Richardson rule from Chow groups to algebraic cobordism. In particular, we prove a simple product-formula for multiplying classes of smooth Schubert varieties with…
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 is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…
I characterize the combinatorially complete pargoids (partial applicative systems) by expandability with two constants that satisfy the well-known identities. An example shows that this class contains more than just the reducts of partial…
In this note we define a generalization of Hall-Littlewood symmetric functions using formal group law and give an elementary proof of the generating function formula for the generalized Hall-Littlewood symmetric functions. We also give some…
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…
The classical Littlewood-Richardson coefficients C(lambda,mu,nu) carry a natural $S_3$ symmetry via permutation of the indices. Our "carton rule" for computing these numbers transparently and uniformly explains these six symmetries;…
Richard Stanley played a crucial role, through his work and his students, in the development of the relatively new area known as combinatorial representation theory. In the early stages, he has the merit to have pointed out to…
Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the…
Creation operators act on symmetric functions to build Schur functions, Hall--Littlewood polynomials, and related symmetric functions one row at a time. Haglund, Morse, Zabrocki, and others have studied more general symmetric functions…
In semantics and in programming practice, algebraic concepts such as monads or, essentially equivalently, (large) Lawvere theories are a well-established tool for modelling generic side-effects. An important issue in this context are…