SearcharxivSearch

arXiv subjects

Nikolai Nikolov

Publications and source records attributed to Nikolai Nikolov.

At least 19 recordsLinked to original sources

Optimal bounds for the Kobayashi distance near $\mathcal C^2$-smooth boundary points

It is shown that the optimal upper and lower bounds for the Kobayashi distance near $\mathcal C^{2,α}$-smooth strongly pseudoconvex boundary points obtained in L. Kosinski, N. Nikolov, A.Y. Okten: "Precise estimates of invariant distances on strongly pseudoconvex domains", Adv. Math. 478 (2025), 110388, remain true in the general $\mathcal C^2$ strongly pseudoconvex setting. In fact, the upper bound is extended to the general $\mathcal C^{1,1}$-smooth case. We also give upper and lower bounds for the Kobayashi distance near non-semipositive boundary points.

math.CV

A Note on the Converse Sendov Problem

For a polynomial of degree $n$ whose zeros lie in the closed unit disk, we determine the largest possible distance from a prescribed critical point of modulus $r$ to the nearest zero. If $n$ is even, the sharp radius is $\sqrt{1-r^2}$; if $n$ is odd, the sharp radius is strictly smaller for $r\in(0,1)$ and depends on $n$. Equality cases are also determined. The proof is based on the logarithmic-derivative identity and elementary geometric considerations.

math.CV

Geometric optimization problems generated by plane curves

Let $γ_1$ and $ γ_2$ be regular $C^1$-smooth curves in the plane and $γ$ be a regular $C^2$-smooth curve in the same plane. Consider all triples of points $(A, A_1, A_2)$, $A\in γ$, $A_1\in γ_1$, $A_2\in γ_2$, such that $A_1\neq A_2$, and the line $A_1 A_2$ is the normal to $γ$ at $A$. We show that, if $γ$ has non-vanishing curvature and the triple $(A^0, A_1^0,A_2^0 )$ is a local maximum or a local minimum for the distance $|A_1A_2|$ between the points $A_1$ and $A_2$, then the following three lines either meet at a single point or are parallel: the normal to $γ_1$ at $A_1^0$, the normal to $γ_2$ at $A_2^0$ and the line which is perpendicular to $A_1^0A_2^0$, and passing through the center of curvature of $γ$ at $A^0$. The particular case of this optimization problem, when $γ$ is a circle with a given center $O$, coincides with the already partially studied problem of finding the locally shortest (or the locally longest) non-degenerate segments $[A_1A_2]$ such that $A_1\inγ_1$, $A_2\inγ_2$ and $O\in A_1A_2$. We also show that the seemingly different problem of finding the locally shortest (or the locally longest) non-degenerate segments $[A_1A_2]$, such that $A_1 \in γ_1$, $A_2 \in γ_2$, and the line $A_1A_2$ is tangent to $γ$ is also, in essence, a particular case of the above optimization problem. We consider in detail the ``degenerate cases'' naturally appearing in this setting (when, for instance, $γ_1$ or $γ_2$ coincide with $γ$, or when the optimal line $A_1^0A_2^0$ is tangent to at least one of $γ_1$ or $γ_2$).

math.MG

On Ulam's Segment Motion Problem

We study extremal rigid motions of a unit segment in $\mathbb{R}^d$, $d\ge 2$. Given two prescribed positions of a unit segment, we consider continuous motions transforming the initial position into the final one and investigate the total length of the trajectories traced by its endpoints. This minimization problem was posed by Ulam~\cite{Ulam1960} and solved by Gurevich~\cite{Gurevich1977} and Dubovitskii~\cite{Dubovitskii1976}. Two natural lower bounds are given by the sum of the endpoint displacements and by the angle between the initial and final directions of the segment. We characterize all pairs of segment positions for which either of these lower bounds is attained. In arbitrary dimension, we obtain complete characterizations of the equality cases for both the endpoint-displacement bound and the angular bound.

math.MG

Invariant metrics of model domains near pseudoconcave points

We give precise estimates of some holomorphically invariant infinitesimal metrics near a pseudoconcave points in a wide family of ``model'' domains for that situation in $\mathbb C^2$. This extends to metrics (rather distances) the authors' previous results from arXiv:2503.19754 and also takes into account defining functions more general than just power functions.

math.CV

Moving rectangular sofas in planar and spatial corridors

We consider eight natural planar corridors, including the standard $\mathrm{L}$-shaped one, and characterize the rectangles that can move around their corners. As a bi-product we describe completely the corresponding rectangles with maximum area, as well as the rectangular parallelepipeds with maximum volume that can move around the corners of the spatial analogues of the considered eight planar corridors.

math.MG

How regular is the evolute of a plane curve?

We study the relationship between the smoothness of a plane curve and that of its evolute, especially in the cases where the parent curve is no more two or three times continuously differentiable, and exhibit the same kind of apparent improvement in regularity: in the generic local situation, the evolute has one order of regularity less than the parent curve.

math.DG

On a geometric extremum problem for convex cones

We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the stationary hyperplanes for this problem when $K$ is a hyperangle which partially answers a question posed in \cite{We}. Moreover, we study the location of the set $S$ of points for which there is a stationary hyperplane as well as the infimum of the $(n-1)$-volumes of cone segments of $K$ cut off by hyperplanes through a given boundary point of $K$. As a model example we study in detail the non-negative orthant of $\Bbb R^n$. In this case $S$ is its interior and we show that every point of $S$ lies in a unique stationary hyperplane, which we describe in terms of the unique real root of an irrational equation.

math.MG

Quasi Triangle Inequality for the Lempert function

The (unbounded version of the) Lempert function $l_D$ on a domain $D\subset\Bbb C^d$ does not usually satisfy the triangle inequality, but on bounded $\mathcal C^2$-smooth strictly pseudoconvex domains, it satisfies a quasi triangle inequality: $l_D(a,c)\le C( l_D(a,b)+l_D(b,c))$. We show that pseudoconvexity is necessary for this property as soon as $D$ has a $\mathcal C^1$-smooth boundary. We also give estimates of the Lempert function and of other invariants in some domains which are models for local situations, and derive some general local bounds depending on the regularity of the boundary of a domain.

math.CV

Precise estimates of invariant distances on strongly pseudoconvex domains

Studying the behavior of real and complex geodesics we provide sharp estimates for the Kobayashi distance, the Lempert function, and the Carathéodory distance on $\mathcal{C}^{2,α}$-smooth strongly pseudoconvex domains. Similar estimates are also provided for the Bergman distance on strongly pseudoconvex domains with $\mathcal{C}^{3,1}$-boundary.

math.CV

A Generalization of a Classical Geometric Extremum Problem

Let $\partial \,\mathcal{C}$ be the boundary of a compact convex body $\mathcal{C}$ in $\mathbb{R}^n,\, n\geq 2$, and $O$ be an interior point of $\mathcal C$. Every straight line $l$ containing $O$ cuts from $\mathcal{C}$ a segment $[AB]$ with end-points on $\partial \,\mathcal{C}$. It is shown that if $[AB]$ is the shortest such segment, then $\partial \,\mathcal{C}$ is smooth at the points $A$ and $ B$ (i.e. at both of them there is only one supporting hyperplane for $\mathcal{C}$) and, something more, the normals to the unique supporting hyperplanes at the points $A$ and $B$ intersect at a point belonging to the hiperplane through $O$ which is orthogonal to $[AB]$. If $\mathcal{C}$ is a smooth compact convex body in $\mathbb{R}^n,\, n\geq 2$, the above property holds also when $[AB]$ is the longest such segment. Similar results have place also when $O$ is outside the set $\mathcal{C}$. The ``local versions'' of these results (when the length $|AB|$ of the segment $[AB]$ is locally maximal or locally minimal) also have a place. More specific results are obtained in the particular case when $\mathcal{C}$ is a convex polytope.

math.MG

Boundary regularity for the distance functions, and the eikonal equation

We study the gain in regularity of the distance to the boundary of a domain in $\mathbb R^m$. In particular, we show that if the signed distance function happens to be merely differentiable in a neighborhood of a boundary point, it and the boundary have to be $\mathcal C^{1,1}$ regular. Conversely, we study the regularity of the distance function under regularity hypotheses of the boundary. Along the way, we point out that any solution to the eikonal equation, differentiable everywhere in a domain of the Euclidean space, admits a gradient which is locally Lipschitz.

math.AP

Precise estimates for certain distances in $\mathbb{R}^d$

We provide sharp estimates for the intrinsic distances of Finsler metrics with precise boundary estimates. These metrics include the Kobayashi-Hilbert metric near strongly convex points, the minimal metric near convex and strongly minimally convex points, and the $k$-quasi hyperbolic metric in $k$-strongly convex domains. Finally, we prove a characterization result in convex geometry for the $k$-quasi hyperbolic metric.

math.DG

Explicit universal bounds for squeezing functions of ($\mathbb{C}$-)convex domains

We prove two separate lower bounds -- one for nondegenerate convex domains and the other for nondegenerate $\mathbb{C}$-convex (but not necessarily convex) domains -- for the squeezing function that hold true for all domains in $\mathbb{C}^n$, for a fixed $n\geq 2$, of the stated class. We provide explicit expressions in terms of $n$ for these estimates.

math.CV

Properties and conjectures regarding discrete renewal sequences

In this work we review and derive some elementary properties of the discrete renewal sequences based on a positive, finite and integer-valued random variable. Our results consider these sequences as dependent on the probability masses of the underlying random variable. In particular we study the minima and the maxima of these sequences and prove that they are attained for indices of the sequences smaller or equal than the support of the underlying random variable. Noting that the minimum itself is a minimum of multi-variate polynomials we conjecture that one universal polynomial envelopes the minimum from below and that it is maximal in some sense and largest in another. We prove this conjecture in a special case.

math.PR