相关论文: Construction of Permutation Snarks

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…

A 2-group is a "categorified" version of a group, in which the underlying set G has been replaced by a category and the multiplication map has been replaced by a functor. Various versions of this notion have already been explored; our goal…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

The CHY-integrand of bi-adjoint cubic scalar theory is a product of two PT-factors. This pair of PT-factors can be interpreted as defining a permutation. We introduce the cycle representation of permutation in this paper for the…

We construct numerous continuous families of irreducible subfactors of the hyperfinite II$_1$ factor, which are non-isomorphic, but have all the same standard invariant. In particular, we obtain 1-parameter families of irreducible,…

The ground state of the S=1/2 Heisenberg antiferomagnet on kagome can be viewed as a collection of fermionic spinons bound into small, heavy singlet pairs. Low-energy magnetic excitations in this system correspond to breaking the pairs into…

In this paper we derive the generating function of RNA structures with pseudoknots. We enumerate all $k$-noncrossing RNA pseudoknot structures categorized by their maximal sets of mutually intersecting arcs. In addition we enumerate…

Let $G$ denote a graph and $k\geq2$ be an integer. A $\{K_{1,1},K_{1,2},\ldots,K_{1,k},\mathcal{T}(2k+1)\}$-factor of $G$ is a spanning subgraph, whose every connected component is isomorphic to an element of…

A spanning subgraph of a graph G is called a [0,2]-factor of G, if for . is a union of some disjoint cycles, paths and isolate vertices, that span the graph G. It is easy to get a [0,2]-factor of G and there would be many of [0,2]-factors…

In a 1937 paper B.H. Neumann constructed an uncountable family of $2$-generated groups. We prove that all of his groups are permutation stable by analyzing the structure of their invariant random subgroups.

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series?…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

We give a new infinite family of group homomorphisms from the braid group B_k to the symmetric group S_{mk} for all k and m \geq 2. Most known permutation representations of braids are included in this family. We prove that the…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

We obtain some structural properties of a factorised group $G = AB$, given that the conjugacy class sizes of certain elements in $A\cup B$ are not divisible by $p^2$, for some prime $p$. The case when $G = AB$ is a mutually permutable…

Let $\mathfrak F$ be a formation and let $G$ be a group. A subgroup $H$ of $G$ is $\mathrm{K}\mathfrak F$-subnormal (submodular) in $G$ if there is a subgroup chain $H=H_0\le \ H_1 \le \ \ldots \le H_i \leq H_{i+1}\le \ldots \le \ H_n=G$…

Let $G$ be a finite group. Harada's conjecture II states that the ratio of the product of all the number of elements in conjugacy classes over that of all degrees of irreducible complex characters of $G$ is an integer. The ratio is called…