Related papers: A note on uniquely embeddable 2-factors

A normal subgroup $E$ of a group $G$ is said to be hypercyclically embedded in $G$ if either $E=1$ or $E\neq 1$ and every chief factor of $G$ below $E$ is cyclic. In this article, we present some new characterizations of a normal subgroup…

We prove that any diffeomorphism of a compact manifold can be approximated in topology C1 by another diffeomorphism exhibiting a homoclinic bifurcation (a homoclinic tangency or a heterodimensional cycle) or by one which is essentially…

Let $D$ be a $k$-regular bipartite tournament on $n$ vertices. We show that, for every $p$ with $2 \le p \le n/2-2$, $D$ has a cycle $C$ of length $2p$ such that $D \setminus C$ is hamiltonian unless $D$ is isomorphic to the special digraph…

Let $A$ be a finite dimensional unital commutative associative algebra and let $B$ be a finite dimensional vertex $A$-algebroid such that its Levi factor is isomorphic to $sl_2$. Under suitable conditions, we construct an indecomposable…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

We present the notion of "cyclic double multicategory", as a structure in which to organise multivariable adjunctions and mates. The classic example of a 2-variable adjunction is the hom/tensor/cotensor trio of functors; we generalise this…

The uniform Hamilton-Waterloo Problem (HWP) asks for a resolvable $(C_M, C_N)$-decomposition of $K_v$ into $\alpha$ $C_M$-factors and $\beta$ $C_N$-factors. We denote a solution to the uniform Hamilton Hamilton-Waterloo problem by…

We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

We observe that many of the 2-complexes constructed by Freedman-Krushkal-Teichner in their paper on the incompleteness of the van Kampen embedding obstruction can actually be PL immersed in $\mathbb{R}^4$ in such a way that the images of…

We describe a way of representing finite biquandles with n elements as 2n x 2n block matrices. Any finite biquandle defines an invariant of virtual knots through counting homomorphisms. The counting invariants of non-quandle biquandles can…

The Hamilton-Waterloo Problem (HWP) in the case of $C_{m}$-factors and $C_{n}$-factors asks if $K_v$, where $v$ is odd (or $K_v-F$, where $F$ is a 1-factor and $v$ is even), can be decomposed into r copies of a 2-factor made either entirely…

A pair of biadjoint functors between two categories produces a collection of elements in the centers of these categories, one for each isotopy class of nested circles in the plane. If the centers are equipped with a trace map into the…

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are…

On smooth manifolds of dimension $n \ge 4$, we prove that the torsion and curvature are, up to a scalar factor, the only pair of a vector-valued 2-form and an endomorphism-valued 2-form naturally associated with a linear connection that…

A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every $k$ consecutive vertices from an edge. We show that for $k\geq 3$, every red-blue edge-coloured complete $k$-graph on $n$ vertices contains $k$…

We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or edge-disjoint, and the…