Related papers: On left-orderability and cyclic branched coverings

Following the classification of genus one fibered knots in lens spaces by Baker, we determine hyperbolic genus one fibered knots in lens spaces on whose all integral Dehn surgeries yield closed 3-manifolds with left-orderable fundamental…

We combine harmonic analysis and operator algebraic techniques to give a concise argument that the left regular representation of a locally compact group is cyclic if and only if the group is first countable, a result first proved by…

We use grid diagrams to give a combinatorial algorithm for computing the knot Floer homology of the pullback of a knot K in its m-fold cyclic branched cover Sigma^m(K), and we give computations when m=2 for over fifty three-bridge knots…

The $L$-space conjecture asserts the equivalence, for prime 3-manifolds, of three properties: not being an $L$-space, having a left-orderable fundamental group, and admitting a co-oriented taut foliation. We investigate these properties for…

We define the property (D) for nontrivial knots. We show that the fundamental group of the manifold obtained by Dehn surgery on a knot $K$ with property (D) with slope $\frac{p}{q}\ge 2g(K)-1$ is not left orderable. By making full use of…

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

We consider the relationship between the crosscap number $\gamma$ of knots and a partial order on the set of all prime knots, which is defined as follows. For two knots $K$ and $J$, we say $K \geq J$ if there exists an epimorphism…

We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intriguing special case, we explore vertex-specific lower and upper…

We show that every two-bridge knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_3(t), y = T_b(t), z =C(t)$ where $T_k(t)$ are the Chebyshev polynomials and $b+\deg C = 3N$. If $C (t)= T_c(t)$ is a Chebyshev…

The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.

We study the order of automorphism groups of cyclic covering fibrations of a ruled surface. Arakawa and later Chen studied it for hyperelliptic fibrations and gave the upper bound. The purpose of present paper is to pursue the analog for…

We show that a knot has a non left-orderable surgery if the knot group admits a generalized Baumslag-Solitar relator and satisfies certain conditions on a longitude of the knot. As an application, it is shown that certain positively twisted…

List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k}. The problem is known to be NP-hard even for k=3 within…

We investigate when a Legendrian knot in standard contact $\mathbb{R}^3$ has a non-orientable exact Lagrangian filling. We prove analogs of several results in the orientable setting, develop new combinatorial obstructions to fillability,…

We give a non-left-orderability criterion for involutory quandles of non-split links. We use this criterion to show that the involutory quandle of any non-trivial alternating link is not left-orderable, thus improving Theorem 8.1. proven by…

Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the…

Motivated by recent work on majority edge-colourings of graphs, we initiate the study of the corresponding problem for hypergraphs. First, sharpening the probabilistic argument by a $KL$ large-deviation estimate, we obtain a sufficient…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph…

It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a linear ordering on their vertex set, and the…