Related papers: Minimal generating sets of Reidemeister moves
A group in which every element commutes with its endomorphic images is called an $E$-group. If $p$ is a prime number, a $p$-group $G$ which is an $E$-group is called a $pE$-group. Every abelian group is obviously an $E$-group. We prove that…
In 2001, \"Ostlund formulated the question: are Reidemeister moves of types 1 and 3 sufficient to describe a homotopy from any generic immersion of a circle in a two-dimensional plane to an embedding of the circle? The positive answer to…
We investigate closure operators and describe their properties for $E$-combinations and $P$-combinations of structures and their theories. We prove, for $E$-combinations, that the existence of a minimal generating set of theories is…
A group in which every element commutes with its endomorphic images is called an $E$-group. Our main result is that all 3-generator $E$-groups are abelian. It follows that the minimal number of generators of a finitely generated non-abelian…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
In this paper we study the Reidemeister spectrum of 2-step nilpotent groups associated to graphs. We develop three methods, based on the structure of the graph, that can be used to determine the Reidemeister spectrum of the associated group…
In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. In the context of moving autonomous agent formations,…
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…
We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs. The contractions exploit 2-out edge sampling from each vertex rather than the standard uniform edge sampling. We…
In this article we determine a generating set of rational invariants of minimal cardinality for the action of the orthogonal group $\mathrm{O}_3$ on the space $\mathbb{R}[x,y,z]_{2d}$ of ternary forms of even degree $2d$. The construction…
For the minimal O(N) sigma model, which is defined to be generated by the O(N) scalar auxiliary field alone, all n-point functions, till order 1/N included, can be expressed by elementary functions without logarithms. Consequently, the…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
Let $f$ be an $R$-closed homeomorphism on a connected orientable closed surface $M$. In this paper, we show that If $M$ has genus more than one, then each minimal set is either a periodic orbit or an extension of a Cantor set. If $M =…
We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their…
To push a vertex $v$ of a directed graph $\overrightarrow{G}$ is to change the orientations of all the arcs incident with $v$. An oriented graph is a directed graph without any cycle of length at most 2. An oriented clique is an oriented…
We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex
We prove constructively that the maximum possible number of minimal connected dominating sets in a connected undirected graph of order $n$ is in $\Omega(1.489^n)$. This improves the previously known lower bound of $\Omega(1.4422^n)$ and…
An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum of some of the triples that gives weight zero to each 2-set.…
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…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…