English
Related papers

Related papers: Asymptotic dimension and the disk graph I

200 papers

Let $M$ be a Hadamard manifold with curvature bounded above by a negative constant $-\alpha$, satisfying the "strict convexity condition", and assume that $M$ admits a "helicoidal" one-parameter subgroup $G$ of isometries of $M$. Then,…

Differential Geometry · Mathematics 2014-03-06 Jean-Baptiste Casteras , Jaime Ripoll

We prove that if $\Omega$ is a simply connected quadrature domain for a distribution with compact support and the infinity point belongs the boundary, then the boundary has an asymptotic curve that is either a straight line or a parabola or…

Complex Variables · Mathematics 2014-11-03 Lavi Karp

We prove that the linearly controlled asymptotic dimension of the fundamental group of any 3-dimensional graph-manifold does not exceed 7. As applications we obtain that the universal cover of such a graph-manifold is an absolute Lipschitz…

Geometric Topology · Mathematics 2012-04-27 Alexander Smirnov

We show that if $X$ is an indecomposable $PD_3$-complex and $\pi_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then $X$ is orientable, the underlying graph is a tree, all the edge…

Geometric Topology · Mathematics 2014-07-22 J. A. Hillman

Let C represent an irreducible algebraic space curve defined by the real polynomials fi(x1, x2, x3) for i = 1, 2. It is a recognized fact that a birational relationship invariably exists between the points on C and those on an associated…

Algebraic Geometry · Mathematics 2025-03-06 Sonia Pérez-Díaz , Li-Yong Shen , Xin-Yu Wang , R. Magdalena-Benedicto

The parameterized analysis of graph modification problems represents the most extensively studied area within Parameterized Complexity. Given a graph $G$ and an integer $k\in\mathbb{N}$ as input, the goal is to determine whether we can…

Computational Geometry · Computer Science 2024-11-21 Fedor V. Fomin , Petr A. Golovach , Tanmay Inamdar , Saket Saurabh , Meirav Zehavi

Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…

Metric Geometry · Mathematics 2016-06-17 Clemens Huemer , Pablo Pérez-Lantero

We show that for any $n\geq6$, for any $m$, we can find $m$ non-homeomorphic $n$-manifolds that can be mapped by cell-like maps onto the same space $X$.

Geometric Topology · Mathematics 2021-02-18 Michelle Daher

In the first part of this paper, we construct infinitely many hyperbolic closed 3-manifolds which admit no symplectic fillable contact structure. All these 3-manifolds are obtained by Dehn surgeries along L-space knots or L-space…

Geometric Topology · Mathematics 2025-02-26 Fan Ding , Youlin Li , Zhongtao Wu

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

Metric Geometry · Mathematics 2022-01-06 Panos Papasoglu

3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…

Computational Geometry · Computer Science 2024-05-28 Christian Amend , Tom Goertzen

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Geometric Topology · Mathematics 2014-10-14 Ariadna Fossas , Hugo Parlier

We will discuss some sharp estimates for CMC graphs in a Riemannian 3-manifold MxR whose boundary is contained in a slice. We will start by giving sharp lower bounds for the geodesic curvature of the boundary and improve these bounds when…

Differential Geometry · Mathematics 2014-11-25 José M. Manzano

Motivated by recent interest in the spectrum of the Laplacian of incomplete surfaces with isolated conical singularities, we consider more general incomplete m-dimensional manifolds with singularities on sets of codimension at least 2. With…

Differential Geometry · Mathematics 2008-07-01 Jun Masamune , Wayne Rossman

In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which…

Data Structures and Algorithms · Computer Science 2024-07-15 Daniel Lokshtanov , Fahad Panolan , Saket Saurabh , Jie Xue , Meirav Zehavi

We consider slice disks for knots in the boundary of a smooth compact 4-manifold $X^{4}$. We call a knot $K \subset \partial X$ deep slice in $X$ if there is a smooth properly embedded 2-disk in $X$ with boundary $K$, but $K$ is not…

Geometric Topology · Mathematics 2021-06-11 Michael Klug , Benjamin Ruppik

In this paper, we investigate the interpolation of surfaces which are obtained from an isoasymptotic curve in 3D-Euclidean space. We prove that there exist a unique $ C^0 $-Hermite surface interpolation related to an isoasymptotic curve…

General Mathematics · Mathematics 2022-12-19 Mustafa Altın , İnan Ünal , Fatemah Mofarreh

We show there exists a closed graph manifold $N$ and infinitely many non-separable, horizontal surfaces $\{S_{n} \to N\}_{n \in \mathbb{N}}$ such that there does not exist a quasi-isometry $\pi_1(N) \to \pi_1(N)$ taking $\pi_1(S_{n})$ to…

Group Theory · Mathematics 2018-08-09 Hoang Thanh Nguyen

We show that for certain hyperbolic 3-manifolds, all boundary slopes are slopes of immersed incompressible surfaces, covered by incompressible embeddings in some finite cover. The manifolds include hyperbolic punctured torus bundles and…

Geometric Topology · Mathematics 2007-05-23 Joseph Maher

We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them. That is, two entities are not mutually visible if they are too…

Computational Geometry · Computer Science 2021-03-29 Onur Çağırıcı , Deniz Ağaoğlu