Related papers: An enriched degree of the Wronski
We present a project of classification of a certain class of bihamiltonian 1+1 PDEs depending on a small parameter. Our aim is to embed the theory of Gromov - Witten invariants of all genera into the theory of integrable systems. The…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…
We propose an intersection-theoretic method to reduce questions in genus zero logarithmic Gromov-Witten theory to questions in the Gromov-Witten theory of smooth pairs, in the presence of positivity. The method is applied to the enumerative…
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…
A finite, normal cover $f: X\longrightarrow \bbP^2$ of degree $m\geq 3$ (the case $m=2$ is well known and we do not consider it in this paper) is called \emph{simple}, if there is a pencil $\mathcal P$ of rational curves of $\bbP^2$ such…
Grothendieck has proved that each class in the de Rham cohomology of a smooth complex affine variety can be represented by a differential form with polynomial coefficients. After having proved a single exponential bound for the degrees of…
We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…
The study of the mapping class group of the plane minus a Cantor set uses a graph of loops, which is an analogous of the curve graph in the study of mapping class groups of compact surfaces. The Gromov boundary of this loop graph can be…
Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
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…
A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…
$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\IntRange}[1]{[ #1 ]}…
In this article, we show some uniqueness theorems for meromorphic mappings of $\C^n$ into the complex projective space $\pnc$ sharing different families of moving hyperplanes regardless of multiplicites, where all intersecting points…
We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and…
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
This paper deals with holomorphic self-maps of the complex projective plane and the algebraic relations among the eigenvalues of the derivatives at the fixed points. These eigenvalues are constrained by certain index theorems such as the…
We prove a simultaneous generalization of the classical Riemann-Hurwitz and Plucker formulas, addressing the total inflection of a morphism from a (smooth, projective) curve to an arbitrary (smooth, projective) higher-dimensional variety.…