Related papers: Minimal generating sets of directed oriented Reide…

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.

The construction of the Leavitt path algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. The new algebras, $L_K(E,C)$, are…

In a graph $G$, a set $D\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number $\gamma_2(G)$ is the minimum cardinality of such a set $D$. We give a method for the…

We introduce topological parallelisms of oriented lines (briefly called oriented parallelisms). Every topological parallelism (of lines) on PG(3,R) gives rise to a parallelism of oriented lines, but we show that even the most homogeneous…

Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of $K_5$ and of $K_{3,3}$. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are…

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…

We investigate to what extent a minimal topological dynamical system is uniquely determined by a set of return times to some open set. We show that in many situations this is indeed the case as long as the closure of this open set has no…

Let $G$ be a connected reductive algebraic group over an algebraically closed field $k$ of characteristic $p > 0$ and let $\ell$ be a prime number different from $p$. Let $U \subseteq G$ be a maximal unipotent subgroup, $T$ a maximal torus…

Starting from three minimal off-shell 4D, $\cal N$ = 1 supermultiplets, using constructions solely defined within the confines of the four dimensional field theory we show the existence of a "gadget" - a member of a class of metrics on the…

Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…

We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all…

For any nonorientable closed surface, we determine the minimal dilatation among pseudo-Anosov mapping classes arising from Penner's construction. We deduce that the sequence of minimal Penner dilatations has exactly two accumulation points,…

A toric braid is a braid whose closure is a torus link in $\mathbb{R}^3$. Manturov generalized toric braids that is called quasitoric braids and showed that the subset of quasitoric braids in the classical braid group is a subgroup of the…

A conjecture by Lichiardopol states that for every $k \ge 1$ there exists an integer $g(k)$ such that every digraph of minimum out-degree at least $g(k)$ contains $k$ vertex-disjoint directed cycles of pairwise distinct lengths. Motivated…

A half a century ago, George Bergman introduced stunning machinery which would realise any commutative conical monoid as the non-stable $K$-theory of a ring. The ring constructed is ``minimal" or ``universal". Given the success of graded…

Let $N_g$ be the non-orientable surface with genus $g$, $\text{MCG}(N_g)$ be the mapping class group of $N_g$, $\mathcal{T}(N_g)$ be the index 2 subgroup generated by all Dehn twists of $\text{MCG}(N_g)$. We prove that for odd genus,…

We find geodesics, shortest arcs, cut loci, first conjugate loci, distances between arbitrary elements for some left-invariant sub-Riemannian metrics on the Lie groups $SU(2)\times\mathbb{R}$ and $SO(3)\times\mathbb{R}$.

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

Let $G$ be a group. A group is said to be $k$-generated if it can be generated by its $k$ elements. A generating set of $G$ is called a minimal generating set if no proper subset of it generates $G.$ A minimal generating set of a group can…

In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…