Related papers: Blocking sets from a union of plane curves

There are two purposes in this article. One is to present a criterion for the existence of a birational embedding into a projective plane with inner and outer Galois points for algebraic curves. Another is to classify plane curves of degree…

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We…

We study the Betti tables of reducible algebraic curves with a focus on connected line arrangements and provide a general formula for computing the quadratic strand of the Betti table for line arrangements that satisfy certain hypotheses.…

We present a conjecture for the power-law exponent in the asymptotic number of types of plane curves as the number of self-intersections goes to infinity. In view of the description of prime alternating links as flype equivalence classes of…

We address the problem of bounding from below the self-intersection of integral curves on the projective plane blown-up at general points. In particular, by applying classical deformation theory we obtain the expected bound in the case of…

We report on the problem of the existence of complex and real algebraic curves in the plane with prescribed singularities up to analytic and topological equivalence. The question is whether, for a given positive integer $d$ and a finite…

In this paper we focus on various aspects of singular complex plane curves, mostly in the context of their homological properties and the associated combinatorial structures. We formulate some challenging open problems that can point to new…

A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…

Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…

In this paper, we investigate the problem of separating a set $X$ of points in $\mathbb{R}^{2}$ with an arrangement of $K$ lines such that each cell contains an asymptotically equal number of points (up to a constant ratio). We consider a…

We study tori attached to the fundamental groups of plane curves with arbitrary singularities. These tori provide complete information about homology of finite abelian covers of the plane branched along the curve. We calculate these tori in…

In this paper, we characterise ovoidal cones by their intersection numbers. We first show that a set of points of $\mathrm{PG}(4,q)$ which intersects planes in $1$, $q+1$ or $2q+1$ points is either an ovoidal cone or a parabolic quadric,…

Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…

One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…

We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersection cuts from a…

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…

Very few examples of obstructed equsingular families of curves on surfaces other than the projective plane are known. Combining results from Westenberger and Hirano with an idea from math.AG/9802009 we give in the present paper series of…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…