Related papers: Minimal generating sets of directed oriented Reide…
In this paper, we obtain the necessary and sufficient condition that two knot projections are related by a finite sequence of the first and second flat Reidemeister moves (Theorem 1). We also consider an equivalence relation that is called…
We describe various properties and give several characterizations of ternary groups satisfying two axioms derived from the third Reidemeister move in knot theory. Using special attributes of such ternary groups, such as semi-commutativity,…
Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister…
The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
We develop an algebraic underpinning of backtracking monad transformers in the general setting of monoidal categories. As our main technical device, we introduce Eilenberg--Moore monoids, which combine monoids with algebras for strong…
A $k$-ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank…
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.
We study the lift-and-project relaxations of the stable set polytope of graphs generated by $\text{LS}_+$, the SDP lift-and-project operator devised by Lov\'{a}sz and Schrijver. Our focus is on $\ell$-minimal graphs: graphs on $3\ell$…
We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.
We show that the twist subgroup $\mathcal{T}_g$ of a nonorientable surface of genus $g$ can be generated by two elements for every odd $g\geq27$ and even $g\geq42$. Using these generators, we can also show that $\mathcal{T}_g$ can be…
We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
We prove that every graph of minimum degree at least $d \ge 1$ contains a subdivision of some maximal 3-degenerate graph of order $d+1$. This generalizes the classic results of Dirac ($d=3$) and Pelik\'an ($d=4$). We conjecture that for any…
Roberts proved that a family of alternating, arborescent, prime knots each have at least $2^{2n-1}$ distinct minimal genus Seifert surfaces, where $n$ is the genus of the knot in question. We give a subfamily of these knots that have…
Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.
The recent proof by Bigelow and Krammer that the braid groups are linear opens the possibility of applications to the study of knots and links. It was proved by the first author and Menasco that any closed braid representative of the unknot…
The purpose of this article is to give, for any commutative ring A, an explicit minimal set of generators for the ring of multisymmetric functions TS^d_A(A[x_1,...,x_r]) as an A-algebra. In characteristic zero, i.e. when A is an algebra…
For $d \geq 2$, Walkup's class ${\cal K}(d)$ consists of the $d$-dimensional simplicial complexes all whose vertex-links are stacked $(d-1)$-spheres. Kalai showed that for $d \geq 4$, all connected members of ${\cal K}(d)$ are obtained from…
This paper studies the numbers of minimal generators of powers of monomial ideals in polynomial rings. For a monomial ideal $I$ in two variables, Eliahou, Herzog, and Saem gave a sharp lower bound $\mu (I^2)\ge 9$ for the number of minimal…