38,541 research outputs found
On the degree of the polynomial defining a planar algebraic curves of constant width
In this paper, we consider a family of closed planar algebraic curves
which are given in parametrization form via a trigonometric
polynomial . When is the boundary of a compact convex set, the
polynomial represents the support function of this set. Our aim is to
examine properties of the degree of the defining polynomial of this family of
curves in terms of the degree of . Thanks to the theory of elimination, we
compute the total degree and the partial degrees of this polynomial, and we
solve in addition a question raised by Rabinowitz in \cite{Rabi} on the lowest
degree polynomial whose graph is a non-circular curve of constant width.
Computations of partial degrees of the defining polynomial of algebraic
surfaces of constant width are also provided in the same way.Comment: 13 page
A spectral lower bound for the divisorial gonality of metric graphs
Let be a compact metric graph, and denote by the Laplace
operator on with the first non-trivial eigenvalue . We
prove the following Yang-Li-Yau type inequality on divisorial gonality
of . There is a universal constant such that
where the
volume is the total length of the edges in ,
is the minimum length of all the geodesic paths
between points of of valence different from two, and is the
largest valence of points of . Along the way, we also establish
discrete versions of the above inequality concerning finite simple graph models
of and their spectral gaps.Comment: 22 pages, added new recent references, minor revisio
Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive
epsilon, we want to compute an epsilon-isotopic polygonal approximation to the
restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on
subdivision algorithms because of their adaptive complexity and ease of
implementation. Plantinga and Vegter gave a numerical subdivision algorithm
that is exact when the curve S is bounded and non-singular. They used a
computational model that relied only on function evaluation and interval
arithmetic. We generalize their algorithm to any bounded (but possibly
non-simply connected) region that does not contain singularities of S. With
this generalization as a subroutine, we provide a method to detect isolated
algebraic singularities and their branching degree. This appears to be the
first complete purely numerical method to compute isotopic approximations of
algebraic curves with isolated singularities
- …