Related papers: Twenty Points in P^3
The computation of the dimension of linear systems of plane curves through a bunch of given multiple points is one of the most classic issues in Algebraic Geometry. In general, it is still an open problem to understand when the points fail…
The Sylvester-Gallai theorem says that for any finite set of non-collinear points in $\R^2$, there is some line passing through exactly two points of the set. Over the complex numbers, this theorem fails: there are finite configurations…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
We study Gorenstein liaison of codimension two subschemes of an arithmetically Gorenstein scheme X. Our main result is a criterion for two such subschemes to be in the same Gorenstein liaison class, in terms of the category of ACM sheaves…
Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…
Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…
We use class field theory to search for curves with many rational points over small finite fields. By going through abelian covers of curves of small genus we find a number of new curves. In particular, we settle the question of how many…
Let $ e_1, ..., e_c $ be positive integers and let $ Y \subseteq \mathbb{P}^n$ be the monomial complete intersection defined by the vanishing of $x_1^{e_1}, ..., x_c^{e_c}$. In this paper we study sharp upper bounds on the number of…
In this follow-up paper, we again inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ or $\in \mathbb{Z}_{p}$ or…
We extend the notion of chain algebra, originally defined in \cite{GN} for finite distributive lattices, to that of finite pure posets. We show this algebra corresponds to the Ehrhart ring of a (0,1)-polytope, termed the chain polytope, and…
In this paper, we show that the number of points that can be placed in the grid $n\times n\times \cdots \times n~(d~times)=n^d$ for all $d\in \mathbb{N}$ with $d\geq 2$ so that no three points are collinear satisfies the lower bound…
We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…
We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…
Algebraically simply connected surfaces of general type with p_g=q=0 and 1\le K^2\le 4 in positive characteristic (with one exception in K^2=4) are presented by using a Q-Gorenstein smoothing of two-dimensional toric singularities, a…
We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…
We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a…
We consider the level-sets of continuous Gaussian fields on $\mathbb{R}^d$ above a certain level $-\ell\in \mathbb{R}$, which defines a percolation model as $\ell$ varies. We assume that the covariance kernel satisfies certain regularity,…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
The pole placement problem belongs to the classical problems of linear systems theory. It is often assumed that the ground field is the real numbers R or the complex numbers C. The major result over the complex numbers derived in 1981 by…
We prove a numerical characterization of $\mathbb{P}^n$ for varieties with at worst isolated local complete intersection quotient singularities. In dimension three, we prove such a numerical characterization of $\mathbb{P}^3$ for normal…