Related papers: Topological enumeration of complex polynomial vect…
In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's…
We show in this work that homology in degree d of a congruence group, in a very general framework, defines a weakly polynomial functor of degree at most 2d and we describe this functor modulo polynomial functors of smaller degree. Our main…
Computing homology and cohomology is at the heart of many recent works and a key issue for topological data analysis. Among homological objects, homology generators are useful to locate or understand holes (especially for geometric…
Robin Forman's highly influential 2002 paper A User's Guide to Discrete Morse Theory presents an overview of the subject in a very readable manner. As a proof of concept, the author determines the topology (homotopy type) of the abstract…
We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…
We prove a subelliptic estimate for systems of complex vector fields under some assumptions that generalize the essential pseudoconcavity for $CR$ manifolds and H\"ormander's bracket condition for real vector fields. Applications are given…
One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one can enumerate all rigid positive semidefinite quadratic…
We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…
The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the…
Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…
We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…
We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the bivariate matching polynomial, the bivariate chromatic…
The combinatorial description via ribbon graphs of the moduli space of Riemann surfaces makes it possible to define combinatorial cycles in a natural way. Witten and Kontsevich first conjectured that these classes are polynomials in the…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…
In this paper we introduce geometric tools to study the families of rational vector fields of a given degree over $\mathbb C\mathbb P^1$. To a generic vector field of such a parametric family we associate several geometric objects: a…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…