We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, Pólya theory, combinatorial species, and asymptotics. We describe the capabilities that the packages offer as well as some of the algorithms used, and provide links to or...

This thesis deals with enumerative combinatorics applied to three different objects related to partition shapes, namely tableaux, restricted words, and Bruhat intervals. The main scientific contributions are the following. Paper I: Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Sta...

BACKGROUND There is a growing body of literature describing the properties of marketed drugs, the concept of drug-likeness and the vastness of chemical space. In that context, enumerative combinatorics with simple atomic components may be useful in the conception and design of structurally novel compounds for expanding and enhancing high-throughput screening (HTS) libraries. RESULTS A random ...

For any collection of Schubert conditions on lines in projective space which generically determine a finite number of lines, we show there exist real generic conditions determining the expected number of real lines. This extends the classical Schubert calculus of enumerative geometry for the Grassmann variety of lines in projective space from the complex realm to the real. Our main tool is an e...

My main area of research is combinatorics. I like not only its beauty as a subject but also its wide applicability throughout mathematics and science. I have diverse mathematical interests, and combinatorics is the bridge that connects them. Even though I have a predilection for enumerative questions, I have also worked on algebraic combinatorics, computational biology, number theory, and combi...

We obtain inductive and enumerative formulas for the multiplicities of weights spin module Clifford algebra a Levi subalgebra in complex semisimple Lie algebra. Our involve only matrices tableaux, our techniques combine linear algebra, theory, combinatorics. Moreover, this suggests relationship with nilpotent orbits. The case special $\mathfrak{sl}(n,{\mathbb C})$ is emphasized.

Young tableaux are ubiquitous combinatorial objects making important and inspiring appearances in representation theory, geometry and algebra. They naturally arise in the study of symmetric functions, representation theory of the symmetric and complex general linear groups, and Schubert calculus of Grassmannians. Discovering and interpreting enumerative formulas for Young tableaux (and their ge...

Sequences of Nilsson type appear in abundance in Algebraic Geometry, Enumerative Combinatorics, Mathematical Physics and Quantum Topology. We give an elementary introduction on this subject, including the definition of sequences of Nilsson type and the uniqueness, existence, and effective computation of their asymptotic expansion.

Two notions, generic morphisms and parametric representations, useful for the analysis of endofunctors arising in enumerative combinatorics, higher dimensional category theory, and logic, are defined and examined. Applications to the Batanin approach to higher category theory, Joyal species and operads are provided.

Physicists working in two-dimensional quantum gravity invented a new method of map enumeration based on computation of Gaussian integrals over the space of Hermitian matrices. This paper explains the basic facts of the method and provides an accessible introduction to the subject. Keywords-Maps, Imbedded graphs, Enumerative combinatorics, Matrix integrals, Quantum field theory, String theory.