Related papers: Topological enumeration of complex polynomial vect…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms…
We show how to solve computationally a combinatorial problem about the possible number of roots orthogonal to a vector of given length in $E_8$. We show that the moduli space of K3 surfaces with polarisation of degree 2d is also of general…
This article introduces a finite piecewise Euclidean cell complex homeomorphic to the space of monic centered complex polynomials of degree $d$ whose critical values lie in a fixed closed rectangular region. We call this the branched…
A brief proof of Lie's classification of finite dimensional subalgebras of vector fields on the complex plane that have a proper Levi decomposition is given. The proof uses basic representation theory of sl(2, C). This, combined with…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
We generalize and extend the Conley-Morse-Forman theory for combinatorial multivector fields introduced in \cite{Mr2017}. The generalization consists in dropping the restrictive assumption in \cite{Mr2017} that every multivector has a…
The algebra B of bicomplex numbers is viewed as a complexification of the Archimedean f-algebra of hyperbolic numbers D. This lattice-theoretic approach allows us to establish new properties of the so-called D-norms. In particular, we show…
We classify, up to a natural equivalence relation, vector fields of the plane which belong to the kernel of a 1--form. This form can be closed, in which case the vector fields are integrable, or not, in which case the differential of the…
We present a computational method for reconstructing a vector field on a convex polytope $\mathcal{P} \subset \mathbb{R}^d$ of arbitrary dimension from discrete samples. We specifically address the scenario where the vector field is subject…
This paper introduces and investigates some properties of algebras constructed from the algebra of polynomials via derivation and integration operators using a process presented by Dzhumadildaev in a previous work. In particular, we…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…
We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…