Related papers: Topological enumeration of complex polynomial vect…

We prove that the closure (for the Zariski topology) of the set of polynomial automorphisms of the complex affine plane whose polydegree is (cd-1,b,a) contains all triangular automorphisms of degree cd+a, where a,b >1 and c>0 are integers…

Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…

We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…

In the late 80s, V.~Arnold and V.~Vassiliev initiated the topological study of the space of real univariate polynomials of a given degree which have no real roots of multiplicity exceeding a given positive integer. Expanding their studies,…

In this paper we present a combinatorial proof of the Kronecker--Weber Theorem for global fields of positive characteristic. The main tools are the use of Witt vectors and their arithmetic developed by H. L. Schmid. The key result is to…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…

This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…

For a positive integer sequence $\boldsymbol{a}=(a_1, \dots, a_{N+1})$, Sylvester's denumerant $E(\boldsymbol{a}; t)$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N+1} a_i x_i = t$ for a nonnegative integer $t$. It has…

We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…

This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We enumerate complex curves on toric surfaces of any given degree and genus, having a single cusp and nodes as their singularities, and matching appropriately many point constraints. The solution is obtained via tropical enumerative…

We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…

In this work we revisit and extend the method introduced by Lins Neto, Sad and Sc\'{a}rdua for detecting the non-existence of invariant algebraic curves other than some prescribed invariant nodal curve. We prove that, under the existence of…

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

In the late 80s, V.~Arnold and V.~Vassiliev initiated the topological study of the space of real univariate polynomials of a given degree d and with no real roots of multiplicity exceeding a given positive integer. Expanding their studies,…