English
Related papers

Related papers: A sharp signature bound for positive four-braids

200 papers

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given…

Geometric Topology · Mathematics 2018-06-28 Adam Giambrone

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

Combinatorics · Mathematics 2020-06-05 C. Dalfó , M. A. Fiol , N. López , J. Ryan

The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…

Combinatorics · Mathematics 2021-11-18 Zsolt Bartha , Júlia Komjáthy , Järvi Raes

A knot $K_1$ is said to be Gordian adjacent to a knot $K_2$ if $K_1$ is an intermediate knot on an unknotting sequence of $K_2$. We extend previous results on Gordian adjacency by showing sufficient conditions for Gordian adjacency between…

Geometric Topology · Mathematics 2021-01-12 Tolson H. Bell , David C. Luo , Luke Seaton , Samuel P. Serra

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

Combinatorics · Mathematics 2015-07-28 Lihua You , Yujie Shu , Pingzhi Yuan

It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the…

Geometric Topology · Mathematics 2010-03-15 Francesco Costantino , Dylan P. Thurston

The crossing matrix of a braid on $N$ strands is the $N\times N$ integer matrix with zero diagonal whose $i,j$ entry is the algebraic number (positive minus negative) of crossings by strand $i$ over strand $j$ . When restricted to the…

Geometric Topology · Mathematics 2018-06-01 Mauricio Gutierrez , Zbigniew Nitecki

For a given knot, we study the minimal number of positive eigenvalues of the double branched cover over spanning surfaces for the knot. The value gives a lower bound for various genera, the dealternating number and the alternation number of…

Geometric Topology · Mathematics 2019-10-07 Kouki Sato

An "edge guard set" of a plane graph $G$ is a subset $\Gamma$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $\Gamma$. Such a set is said to guard $G$. We improve the known upper bounds on the number of…

Computational Geometry · Computer Science 2018-04-20 Ahmad Biniaz , Prosenjit Bose , Aurélien Ooms , Sander Verdonschot

A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of balanced spanning trees in the random geometric graph…

Combinatorics · Mathematics 2023-03-28 Alberto Espuny Díaz , Lyuben Lichev , Dieter Mitsche , Alexandra Wesolek

We study face numbers of simplicial complexes that triangulate manifolds (or even normal pseudomanifolds) with boundary. Specifically, we establish a sharp lower bound on the number of interior edges of a simplicial normal pseudomanifold…

Combinatorics · Mathematics 2016-04-18 Satoshi Murai , Isabella Novik

To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…

Geometric Topology · Mathematics 2008-08-21 T. Fiedler , V. Kurlin

The signature of a surface bundle over a surface is known to be divisible by 4. It is also known that the signature vanishes if the fiber genus is less than or equal to 2 or the base genus is less than or equal to 1. In this article, we…

Geometric Topology · Mathematics 2016-06-07 Ju A Lee

We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…

Combinatorics · Mathematics 2014-05-29 Dmitri Karpov

We give a simple unified proof for several disparate bounds on Thurston-Bennequin number for Legendrian knots and self-linking number for transverse knots in R^3, and provide a template for possible future bounds. As an application, we give…

Geometric Topology · Mathematics 2008-10-03 Lenhard Ng

We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…

Combinatorics · Mathematics 2024-10-04 Timothy Sun

We prove that the signature of an even, symmetric form on a finite rank integral lattice, has signature divisible by 8, provided its associated linking form vanishes in the Witt group of linking forms. Our result generalizes the well know…

Geometric Topology · Mathematics 2012-04-26 Stanislav Jabuka

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We define the Analytical signature, the Hodge signature and the de Rham signature for a foliated manifold with boundary with foliation transverse to the boundary. We show that all these signatures coincide and a Hirzebruch formula is valid.

Differential Geometry · Mathematics 2009-12-11 Paolo Antonini

In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…

Information Theory · Computer Science 2021-08-24 Zhao Hu , Nian Li , Xiangyong Zeng , Lisha Wang , Xiaohu Tang