Related papers: Cyclic pseudo-{L}oupekine snarks
We present simple, geometric constructions for small regular graphs of girth 7 from the incidence graphs of some generalized quadrangles. We obtain infinite families of (q-1)-regular, q-regular and (q + 1)-regular graphs of girth 7, for q a…
In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)\in\{2\}\cup 4\N$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd,…
We demonstrate the construction of several families of flexible polyhedra by extending Bricard octahedra to form larger composite flexible polyhedra. These flexible polyhedra are of genus 0 and 1, have dihedral angles that are non-constant…
We investigate spectral properties of the Laplace operator on a class of non-compact Riemannian manifolds. For a given number $N$ we construct periodic (i.e. covering) manifolds such that the essential spectrum of the corresponding…
We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…
This is the fourth in a series of papers math.DG/0008021, math.DG/0008155, math.DG/0010036 constructing explicit examples of special Lagrangian submanifolds (SL m-folds) in C^m. A submanifold of C^m is ruled if it is fibred by a family of…
It is known that every compact Stein 4-manifolds can be embedded into a simply connected, minimal, closed, symplectic 4-manifold. By using this property, we discuss a new method of constructing corks. This method generates a large class of…
In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on $n$ vertices, any two distinct vertices are connected by a path of length $k$ for every $k \ge n/2$. In 1978 Thomassen constructed a (non-cubic and non-planar)…
In 1974 Orin Chein discovered a new family of Moufang loops which are now called Chein loops. Such a loop can be created from any group $W$ together with $\mathbb{Z}_2$ by a variation on a semi-direct product. We study these loops in the…
Summability methods for ultraholomorphic classes in sectors, defined in terms of a strongly regular sequence $\mathbb{M}=(M_p)_{p\in\mathbb{N}_0}$, have been put forward by A. Lastra, S. Malek and the second author [1], and their validity…
The $m$-trace of a knot is the $4$-manifold obtained from $\mathbf{B}^4$ by attaching a $2$-handle along the knot with $m$-framing. In 2015, Abe, Jong, Luecke and Osoinach introduced a technique to construct infinitely many knots with the…
Quandles with involutions that satisfy certain conditions, called good involutions, can be used to color non-orientable surface-knots. We use subgroups of signed permutation matrices to construct non-trivial good involutions on extensions…
A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with constructions of Thomassen in 1981. However, all the…
A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Gr\"unbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…
A minimal representation of the N = 8 extended worldline supersymmetry, known as the `ultra-multiplet', is closely related to a family of supermultiplets with the same, E(8) chromotopology. We catalogue their effective symmetries and find a…
Quarks and leptons, the fundamental building blocks of the subatomic world, manifest in three families - replicas with identical quantum numbers that differ only in their masses. After revisiting the key milestones that led to the discovery…
We find the Ramsey number of a cycle vs. a complete graph when the order of the cycle is at least 4 times as large as the order of the complete graph. This partially confirms a conjecture of Erd\H{o}s, Faudree, Rousseau, and Schelp made in…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…