Related papers: Algebraic curves and Maximal arcs

We associate curves of isotropic, Lagrangian and coisotropic subspaces to higher order, one parameter variational problems. Minimality and conjugacy properties of extremals are described in terms of these curves.

We give an asymptotic lower bound on the number of field extensions generated by algebraic points on superelliptic curves over $\mathbb{Q}$ with fixed degree $n$ and discriminant bounded by $X$. For $C$ a fixed such curve given by an affine…

We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…

If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…

For each of the forty-eight exceptional algebraic solutions $u(x)$ of the sixth equation of Painlev\'e, we build the algebraic curve $P(u,x)=0$ of a degree conjectured to be minimal, then we give an optimal parametric representation of it.…

A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…

We study arithmetical and geometrical properties of {\it maximal curves}, that is, curves defined over the finite field $\mathbb F_{q^2}$ whose number of $\mathbb F_{q^2}$-rational points reachs the Hasse-Weil upper bound. Under a…

Let $G$ be a $k$-degenerate graph of order $n.$ It is well-known that $G\ $has no more edges than $S_{n,k},$ the join of a complete graph of order $k$ and an independent set of order $n-k.$ In this note it is shown that $S_{n,k}$ is…

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…

In this paper, we give an elementary new method for determining the rational points on algebraic curves using torsion packets. We also provide examples of curves for which all rational points can be completely determined by our method.

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

In positive characteristic, algebraic curves can have many more automorphisms than expected from the classical Hurwitz's bound. There even exist algebraic curves of arbitrary high genus g with more than 16g^4 automorphisms. It has been…

Let $K$ be a number field, and $g \geq 2$ a positive integer. We define $c_K(g)$ as the smallest integer $n$ such that there exist infinitely many $\overline{K}$-isomorphism classes of genus $g$ hyperelliptic curves $C/K$ with all…

In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…

Let $X$ be a convex curve in the plane (say, the unit circle), and let $\mathcal S$ be a family of planar convex bodies, such that every two of them meet at a point of $X$. Then $\mathcal S$ has a transversal $N\subset\mathbb R^2$ of size…

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

The k-planar graphs, which are (usually with small values of k such as 1, 2, 3) subject to recent intense research, admit a drawing in which edges are allowed to cross, but each one edge is allowed to carry at most k crossings. In recently…

We characterize the space of restrictions of real rational functions to certain algebraic Jordan curves in the plane via the Dirichlet-to-Neumann map associated to the domain in the complex plane bounded by the curve and its Bergman kernel.…

We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound if and only if it is the disjoint union of incidence graphs…

We classify entire 2-dimensional area-minimizing or stable surfaces in R^4 with quadratic area growth as algebraic, cut out by a finite union of holomorphic polynomials whose collective degrees are controlled by the density at infinity. As…