Related papers: Arc length as a conformal parameter for locally an…
The General Curve Lemma is a tool of Infinite-Dimensional Analysis, which enables refined studies of differentiability properties of mappings between real locally convex spaces. In this article, we generalize the General Curve Lemma in two…
This paper introduces the concept of Fractal Frenet equations, a set of differential equations used to describe the behavior of vectors along fractal curves. The study explores the analogue of arc length for fractal curves, providing a…
An arc in $\Z^2_n$ is defined to be a set of points no three of which are collinear. We describe some properties of arcs and determine the maximum size of arcs for some small $n$.
A polynomial lemniscate is a curve in the complex plane defined by $\{z \in \mathbb{C}:|p(z)|=t\}$. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $\Lambda=\{ z \in…
Let $(f, g)$ be a pair of complex analytic functions on a singular analytic space $X$. We give ``the correct'' definition of the relative polar curve of $(f, g)$, and we give a very formal generalization of L\^e's attaching result, which…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
Let $k$ be a complete, nontrivially valued non-archimedean field. Given a finite morphism of quasi-smooth $k$-analytic curves that admit finite triangulations, we provide upper bounds for the number of connected components of the…
We characterize which planar graphs arise as the pullback, under a rational map $r$, of an analytic Jordan curve passing through the critical values of $r$. We also prove that such pullbacks are dense within the collection of…
The metric dimension is quite a well-studied graph parameter. Recently, the adjacency dimension and the local metric dimension have been introduced and studied. In this paper, we give a general formula for the local metric dimension of the…
Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…
We study the local symplectic algebra of parameterized curves introduced by V. I. Arnold. We use the method of algebraic restrictions to classify symplectic singularities of quasi-homogeneous curves. We prove that the space of algebraic…
We prove that curve shortening flow on the round sphere displays sharp chord-arc improvement, precisely as in the planar setting (Andrews and Bryan, Comm. Anal. Geom., 2011). As in the planar case, the sharp estimate implies control on the…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
Planar curves with periodically varying curvature arise in the natural sciences as the result of a wide variety of periodic processes. The total curvature of a periodic arc in such curves constrains their symmetry. It is shown how the total…
We use Taylor's formula with Lagrange remainder to prove that functions with bounded second derivative are rectifiable in the case when polygonal paths are defined by interval subdivisions which are equally spaced. We discuss potential…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
In 1925, Jarnik defined a sequence of convex polygons for use in constructing curves containing many lattice points relative to their curvatures. Properly scaled, these polygons converge to a certain limiting curve. In this paper we…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…