Related papers: Twenty Points in P^3
We investigate the nearly Gorenstein property among $d$-dimensional cyclic quotient singularities $\Bbbk[[x_1,\dots,x_d]]^G$, where $\Bbbk$ is an algebraically closed field and $G\subseteq{\rm GL}(d,\Bbbk)$ is a finite small cyclic group…
We exhibit generically nonreduced components of the Hilbert scheme of at least $21$ points on a smooth variety of dimension at least four. The result was announced in~[Jelisiejew__open_problems] and answers a question~[Problem~3.8, AIMPL].…
We study a non-trivial extreme case of the orchard problem for $12$ pseudolines and we provide a complete classification of pseudoline arrangements having $19$ triple points and $9$ double points. We have also classified those that can be…
We establish restrictions on the Hilbert function of standard graded Gorenstein algebras with only quadratic relations. Furthermore, we pose some intriguing conjectures and provide evidence for them by proving them in some cases using a…
Let $I$ be a perfect ideal of height 3 in a Gorenstein local ring $R$. Let $\mathbb{F}$ be the minimal free resolution of $I$. A sequence of linear maps, which generalize the multiplicative structure of $\mathbb{F}$, can be defined using…
In this paper, we exploit some geometric-differential techniques to prove the strong Lefschetz property in degree $1$ for a complete intersection standard Artinian Gorenstein algebra of codimension $6$ presented by quadrics. We prove also…
We study special linear systems of surfaces of $\mathbb{P}^3$ interpolating nine points in general position having a quadric as fixed component. By performing degenerations in the blown-up space, we interpret the quadric obstruction in…
Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short)…
A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…
This article introduces a previously unrecognized combinatorial structure underlying configurations of skew lines in $\mathbb{P}^3$, and reveals its deep and surprising connection to the algebro-geometric concept of geproci sets. Given any…
Given a set of points in P^2, we consider the common zeros of the set of curves of a given degree passing through those points. For general sets of points, these zero sets have the expected dimension and are smooth. In fact, given graded…
In this article, we investigate some properties of the coincidence point set of digitally continuous maps. Following the Rosenfeld graphical model which seems more combinatorial than topological, we expect to achieve results that might not…
The general position problem for graphs was inspired by the no-three-in-line problem from discrete geometry. A set $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of…
A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
In this paper we prove a conjecture about the dimension of linear systems of surfaces of degree d in P^3 through at most eight multiple points in general position.
In this paper we consider the question of determining the geometric genera of irreducible curves lying on a very general surface $S$ of degree $d$ at least 5 in $\mathbb{P}^3$ (the cases $d \leqslant 4$ are well known). We introduce the set…