Related papers: Maximal cross-ratio degree for 8 points in $\mathb…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
We determine the maximum number of $\mathbb{F}_q$-rational points that a nonsingular threefold of degree $d$ in a projective space of dimension $4$ defined over $\mathbb{F}_q$ may contain. This settles a conjecture by Homma and Kim…
We prove that, for every set of $n$ points $\mathcal{P}$ in $\mathbb{R}^2$, a random plane graph drawn on $\mathcal{P}$ is expected to contain less than $n/10.18$ isolated vertices. In the other direction, we construct a point set where the…
We prove that every set of n points in the plane has at most $(16+5/6)^n$ rectangulations. This improves upon a long-standing bound of Ackerman. Our proof is based on the cross-graph charging-scheme technique.
The resolutions and maximal sets of compatible resolutions of all 2-(120,8,1) designs arising frommaximal (120,8)-arcs in the known projective planes of order 16 are computed. It is shown that each of these designs is embeddable in a unique…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations…
We calculate the outerplanar crossing numbers of complete multipartite graphs which have $n$ partite sets with $m$ vertices and one partite set with $p$ vertices, where either $p|mn$ or $mn|p$.
Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…
We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the…
We study the degree of an $L$-Lipschitz map between Riemannian manifolds, proving new upper bounds and constructing new examples. For instance, if $X_k$ is the connected sum of $k$ copies of $\mathbb CP^2$ for $k \ge 4$, then we prove that…
Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS)…
A formula expressing a point of order 8 on an elliptic curve, in terms of the roots of the associated cubic polynomial, is given. Doubling such a point yields a point of order 4 distinct from the well-known points of order 4 given in…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
The $k$-independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$. In this paper, for each positive integer $k$, we prove sharp upper bounds for the $k$-independence number in an…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…
We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…