Related papers: Enumerating Combinatorial Classes of the Complex P…
Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…
We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…
Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent $s<d$ such that any set $E\subset \mathbb{F}_q^d$ with $|E|\gtrsim q^s$ determines $\gtrsim q^{\binom{k+1}{2}}$ congruence classes of $(k+1)$-point configurations for $k\leq…
We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…
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 show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…
We prove that a logarithmic foliation corresponding to a generic line arrangement of $d+1 \geq 3$ lines in the complex plane, with pairwise natural and co-prime residues, is a smooth point of the center set of plane foliations (vector…
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…
In this work, under a mild assumption, we give the classification of the complete polynomial vector fields in two variables up to algebraic automorphisms of $\C^2$. The general problem is also reduced to the study of the combinatorics of…
The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…
We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…
We introduce a new functor category: the category $\mathcal{P}_{d,n}$ of strict polynomial functors with bounded by $n$ domain of degree $d$ over a field of characteristic $p>0$. It is equivalent to the category of finite dimensional…
We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…
We compute the periods associated with a special class of hyperplane arrangements. In particular, we exhibit a combinatorial condition on the intersection lattice of a hyperplane arrangement that ensures that its associated periods are…
We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…
For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…
In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines…
In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class ($R$-mec), a special kind of multidimensional asymptotic class ($R$-mac) with measuring…