Related papers: Arc length as a conformal parameter for locally an…
We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply…
The conformal nature of smooth curves in $\mathbb{R}^3$ is characterised by conformal length, curvature and torsion. We present a derivation of these conformal parameters via a limiting process using inscribed polygons with circular edges .…
In this paper, we consider the realization of configuration of limit cycles of piecewise linear systems on the plane. We show that any configuration of Jordan curves can be realized by a discontinuous piecewise linear system with two zones…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We present an algorithm to fair a given planar curve by a log-aesthetic curve (LAC). We show how a general LAC segment can be uniquely characterized by seven parameters and present a method of parametric approximation based on this fact.…
In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…
We introduce a notion of limit linear series for nodal curves which are not of compact type. We give a construction of a moduli space of limit linear series, which works also in smoothing families, and we prove a corresponding…
We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of planar graphs. The characterization is formulated in terms of…
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…
In this paper we study the spectrality of arc-length measures supported on the union of two line segments in the plane. We show that any such spectral measure must admit a line spectrum. Moreover, when the two segments are non-parallel,…
The Stone-Weierstrass approximation theorem is extended to certain unbounded sets in $C^n$. In particular, on a locally rectifiable arc going to infinity, each continuous function can be approximated by entire functions.
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
If $c, \overline c\colon [a,b]\to \mathbb R^2$ are two convex planar curve parameterized by affine arc length and $A\colon [a,b]\to [0,\infty)$ is the area bounded by the restriction $c\big|_{[a,s]}$ and the segment between $c(a)$ and…
We give an answer in the "geometric" setting to a question of de Fernex, Ein, and Ishii, asking when local isomorphisms of $k$-schemes can be detected on the associated maps of local arc or jet schemes. In particular, we show that their…
Under very mild assumptions, we give formulas for the correlation and local dimensions of measures on the limit set of a Moran construction by means of the data used to construct the set.
In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
We prove a general criterion for a metric space to have conformal dimension one. The conditions are stated in terms of the existence of enough local cut points in the space. We then apply this criterion to the boundaries of hyperbolic…