Related papers: Topological enumeration of complex polynomial vect…
This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three…
We extend the classification of complete polynomial vector fields on C^2 given by Marco Brunella (Topology 43(2): 433-445, 2004) to cover the case of holomorphic (non-polynomial) vector fields whose underlying foliation is however still…
Floor diagrams are a class of weighted oriented graphs introduced by E. Brugalle and the second author. Tropical geometry arguments lead to combinatorial descriptions of (ordinary and relative) Gromov-Witten invariants of projective spaces…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$--derivations. First, we give a dynamical interpretation of $\mathcal{D}(\mathcal{A})$ as the set of polynomial vector fields which…
We give a description of the tropical variety of univariate polynomials of degree n having two double roots. As a set, it is given as the union of three types of maximal cones of dimension n-1, where only cones of two of these types are…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…
We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and delta nodes is given by a polynomial in d, provided delta is fixed and d…
We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a…
It is known that the combinatorial classes in the cohomology of the mapping class group of punctures surfaces defined by Witten and Kontsevich are polynomials in the adjusted Miller-Morita-Mumford classes. The leading coefficient was…
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We introduce combinatorial multivector fields, associate with them multivalued dynamics and study their topological features. Our combinatorial multivector fields generalize combinatorial vector fields of Forman. We define isolated…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
We discuss the notions of indices of vector fields and 1-forms and their generalizations to singular varieties and varieties with actions of finite groups, as well as indices of collections of vector fields and 1-forms.
We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…