Related papers: Resolutions of Subsets of Finite Sets of Points in…

We investigate the defining ideal of a set of points X in multi-projective space with a special emphasis on the case that X is in generic position, that is, X has the maximal Hilbert function. When X is in generic position, we determine the…

What is the shape of the free resolution of the ideal of a general set of points in P^r? This question is central to the programme of connecting the geometry of point sets in projective space with the structure of the free resolutions of…

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

We study the Hilbert function of a general union $X\subset \mathbb{P}^3$ of $x$ double lines and $y$ lines. In many cases (e.g. always for $x=2$ and $y\ge 3$ or for $x=3$ and $y\ge 2$ or for $x\ge 4$ and $y\ge \lceil(\binom{3x+4}{3}…

We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…

We consider the multigraded Hilbert scheme corresponding to the Hilbert function of a finite number of points in general position in a smooth projective complex toric variety. We develop several criteria for a point of that parameter space…

In order to determine the Hilbert function of the ideal of a fat point subscheme of projective space, we show that it is enough to determine, both for the subscheme itself and the subschemes obtained from it by successively adjoining to it…

In this paper, we will give an upper bound and a lower bound of the arithmetic Hilbert-Samuel function of projective hypersurfaces, which are uniform and explicit. These two bounds have the optimal dominant terms. As an application, we use…

For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…

The graded Betti numbers of the minimal free resolution (and also therefore the Hilbert function) of the ideal of a fat point subscheme Z of P^2 are determined whenever Z is supported at any 6 or fewer distinct points. All results hold over…

Let I be the ideal corresponding to a set of general points $p_1,...,p_n \in P^2$. There recently has been progress in showing that a naive lower bound for the Hilbert functions of symbolic powers $I^{(m)}$ is in fact attained when n>9.…

We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…

We study the closure of the locus of radical ideals in the multigraded Hilbert scheme associated with a standard graded polynomial ring and the Hilbert function of a homogeneous coordinate ring of points in general position in projective…

A subspace arrangement in a vector space is a finite collection of vector subspaces. Similarly, a configuration of linear spaces in a projective space is a finite collection of linear subspaces. In this paper we study the degree 2 part of…

This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…

In this paper we consider the problem of determining the Hilbert function of schemes X of the proiective space P^n which are the generic union of s lines and one m-multiple point. We completely solve this problem for any s and m when n > 3.…

We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…

We consider the following open questions. Fix a Hilbert function, $h$, that occurs for a reduced zero-dimensional subscheme of $\mathbb P^2$. Among all subschemes, $X$, with Hilbert function $h$, what are the possible Hilbert functions and…

Let Z be a fat point scheme in P^2 supported on general points. Here we prove that if the multiplicities are at most 3 and the length of Z is sufficiently high then the number of generators of the homogeneous ideal I_Z in each degree is as…