Related papers: Arc length as a conformal parameter for locally an…
Length generalization is a key property of a learning algorithm that enables it to make correct predictions on inputs of any length, given finite training data. To provide such a guarantee, one needs to be able to compute a length…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…
A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…
This paper revisits the fundamental mathematics of Taylor series to approximate curves with function representation and arc-length-based parametric representation. Parametric representation is shown to preserve its form in coordinate…
The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$ is the largest ratio between the lengths of any pair of edges of $\Gamma$ that share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the…
For a continuous function $f : [0,1] \to [0,1]$ we define a splitting sequence admitted by $f$ and show that the inverse limit of $f$ is an arc if and only if $f$ does not admit a splitting sequence.
We provide sufficient conditions on an initial curve for the area preserving and the length preserving curvature flows of curves in a plane, to develop a singularity at some finite time or converge to an $m$-fold circle as time goes to…
One way of interpreting a left Kan extension is as taking a kind of "partial colimit", whereby one replaces parts of a diagram by their colimits. We make this intuition precise by means of the "partial evaluations" sitting in the so-called…
We consider self-similar Jordan arcs $\gamma$ in $R^d$, different from a line segment and show that they cannot be projected to a line bijectively. Moreover, we show that the set of points $x\in\gamma$, for which there is a hyperplane,…
We describe the use of array expressions as constraints, which represents a consequent generalisation of the "element" constraint. Constraint propagation for array constraints is studied theoretically, and for a set of domain reduction…
The Coherence Length Diagram and the related maps have been shown to represent a useful tool for image analysis. Setting threshold parameters is one of the most important issues when dealing with such applications, as they affect both the…
A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.
It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…
For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
A curve $\theta$: $I\to E$ in a metric space $E$ equipped with the distance $d$, where $I\subset \R$ is a (possibly unbounded) interval, is called self-contracted, if for any triple of instances of time $\{t_i\}_{i=1}^3\subset I$ with…
We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…
Diversities have recently been developed as multiway metrics admitting clear and useful notions of hyperconvexity and tight span. In this note we consider the analytic properties of diversities, in particular the generalizations of uniform…
We study local biholomorphisms with finite orbits in some neighborhood of the origin since they are intimately related to holomorphic foliations with closed leaves. We describe the structure of the set of periodic points in dimension 2. As…