Related papers: On Blocking Sets of Affine Spaces
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…
We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…
Intersection numbers for subspace designs are introduced and $q$-analogs of the Mendelsohn and K\"ohler equations are given. As an application, we are able to determine the intersection structure of a putative $q$-analog of the Fano plane…
This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…
We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…
The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…
Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
We study the problem of computing the minimum area triangle that circumscribes a given $n$-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of $n$…
In the previous paper, we established an elementary bound for numbers of points of surfaces in the projective $3$-space over ${\Bbb F}_q$. In this paper, we give the complete list of surfaces that attain the elementary bound. Precisely…
We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
We revisit the fundamental problem of assigning intersection multiplicities to subsets of solutions of (square) systems of polynomials. Severi [Ann. Mat. Pura Appl. 26 (4), 1947] suggested an intuitive dynamic solution to this problem which…
Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize…
We give uniform upper bounds for the number of integral points of bounded height on affine hypersurfaces, which generalise earlier results of Browning,Heath-Brown and the author.
We compute the minimal cardinality of a covering (resp. an irredundant covering) of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given.
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…