Related papers: Prill's problem

${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…

Let $f(x,y)=0$ and $l(x,y)=0$ be respectively a singular and a regular analytic curve defined in the neighborhood of the origin of the complex plane. We study the family of analytic curves $f(x,y)-tl(x,y)^M=0$, where $t$ is a complex…

In this paper we determine the number of general points through which a Brill--Noether curve of fixed degree and genus in any projective space can be passed.

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

It was first pointed out by Weil that we can use classical invariant theory to compute the Jacobian of a genus one curve. The invariants required for curves of degree n = 2,3,4 were already known to the nineteenth centuary invariant…

Using an Euclidean approach, we prove a new upper bound for the number of closed points of degree 2 on a smooth absolutely irreducible projective algebraic curve defined over the finite field $\mathbb F\_q$.This bound enables us to provide…

We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given degree sequence \sigma by at most k vertex or edge deletions…

We give a new proof of the Semistable Reduction Theorem for curves. The main idea is to present a curve $Y$ over a local field $K$ as a finite cover of the projective line $X=\PP^1_K$. By successive blowups (and after replacing $K$ by a…

This paper poses some basic questions about instances (hard to find) of a special problem in 3-manifold topology. "Important though the general concepts and propositions may be with the modern industrious passion for axiomatizing and…

We consider all genus 2 curves over Q given by an equation y^2 = f(x) with f a squarefree polynomial of degree 5 or 6, with integral coefficients of absolute value at most 3. For each of these roughly 200000 isomorphism classes of curves,…

We propose an algebraic method for the classification of branched Galois covers of a curve $X$ focused on studying Galois ring extensions of its geometric adele ring $\A_{X}$. As an application, we deal with cyclic covers; namely, we…

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…

An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to "$K_t$ clique cover", i.e. a set of cliques that covers all complete subgraphs on $t$ vertices of the graph, for every $t…

We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's circle problem (1959). The proof relies on a…

In this paper we resolve the degree-2 Abel map for nodal curves. Our results are based on a previous work of the authors reducing the problem of the resolution of the Abel map to a combinatorial problem via tropical geometry. As an…

We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \textit{badness} of a given…

Let $C$ be a curve of genus $g$. A fundamental problem in the theory of algebraic curves is to understand maps $C \to \mathbb{P}^r$ of specified degree $d$. When $C$ is general, the moduli space of such maps is well-understood by the main…

We show how the Weil pairing can be used to evaluate the assigned characters of an imaginary quadratic order $\mathcal{O}$ in an unknown ideal class $[\mathfrak{a}] \in \mathrm{Cl}(\mathcal{O})$ that connects two given…