Related papers: Generating links that are both quasi-alternating a…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…
The distributive laws of ring theory are fundamental equalities in algebra. However, recently in the study of the Yang-Baxter equation, many algebraic structures with alternative "distributive" laws were defined. In an effort to study these…
An alternating distance is a link invariant that measures how far away a link is from alternating. We study several alternating distances and demonstrate that there exist families of links for which the difference between certain…
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…
Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
This paper is concerned with the characterizations of quasi self-adjoint extensions of a class of formally non-self-adjoint discrete Hamiltonian systems. Some properties of the solutions and the characterization of the minimal linear…
It is well-known that no knot can be cancelled in a connected sum with another knot, whereas every link can be cancelled up to link homotopy in a (componentwise) connected sum with another link. In this paper we address the question whether…
We prove that a quasi-isomorphism $f : A \to B$ between commutative DG rings, where $B$ admits a divided power structure, can be factored as $f = \tilde{f} \circ e$, where $e : A \to \tilde{B}$ is a split injective quasi-isomorphism, and…
We show that one can interweave an unknot into any non-alternating connected projection of a link so that the resulting augmented projection is alternating.
We study the flow extension of graphs, i.e., pre-assigning a partial flow on the edges incident to a given vertex and aiming to extend to the entire graph. This is closely related to Tutte's $3$-flow conjecture(1972) that every…
We study complementary information set codes of length $tn$ and dimension $n$ of order $t$ called ($t-$CIS code for short). Quasi-cyclic and quasi-twisted $t$-CIS codes are enumerated by using their concatenated structure. Asymptotic…
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic…
We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and…
We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that remove a single vertex. Moreover, we give a cubic time…
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
The Turaev genus of a link can be thought of as a way of measuring how non-alternating a link is. A link is Turaev genus zero if and only if it is alternating, and in this viewpoint, links with large Turaev genus are very non-alternating.…
Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…