Related papers: Intersection multiplicity, Milnor number and Berns…
Let M and N be two closed (not necessarily orientable) surfaces, and f a continuous map from M to N. By definition, the minimal multiplicity MMR[f] of the map f denotes the minimal integer k having the following property: f can be deformed…
While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…
In [EH89, Theorem 1] Ekeland-Hofer prove that for a centrally symmetric, restricted contact type hypersurface in R^{2n} and for any global, centrally symmetric Hamiltonian perturbation there exists a leaf-wise intersection point. In this…
We review some relations occurring between the combinatorial intersection theory on the moduli spaces of stable curves and the asymptotic behavior of the 't Hooft-Kontsevich matrix integrals. In particular, we give an alternative proof of…
We study tropical degree bounds, stable tropical intersections, and tropical B\'ezout-type estimates through the geometry of Newton polytopes, mixed subdivisions, and lattice indices. We establish an upper bound for the tropical degree of a…
In this paper, we consider a problem of counting multiplicities. We fix a counting function of multiplicity of rational points in a hypersurface of a projective space over a finite field, and we give an upper bound for the sum with respect…
We prove that certain roots of the Bernstein-Sato polynomial (i.e. b-function) are jumping coefficients up to a sign, showing a partial converse of a theorem of L. Ein, R. Lazarsfeld, K.E. Smith, and D. Varolin. We also prove that certain…
Minimum numbers measure the obstruction to removing coincidences of two given maps (between smooth manifolds M and N of dimensions m and n, resp.). In this paper we compare them to four distinct types of Nielsen numbers. These agree with…
In this paper we prove a residue formula for intersection pairings of reduced spaces of certain quasi-Hamiltonian G-spaces, by constructing the corresponding Hamiltonian G-space. Our argument closely follows the methods of a 1998 paper of…
Let $\Bbbk$ be a field of characteristic $p>0$, $V$ a finite-dimensional $\Bbbk$-vector-space, and $G$ a finite $p$-group acting $\Bbbk$-linearly on $V$. Let $S = \Sym V^*$. We show that $S^G$ is a polynomial ring if and only if the…
In this article, we offer group-theoretic, field-theoretic, and topological interpretations of the Gaussian binomial coefficients and their sum. For a finite $p$-group $G$ of rank $n$, we show that the Gaussian binomial coefficient…
Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…
We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
We formulate the generalized Sarnak's M\"obius disjointness conjecture for an arbitrary number field $K$, and prove a quantitative disjointness result between polynomial nilsequences $(\Phi(g(n)\Gamma))_{n\in\mathbb{Z}^{D}}$ and aperiodic…
Differently from the Milnor number, no formula relating the Tjurina number of a reducible algebroid curve to invariants of its branches was known. The aim of this work is to provide such a formula for a complete intersection algebroid curve…