English
Related papers

Related papers: Seifert matrices of Brunnian links

200 papers

Given two m x n matrices A = (a_{ij}) and B=(b_{ij}) with entries in B(H), the Schur block product is the m x n matrix A \square B := (a_{ij}b_{ij}). There exists an m x n contraction matrix S = (s_{ij}), such that A \square B =…

Operator Algebras · Mathematics 2019-11-11 Erik Christensen

It can be shown that any symmetric $(0,1)$-matrix $A$ with $\tr A = 0$ can be interpreted as the adjacency matrix of a simple, finite graph. The square of an adjacency matrix $A^2=(s_{ij})$ has the property that $s_{ij}$ represents the…

Combinatorics · Mathematics 2012-07-16 Dan Kranda

We provide sufficient conditions for a component of the Auslander-Reiten quiver of an artin algebra to be determined by the composition factors of its indecomposable modules.

Representation Theory · Mathematics 2012-08-21 Alicja Jaworska , Piotr Malicki , Andrzej Skowroński

For G a semisimple algebraic group, we revisit the description of the components of the affne Springer fiber given by ts, with s a regular semisimple element. We then compute the fixed points of each component of a particular affne Springer…

Algebraic Geometry · Mathematics 2019-10-17 Pablo Boixeda Alvarez

Let $L$ be an oriented link with an alternating diagram $D$. It is known that $L$ is a fibered link if and only if the surface $R$ obtained by applying Seifert's algorithm to $D$ is a Hopf plumbing. Here, we call $R$ a Hopf plumbing if $R$…

Geometric Topology · Mathematics 2007-05-23 Hiroshi Goda , Mikami Hirasawa , Ryosuke Yamamoto

In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for…

Spectral Theory · Mathematics 2022-05-03 Pralhad M. Shinde

In this paper, which is a follow-up to [A. Borobia, R. Canogar, F. De Ter\'an, Mediterr. J. Math. 18, 40 (2021)], we provide a necessary and sufficient condition for the matrix equation $X^\top AX=B$ to be consistent when $B$ is symmetric.…

Rings and Algebras · Mathematics 2022-09-07 Alberto Borobia , Roberto Canogar , Fernando De Terán

Let $K_n$ be a complete graph with $n$ vertices. An embedding of $K_n$ in $S^3$ is called a spatial $K_n$-graph. Knots in a spatial $K_n$-graph corresponding to simple cycles of $K_n$ are said to be constituent knots. We consider the case…

Geometric Topology · Mathematics 2024-10-31 Olga Oshmarina , Andrei Vesnin

Let $S_1$ and $S_2$ be two affine semigroups and let $S$ be the gluing of $S_1$ and $S_2$. Several invariants of $S$ are then related to those of $S_1$ and $S_2$; we review some of the most important properties preserved under gluings. The…

Commutative Algebra · Mathematics 2013-11-11 Abdallah Assi , Pedro A. García-Sánchez , Ignacio Ojeda

To a presentation of an oriented link as the closure of a braid we assign a complex of bigraded vector spaces. The Euler characteristic of this complex (and of its triply-graded cohomology groups) is the HOMFLYPT polynomial of the link. We…

Quantum Algebra · Mathematics 2014-11-11 Mikhail Khovanov , Lev Rozansky

A real symmetric matrix $A$ is copositive if $x^TAx\ge 0$ for every nonnegative vector $x$. A matrix is SPN if it is a sum of a real positive semidefinite matrix and a nonnegative one. Every SPN matrix is copositive, but the converse does…

Optimization and Control · Mathematics 2017-01-31 Naomi Shaked-Monderer

We give necessary conditions for a polynomial to be the Conway polynomial of a two-bridge link. As a consequence, we obtain simple proofs of the classical theorems of Murasugi and Hartley. We give a modulo 2 congruence for links, which…

Geometric Topology · Mathematics 2012-03-22 P. -V. Koseleff , D. Pecker

Let B be an n by n doubly substochastic matrix. We show that B can be written as a convex combination of no more than {\sigma}(B)+t subpermutation matrices, where {\sigma}(B) is the number of nonzero elements in B and t is the number of…

Combinatorics · Mathematics 2018-01-08 Lei Cao

We give necessary and sufficient conditions for Riemannian maps to be biharmonic. We also define pseudo umbilical Riemannian maps as a generalization of pseudo-umbilical submanifolds and show that such Riemannian maps put some restrictions…

Differential Geometry · Mathematics 2010-12-10 Bayram Sahin

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

Combinatorics · Mathematics 2017-11-29 Guidong Yu , Yi Fang , Yizheng Fan , Gaixiang Cai

This paper compares notions of double sliceness for links. The main result is to show that a large family of 2-component Montesinos links are not strongly doubly slice despite being weakly doubly slice and having doubly slice components.…

Geometric Topology · Mathematics 2021-01-12 Duncan McCoy , Clayton McDonald

Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…

Geometric Topology · Mathematics 2013-07-19 Dongseok Kim , Young Soo Kwon , Jaeun Lee

For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…

Geometric Topology · Mathematics 2022-10-21 Tetsuya Ito

Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon…

Geometric Topology · Mathematics 2013-11-18 Stephen Huggett , Iain Moffatt , Natalia Virdee

In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be…

Combinatorics · Mathematics 2016-10-25 Qiannan Zhou , Ligong Wang
‹ Prev 1 8 9 10 Next ›