Related papers: Perturbations of graphs for Newton maps

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…

Let f be a transcendental map, and let U be an attracting or parabolic basin, or a doubly parabolic Baker domain. Assume U is simply connected. Then, we prove that periodic points are dense in the boundary of U, under certain hypothesis on…

We consider classical curvature flows: 1-parameter families of convex embeddings of the 2-sphere into Euclidean 3-space which evolve by an arbitrary (non-homogeneous) function of the radii of curvature. The associated flow of the radii of…

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…

Given a surface, the fine $k$-curve graph of the surface is a graph whose vertices are simple closed essential curves and whose edges connect curves that intersect in at most $k$ points. We note that the fine $k$-curve graph is hyperbolic…

We obtain rates of convergence in the weak invariance principle (functional central limit theorem) for $\R^d$-valued H\"older observables of nonuniformly hyperbolic maps. In particular, for maps modelled by a Young tower with…

We consider complex Henon maps which are quasi-hyperbolic. We show that a quasi-hyperbolic map is uniformly hyperbolic if and only if there are no tangencies between stable and unstable manifolds.

Using Lavaurs maps and near-parabolic renormalization, we describe the degenerating geometry of external rays for quadratic polynomials when a periodic cycle becomes parabolic. We similarly describe the geometry of parameter rays for the…

Twin-width is a recently introduced graph parameter based on the repeated contraction of near-twins. It has shown remarkable utility in algorithmic and structural graph theory, as well as in finite model theory -- particularly since…

We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…

We show that a 2-subset-regular self-complementary 3-uniform hypergraph with $n$ vertices exists if and only if $n\ge 6$ and $n$ is congruent to 2 modulo 4.

We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

In this paper we numerically explore the convergence properties of the pseudo-Newtonian circular restricted problem of three and four primary bodies. The classical Newton-Raphson iterative scheme is used for revealing the basins of…

We consider a surface with negative curvature in $\Bbb R^3$ which is a cubic perturbation of the saddle. For this surface, we prove a new restriction theorem, analogous to the theorem for paraboloids proved by L. Guth in 2016. This specific…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

We look at tree amalgamations of locally finite quasi-transitive hyperbolic graphs and prove that the homeomorphism type of the hyperbolic boundary of such a tree amalgamation only depends on the homeomorphism types of the hyperbolic…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…