Related papers: Triangulations and Maximal Cross-Ratio Degrees
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
We approximately compute the correspondence degree (as defined by Lazarsfeld and Martin) between two unbalanced complete intersections. This is accomplished by showing that the procedure of taking a subvariety of a product $Y \times Y'$ and…
The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…
A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
We study tropical Tevelev degrees arising from maps between certain tropical moduli spaces of curves. Building on work of Dawson and Cavalieri, who defined and computed tropical Tevelev degrees in the case of degree $d = g+1$ and $n = g+3$…
This paper is devoted to the bounding and computation of the dimension of deformation spaces of tropical curves and hypersurfaces. This characteristic is interesting in light of the fact that it often coincides with the dimension of…
Tropicalization is a procedure that takes subvarieties of an algebraic torus to balanced weighted rational complexes in space. In this paper, we study the tropicalizations of curves in surfaces in 3-space. These are balanced rational…
We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in $\mathbb{R}^2$. A set of triangles is a \emph{separator} of one color from the other if every point of that…
Drawing graphs with the minimum number of crossings is a classical problem that has been studied extensively. Many restricted versions of the problem have been considered. For example, bipartite graphs can be drawn such that the two sets in…
We study tropical commuting matrices from two viewpoints: linear algebra and algebraic geometry. In classical linear algebra, there exist various criteria to test whether two square matrices commute. We ask for similar criteria in the realm…
We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{P}^3$, whose image lies in a $\mathbb{P}^2$, passing through $r$ lines and $s$ points, where $r + 2s = 3d+2$. This can be viewed as a family version of…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this…
This paper proposes a new equation from continuous adjoint theory to compute the gradient of quantities governed by the Transport Theory of light. Unlike discrete gradients ala autograd, which work at the code level, we first formulate the…
Recent cognitive experiments have shown that the negative impact of an edge crossing on the human understanding of a graph drawing, tends to be eliminated in the case where the crossing angles are greater than 70 degrees. This motivated the…
The study of intersection problems in Extremal Combinatorics dates back perhaps to 1938, when Paul Erd\H{o}s, Chao Ko and Richard Rado proved the (first) `Erd\H{o}s-Ko-Rado theorem' on the maximum possible size of an intersecting family of…
Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured…