Related papers: Construction of Permutation Snarks

Let $G$ be a simple cubic 2-connected plane graph. For every $2$-factor $X$ of $G$ having $n$-components there exists a simple hamiltonian plane graph $J \subset G^{2}$ such that $|E(J)|= |E(G)| + 2n -2$ and $\Delta(J) \leqslant 5$.

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

For every integer g, we construct a 2-solvable and 2-bipolar knot whose topological 4-genus is greater than g. Note that 2-solvable knots are in particular algebraically slice and have vanishing Casson-Gordon obstructions. Similarly all…

We study and compare two factorisation systems for surjective homomorphisms in the category of quandles. The first one is induced by the adjunction between quandles and trivial quandles, and a precise description of the two classes of…

We give two combinatorial proofs of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number…

For every genus $g\geq 2$, we construct an infinite family of strongly quasipositive fibred knots having the same Seifert form as the torus knot $T(2,2g+1)$. In particular, their signatures and four-genera are maximal and their homological…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

We characterise the primitive 2-closed groups $G$ of rank at most four that are not the automorphism group of a graph or digraph and show that if the degree is at least 2402 then there are just two infinite families or $G\leqslant…

Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole $M$ has dangling edges with one free end, which we call semiedges. Then, every 3-edge-coloring of a multipole induces a coloring…

The structure of a Standard Model family is derived in a class of brane models with a U(M) x U(N) factor, from two mildly anthropic requirements: a massless photon and a universe that does not turn into a plasma of massless charged…

We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…

Let $\mathfrak F$ be a class of groups. A group $G$ is called $ca$-$\mathfrak F$-group if its every non-abelian chief factor is simple and $H/K \leftthreetimes C_G(H/K) \in \mathfrak F$ for every abelian chief factor $H/K$ of $G$. In this…

We give two different proofs of the existence of the $AH+2$ subfactor, which is a $3$-supertransitive self-dual subfactor with index $\frac{9+\sqrt{17}}{2} $. The first proof is a direct construction using connections on graphs and…

A pretzel knot $K$ is called $odd$ if all its twist parameters are odd, and $mutant$ $ribbon$ if it is mutant to a simple ribbon knot. We prove that the family of odd, 5-stranded pretzel knots satisfies a weaker version of the Slice-Ribbon…

Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In…

Recent studies indicate that the weakly coupled spin-1/2 Heisenberg antiferromagnet with next nearest neighbor frustration supports massive spinons when suitably tuned. The straightforward SU(N) generalization of the low energy ladder…

The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…

We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator…

String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which intersects an occurrence of every factor. While one-sided infinite words admitting a finite string attractor…

A multiple group rack is a rack which is a disjoint union of groups equipped with a binary operation satisfying some conditions. It is used to define invariants of spatial surfaces, i.e., oriented compact surfaces with boundaries embedded…