English
Related papers

Related papers: A Dehornoy-Type Ordering on Plat Presentation Clas…

200 papers

This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…

Geometric Topology · Mathematics 2024-05-10 Hanh Vo , Puttipong Pongtanapaisan , Thieu Nguyen

We show that all knots up to $6$ crossings can be represented by polynomial knots of degree at most $7$, among which except for $5_2, 5_2^*, 6_1, 6_1^*, 6_2, 6_2^*$ and $6_3$ all are in their minimal degree representation. We provide…

Geometric Topology · Mathematics 2021-01-05 Rama Mishra , Hitesh Raundal

We categorify the notion of an infinitesimal braiding in a linear strict symmetric monoidal category, leading to the notion of a (strict) infinitesimal 2-braiding in a linear symmetric strict monoidal 2-category. We describe the associated…

Category Theory · Mathematics 2017-05-23 Lucio S. Cirio , João Faria Martins

We study a Lie algebra $\mathcal A_{a_1,\ldots,a_{n-1}}$ of deformed skew-symmetric $n \times n$ matrices endowed with a Lie bracket given by a choice of deformed symmetric matrix. The deformations are parametrized by a sequence of real…

Mathematical Physics · Physics 2015-06-23 Alina Dobrogowska , Tomasz Goliński

We study the equivariant concordance classes of two-bridge knots, providing an easy formula to compute their butterfly polynomial, and we give two different proofs that no two-bridge knot is equivariantly slice. Finally, we introduce a new…

Geometric Topology · Mathematics 2025-05-21 Alessio Di Prisa , Giovanni Framba

We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and $3$-connected (i.e. $3$-polytopal). They are all of the form \[H\wedge K_2,\] where $H$ is a $2$-connected graph, possibly non-planar, and…

Combinatorics · Mathematics 2024-02-05 Riccardo W. Maffucci

We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be…

Computational Geometry · Computer Science 2021-05-11 Boris Klemz , Günter Rote

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Combinatorics · Mathematics 2011-08-12 Stefko Miklavic , Paul Terwilliger

The paper studies the minimum polynomial degrees of $p$-elements in cross-characteristic representations of simple groups of exceptional Lie type whose BN-pair rank is at most 2. Specifically, we prove that the degree in question equals the…

Representation Theory · Mathematics 2021-06-08 Pham Huu Tiep , A. E. Zalesski

We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…

Group Theory · Mathematics 2024-06-25 Jason Behrstock , Mark Hagen , Alexandre Martin , Alessandro Sisto

We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions.…

Geometric Topology · Mathematics 2007-05-23 Michele Mulazzani , Andrei Vesnin

Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…

Computational Complexity · Computer Science 2026-01-09 Gábor Kun , Jaroslav Nešetřil

Every nontrivial action of the braid group $B_n$ on $\mathbb{R}$ by orientation-preserving homeomorphisms yields, up to conjugation by a homeomorphism of $\mathbb{R}$, a representation $\rho : B_n \rightarrow…

Geometric Topology · Mathematics 2023-12-19 Idrissa Ba , Adam Clay , Tyrone Ghaswala

All of 320 layer groups, distributed into 80 clusters - single/double ordinary/gray groups - are used to complete systematization of linear (in all directions) band crossings and corresponding effective Hamiltonians in high-symmetry…

Materials Science · Physics 2022-08-24 Nataša Lazić , Vladimir Damljanović , Milan Damnjanović

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…

Dynamical Systems · Mathematics 2007-05-23 Abdelouahab Arouche

We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…

In this paper we show that all 3-manifolds of a family introduced by M. J. Dunwoody are cyclic coverings of lens spaces (eventually $\bf S^3$), branched over genus one 1-bridge knots. As a consequence, we give a positive answer to the…

Geometric Topology · Mathematics 2007-05-23 Luigi Grasselli , Michele Mulazzani

Let K be a knot in the 3-sphere with 2-fold branched covering space M. If for some prime p congruent to 3 mod 4 the p-torsion in the first homology of M is cyclic with odd exponent, then K is of infinite order in the knot concordance group.…

Geometric Topology · Mathematics 2007-07-24 Charles Livingston , Swatee Naik

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

Group Theory · Mathematics 2021-06-17 Amit Sehgal , Manjeet , Dalip Singh

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo