English
Related papers

Related papers: High Distance Bridge Surfaces

200 papers

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

Information Theory · Computer Science 2018-07-23 José Gómez-Torrecillas , Gabriel Navarro , F. J. Lobillo , Alessandro Neri

We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime…

Geometric Topology · Mathematics 2019-08-28 Michal Jablonowski

We construct symplectic surface bundles over surfaces with positive signatures for all but 18 possible pairs of fiber and base genera. Meanwhile, we determine the commutator lengths of a few new mapping classes.

Geometric Topology · Mathematics 2023-02-15 R. Inanc Baykur , Mustafa Korkmaz

Our work investigates varifolds $\Sigma \subset M$ in a Riemannian manifold, with arbitrary codimension and bounded mean curvature, contained in an open domain $\Omega$. Under mild assumptions on the curvatures of $M$ and on $\partial…

Differential Geometry · Mathematics 2024-01-17 Eddygledson Souza Gama , Jorge H. S. de Lira , Luciano Mari , Adriano A. de Medeiros

The medial axis of a smoothly embedded surface in $\mathbb{R}^3$ consists of all points for which the Euclidean distance function on the surface has at least two minima. We generalize this notion to the mid-sphere axis, which consists of…

Computational Geometry · Computer Science 2025-04-22 Herbert Edelsbrunner , Elizabeth Stephenson , Martin Hafskjold Thoresen

We construct an infinite family of homologous, non-isotopic, symplectic surfaces of any genus greater than one in a certain class of closed, simply connected, symplectic four-manifolds. Our construction is the first example of this…

Geometric Topology · Mathematics 2018-12-24 B. Doug Park , Mainak Poddar , Stefano Vidussi

Let X be a simply-connected closed oriented 4-manifold and A an embedded surface of genus g and negative self-intersection -N. We show that for fixed genus g there is an upper bound on N if the homology class of A is divisible or…

Geometric Topology · Mathematics 2019-03-05 M. J. D. Hamilton

The first aim of this paper is to give four types of examples of surface bundles over surfaces with non-zero signature. The first example is with base genus 2, a prescribed signature, a 0-section and the fiber genus greater than a certain…

Geometric Topology · Mathematics 2019-07-03 Naoyuki Monden

The complexity of threshold phenomena is exemplified on a prominent and long-known case - the structure in the $\Lambda p$ cross section (invariant mass spectrum) at the opening of the $\Sigma N$ channel. The mass splitting between the…

Nuclear Theory · Physics 2021-09-28 J. Haidenbauer , U. -G. Meißner

Given two shapes $A$ and $B$ in the plane with Hausdorff distance $1$, is there a shape $S$ with Hausdorff distance $1/2$ to and from $A$ and $B$? The answer is always yes, and depending on convexity of $A$ and/or $B$, $S$ may be convex,…

Computational Geometry · Computer Science 2021-02-17 Marc van Kreveld , Tillmann Miltzow , Tim Ophelders , Willem Sonke , Jordi L. Vermeulen

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…

Combinatorics · Mathematics 2020-06-04 Colin McDiarmid

Let $(M, \omega)$ be a connected, compact 6-dimensional symplectic manifold equipped with a semi-free Hamiltonian $S^1$ action such that the fixed point set consists of isolated points or surfaces. Assume dim $H^2(M)<3$, in \cite{L}, we…

Symplectic Geometry · Mathematics 2007-05-23 Hui Li

We construct, for $m\geq 6$ and $2n\leq m$, closed manifolds $M^{m}$ with finite nonzero $\varphi(M^{m},S^{n}$), where $\varphi(M,N)$ denotes the minimum number of critical points of a smooth map $M\to N$. We also give some explicit…

Geometric Topology · Mathematics 2019-01-25 Louis Funar , Cornel Pintea

In a 3-manifold M, let K be a knot and R be an annulus which meets K transversely. We define the notion of the pair (R,K) being caught by a surface Q in the exterior of the link given by K and the boundary curves of R. For a caught pair…

Geometric Topology · Mathematics 2016-03-09 Ken Baker , Cameron Gordon , John Luecke

In this paper, we extend the concept of {\it (strongly) keenness} for Heegaard splittings to bridge splittings, and show that, for any integers $g$, $b$ and $n$ with $g\ge 0$, $b\ge 1$, $n\ge 1$ except for $(g,b)=(0,1)$ and…

Geometric Topology · Mathematics 2024-01-19 Ayako Ido , Yeonhee Jang , Tsuyoshi Kobayashi

In this article, we prove that if $(M,g)$ is a genus $G$ orientable surface with a single boundary component $S^1$, and if $(D,g_0)$ is a disc such that interior points are connected by unique geodesics and $$d_{(D,g_0)}(x,y) \geq…

Differential Geometry · Mathematics 2022-02-04 Gregory R. Chambers

Holomorphic principal G-bundles over a complex manifold M can be studied using non-abelian cohomology groups H^1(M,G). On the other hand, if M=\Sigma is a closed Riemann surface, there is a correspondence between holomorphic principal…

Differential Geometry · Mathematics 2007-08-27 Martin Laubinger

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

Geometric Topology · Mathematics 2011-04-25 Yuanyuan Bao

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…

Geometric Topology · Mathematics 2007-05-23 Mark E. Kidwell , Theodore B. Stanford

A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective…

Probability · Mathematics 2008-09-09 Bhupendra Gupta