Related papers: Real Zeuthen numbers for two lines
As a variant of the famous Tur\'an problem, we study $\mathrm{rex}(n,F)$, the maximum number of edges that an $n$-vertex regular graph can have without containing a copy of $F$. We determine $\mathrm{rex}(n,K_{r+1})$ for all pairs of…
In this article, we study the tropical counterpart of the enumeration of rational curves in $\mathbb{CP}^2$ with first order tangency. We use the tropical analogue of the WDVV technique to compute rational tropical plane curves of degree…
In this paper, we consider the following question: how many degree $d$ curves are there in $\mathbb{P}^3$ (passing through the right number of generic lines and points), whose image lies inside a $\mathbb{P}^2$, having $\delta$ nodes and…
Below we consider the evolutes of plane real-algebraic curves and discuss some of their complex and real-algebraic properties. In particular, for a given degree $d\ge 2$, we provide lower bounds for the following four numerical invariants:…
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…
Consider lattice paths in Z^2 taking unit steps north (N) and east (E). Fix positive integers r,s and put an equivalence relation on points of Z^2 by letting v,w be equivalent if v - w = m (r,s) for some m in Z. Call a lattice path valid if…
We study real bitangents of real algebraic plane curves from two perspectives. We first show that there exists a signed count of such bitangents that only depends on the real topological type of the curve. From this follows that a generic…
Kontsevich's formula for rational plane curves is a recursive relation for the number $N_d$ of degree $d$ rational curves in $\mathbb{P}^2$ passing through $3d-1$ general points. We provide two proofs of this recursion: the first more…
This paper presents a methodology for finding numerically, by means of curve-following, all real solutions of a general system of $n$ nonlinear equations in $n$ unknowns, within a given $n$-dimensional box. The main idea behind our method…
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…
We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…
Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…
Welschinger invariants enumerate real nodal rational curves in the plane or in another real rational surface. We analyze the existence of similar enumerative invariants that count real rational plane curves having prescribed non-nodal…
Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum…
We give another solution to the class number one problem by showing that imaginary quadratic fields $\Q(\sqrt{-d})$ with class number $h(-d)=1$ correspond to integral points on a genus two curve $\mscrK_3$. In fact one can find all rational…
This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…
In this paper we study existence and uniqueness of rational normal curves in $\PP^n$ passing through $p$ points and intersecting $l$ codimension two linear spaces in $n-1$ points each. If $p+l=n+3$ and the points and the linear spaces are…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
We extend known results regarding the maximum rectilinear crossing number of the cycle graph (C_n) and the complete graph (K_n) to the class of general d-regular graphs R_{n,d}. We present the generalized star drawings of the d-regular…
In this article we will show that for every natural $d$ and $n>1$ there exists a natural number $t$ such that for every $d$-dimensional simplicial complex $\mathcal{T}$ with vertices in $\mathbb{Z}^d$, the number of lattice points in the…