Related papers: Addition-deletion results for plus-one generated c…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…
We show that all the possible pairs of integers occur as exponents for free or nearly free irreducible plane curves and line arrangements, by producing only two types of simple families of examples. The topology of the complements of these…
On a projective surface it is well-known that the set of curves orthogonal to a nef line bundle is either finite or uncountable. We show that this dichotomy fails in higher dimension by constructing a nef line bundle on a threefold which is…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We construct a connection and a curving on a bundle gerbe associated with lifting a structure group of a principal bundle to a central extension. The construction is based on certain structures on the bundle, i.e. connections and…
In this note we study the logarithmic derivation module of a non-free arrangement. We prove a generalized addition theorem for all arrangements. This addition theorem allows us to find various relationships between non-free arrangements,…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
A result of Keel and McKernan states that a hypothetical counterexample to the F-conjecture must come from rigid curves on $\bar {M}_{0,n}$ that intersect the interior. We exhibit several ways of constructing rigid curves. In all our…
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…
Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…
We find bounds on the difference between the writhing number of a smooth curve, and the writhing number of a polygon inscribed within. The proof is based on an extension of Fuller's difference of writhe formula to the case of polygonal…
Let $C:f=0$ be a reduced curve in the complex projective plane. The minimal degree $mdr(f)$ of a Jacobian syzygy for $f$, which is the same as the minimal degree of a derivation killing $f$, is an important invariant of the curve $C$, for…
If the theta-null divisor $\Theta_{\rm null}$ is moved to the Prym moduli space through the diagram $\mathcal{S}_{g}^{+}\rightarrow\mathcal{M}_{g}\leftarrow\mathcal{R}_{g}$, it splits into two irreducible components $\mathcal{P}_{\rm\!…
Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…
We prove a bound on the sum of the product of curl-free and divergence-free vector fields. Under appropriate orthonormality conditions our bound scales sublinearly in the number of terms, similar in spirit to Lieb--Thirring inequalities.
In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.