Related papers: Largest zero-dimensional intersection of $r$ degre…

In a recent paper by Cook, et al., which introduced the concept of unexpected plane curves, the focus was on understanding the geometry of the curves themselves. Here we expand the definition to hypersurfaces of any dimension and, using…

In this paper, we extend our result in [3] to hypersurfaces of any smooth projective variety $Y$. Precisely we let $X_0$ be a generic hypersurface of $Y$ and $c_0:\mathbf P^1\to X_0$ be a generic birational morphism to its image, i.e.…

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with…

Given an integer $r$ and a vector $\vec{a}=(a_1, \ldots ,a_p)$ of positive numbers with $\sum_{i \le p} a_i=r$, an $r$-uniform hypergraph $H$ is said to be $\vec{a}$-partitioned if $V(H)=\bigcup_{i \le p}V_i$, where the sets $V_i$ are…

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…

Using the circle method, we count integer points on complete intersections in biprojective space in boxes of different side length, provided the number of variables is large enough depending on the degree of the defining equations and…

Bruinier and Yang conjectured a formula for an intersection number on the arithmetic Hilbert modular surface, CM(K).T_m, where CM(K) is the zero-cycle of points corresponding to abelian surfaces with CM by a primitive quartic CM field K,…

We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…

What is the maximum number of intersections of the boundaries of a simple $m$-gon and a simple $n$-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of $m$ and $n$ is…

Let $M=G/H$ be a Riemannian homogeneous space, where $G$ is a compact Lie group with closed subgroup $H$. Classical intersection theory states that the de Rham cohomology ring of $M$ describes the signed count of intersection points of…

We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points…

We prove a new formula for the Hirzebruch-Milnor classes of global complete intersections with arbitrary singularities describing the difference between the Hirzebruch classes and the virtual ones. This generalizes a formula for the…

A classical result about minimal geodesics on R^2 with Z^2 periodic metric that goes back to H.M. Morse asserts that a minimal geodesic that is asymptotic to a periodic minimal geodesic cannot intersect any periodic minimal geodesic of the…

Let $k$ and $m$ be positive integers. A collection of $k$-multisets from $\{1,..., m \}$ is intersecting if every pair of multisets from the collection is intersecting. We prove that for $m \geq k+1$, the size of the largest such collection…

In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…

In this article we address the problem of computing the dimension of the space of plane curves of degree $d$ with $n$ general points of multiplicity $m$. A conjecture of Harbourne and Hirschowitz implies that when $d \geq 3m$, the dimension…

We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Huemer et al. (Discrete Math, 2019) proved that for any two finite point sets $R$ and $B$ in the plane with $|R| = |B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total squared Euclidean distance…

Consider the Fano scheme $F_k(Y)$ parameterizing $k$-dimensional linear subspaces contained in a complete intersection $Y \subset \mathbb{P}^m$ of multi-degree $\underline{d} = (d_1, \ldots, d_s)$. It is known that, if $t := \sum_{i=1}^s…