English
Related papers

Related papers: Metric Graphs with Totally Disconnected Boundary

200 papers

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Combinatorics · Mathematics 2015-09-25 Tristram C. Bogart , Edward D. Kim

The 'contracting boundary' of a proper geodesic metric space consists of equivalence classes of geodesic rays that behave like rays in a hyperbolic space. We introduce a geometrically relevant, quasi-isometry invariant topology on the…

Metric Geometry · Mathematics 2019-08-21 Christopher H. Cashen , John M. Mackay

The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…

General Topology · Mathematics 2023-08-22 Piotr Niemiec

We study discrete complex analysis and potential theory on a large family of planar graphs, the so-called isoradial ones. Along with discrete analogues of several classical results, we prove uniform convergence of discrete harmonic…

Complex Variables · Mathematics 2011-05-12 Dmitry Chelkak , Stanislav Smirnov

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…

Logic in Computer Science · Computer Science 2023-04-27 Wojciech Przybyszewski

In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…

Combinatorics · Mathematics 2025-02-03 Matthias Hamann , Karl Heuer

Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…

Differential Geometry · Mathematics 2020-11-18 Koji Fujiwara , Takashi Shioya

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Combinatorics · Mathematics 2010-03-19 Matthias Hamann

The toric Hilbert scheme is a parameter space for all ideals with the same multi-graded Hilbert function as a given toric ideal. Unlike the classical Hilbert scheme, it is unknown whether toric Hilbert schemes are connected. We construct a…

Algebraic Geometry · Mathematics 2007-05-23 Diane Maclagan , Rekha R. Thomas

The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…

Combinatorics · Mathematics 2020-11-24 M. A. Iordanski

In a number of recent papers, the idea of generalized boundaries has found use in fractal and in multiresolution analysis; many of the papers having a focus on specific examples. Parallel with this new insight, and motivated by quantum…

Functional Analysis · Mathematics 2018-05-17 Palle Jorgensen , Feng Tian

These notes on Riemannian geometry use the bases bundle and frame bundle, as in Geometry of Manifolds, to express the geometric structures. It has more problems and omits the background material. It starts with the definition of Riemannian…

Differential Geometry · Mathematics 2013-07-30 Richard L. Bishop

We introduce intrinsic interpolatory bases for data structured on graphs and derive properties of those bases. Polyharmonic Lagrange functions are shown to satisfy exponential decay away from their centers. The decay depends on the density…

Numerical Analysis · Mathematics 2020-04-21 John Paul Ward , Francis J. Narcowich , Joseph D. Ward

The dense amalgam is an operation (introduced in arXiv:1410.4989) which to any finite collection of metrizable compacta associates canonically some new highly disconnected compact metrisable space in which embedded copies of the initial…

Group Theory · Mathematics 2026-03-24 Mateusz Kandybo , Jacek Świątkowski

Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal…

Analysis of PDEs · Mathematics 2018-09-25 S. B. Damelin , N. S. Hoang

For a certain parametrized family of maps on the circle, with critical points and logarithmic singularities where derivatives blow up to infinity, a positive measure set of parameters was constructed in [19], corresponding to maps which…

Dynamical Systems · Mathematics 2012-02-07 Hiroki Takahasi

We associate, with every infinite word over a finite alphabet, an increasing sequence of rooted finite graphs, which provide a discrete approximation of the famous Sierpi\'nski carpet fractal. Each of these sequences converges, in the…

Metric Geometry · Mathematics 2016-06-15 Daniele D'Angeli , Alfredo Donno

Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Ne\v{s}et\v{r}il and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a…

Combinatorics · Mathematics 2012-05-21 Jaroslav Nešetřil , Patrice Ossona de Mendez , David R. Wood

We study boundary values of harmonic functions in spaces of quasianalytic functionals and spaces of ultradistributions of non-quasianalytic type. As an application, we provide a new approach to H\"ormander's support theorem for…

Functional Analysis · Mathematics 2023-12-15 Andreas Debrouwere , Jasson Vindas

We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…

Machine Learning · Computer Science 2020-02-17 Nicolo Colombo