Related papers: Topological enumeration of complex polynomial vect…
We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work.…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We compute the local cohomology of vector fields on a manifold. In the smooth case this recovers the diagonal cohomology studied in work of Losik, Guillemin, Fuks and others. In the holomorphic case this cohomology has recently appeared in…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
This is a gentle introduction to a general theory of universal polynomials associated to classification of map-germs, called Thom polynomials. The theory was originated by Ren\'e Thom in the 1950s and has since been evolved in various…
Given an infinite field $\mathbb{k}$ and a simplicial complex $\Delta$, a common theme in studying the $f$- and $h$-vectors of $\Delta$ has been the consideration of the Hilbert series of the Stanley--Reisner ring $\mathbb{k}[\Delta]$…
A new cohomology, induced by a vector field, is defined on pairs of differential forms ($1$--differentiable forms) in a manifold. It is proved a link with the classical de Rham cohomology and an $1$-differentable cohomology of Lichnerowicz…
In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…
We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
There is a Rota-Baxter algebra structure on the field $A=\mathbf{k}((t))$ with $ P$ being the projection map $A=\mathbf{k}[[t]]\oplus t^{-1}\mathbf{k}[t^{-1}]$ onto $ \mathbf{k}[[ t]]$. We study the representation theory and…
For generic binary forms $A_1,...,A_r$ of order $d$ we construct a class of combinants $C = \{\C_q: 0 \le q \le r, q \neq 1\}$, to be called the Wronskian combinants of the $A_i$. We show that the collection $C$ gives a projective imbedding…
J.~Lepowsky and R.~L.~Wilson initiated the approach to combinatorial Rogers-Ramanujan type identities via vertex operator constructions of standard (i.e. integrable highest weight) representations of affine Kac-Moody Lie algebras.…
Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
Topological abstractions offer a method to summarize the behavior of vector fields but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach,…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…