English
Related papers

Related papers: Cyclic pseudo-{L}oupekine snarks

200 papers

We discuss an omission in the statement and proof of Fiorini's 1983 theorem on hypohamiltonian snarks and present a version of this theorem which is more general in several ways. Using Fiorini's erroneous result, Steffen showed that…

Combinatorics · Mathematics 2016-08-26 Jan Goedgebeur , Carol T. Zamfirescu

A fake octagon is a genus two translation surface with only one singular point and the same periods as the octagon. Existence of infinitely many fakes was first established by McMullen in 2007, and more generally follows from dynamical…

Dynamical Systems · Mathematics 2021-10-05 Davide Dobrilla , Stefano Francaviglia

Polyhedra are generically rigid, but can be made to flex under certain symmetry conditions. We generalise Raoul Bricard's 1897 method for making flexible octahedra to construct an infinite family of flexible polyhedra with…

Metric Geometry · Mathematics 2025-10-08 Elvar Atlason , Simon Guest

We construct several infinite families of nonnegatively curved manifolds of low cohomogeneity and small dimension which can be distinguished by their cohomology rings. In particular, we exhibit an infinite family of eight-dimensional…

Differential Geometry · Mathematics 2016-02-15 Anand Dessai

We give a construction of quandle cocycles from group cocycles, especially, for any integer p \geq 3, quandle cocycles of the dihedral quandle R_p from group cocycles of the cyclic group Z/p. We will show that a group 3-cocycle of Z/p gives…

Geometric Topology · Mathematics 2012-04-24 Yuichi Kabaya

We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not…

Metric Geometry · Mathematics 2007-05-23 Andreas Paffenholz , Günter M. Ziegler

We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov's…

Combinatorics · Mathematics 2011-10-07 Tao Feng , Fan Wu , Qing Xiang

We classify all finite group actions on knots in the 3-sphere. By geometrization, all such actions are conjugate to actions by isometries, and so we may use orthogonal representation theory to describe three cyclic and seven dihedral…

Geometric Topology · Mathematics 2026-03-27 Keegan Boyle , Nicholas Rouse , Ben Williams

We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N(k)$ such that any 3-connected cubic graph with at least $N(k)$ vertices contains a cycle of length $m$ modulo $k$. We also construct a…

Combinatorics · Mathematics 2021-02-02 Kasper S. Lyngsie , Martin Merker

We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…

Commutative Algebra · Mathematics 2019-01-04 Francesco Strazzanti , Kei-ichi Watanabe

We construct $\sorth{p} \times \sorth{q}$-invariant special Lagrangian (SL) cones in $\C^{p+q}$. These SL cones are natural higher-dimensional analogues of the $\sorth{2}$-invariant SL cones constructed previously by MH and used in our…

Differential Geometry · Mathematics 2010-05-11 Mark Haskins , Nikolaos Kapouleas

In this paper, we consider the lengths of cycles that can be embedded on the edges of the generalized pancake graphs which are the Cayley graph of the generalized symmetric group $S(m,n)$, generated by prefix reversals. The generalized…

Discrete Mathematics · Computer Science 2023-07-13 Saúl A. Blanco , Charles Buehrle

We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…

Representation Theory · Mathematics 2014-10-09 Rowena Paget , Mark Wildon

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

A construction described by the current author (2017) uses two linear prototypes to build a compound graph with Ramsey properties inherited from the prototype graphs. The resulting graph is linear; and cyclic if both prototypes are cyclic.…

Combinatorics · Mathematics 2020-08-14 Fred Rowley

We give an explicit construction of vertex-transitive tight triangulations of $d$-manifolds for $d\geq 2$. More explicitly, for each $d\geq 2$, we construct two $(d^2+5d+5)$-vertex neighborly triangulated $d$-manifolds whose vertex-links…

Geometric Topology · Mathematics 2013-06-17 Basudeb Datta , Nitin Singh

Shanks's sequence of quadratic fields $\Q(\sqrt{S_{n}})$ where $S_{n}=(2^n+1)^2 + 2^{n+2}$ instances a class of quadratic fields for which the class number is large and, therefore, the continued fraction period is relatively short. Indeed,…

Number Theory · Mathematics 2007-05-23 Roger Patterson

Let $G$ be a cubic graph which has a decomposition into a spanning tree $T$ and a $2$-regular subgraph $C$, i.e. $E(T) \cup E(C) = E(G)$ and $E(T) \cap E(C) = \emptyset$. We provide an answer to the following question: which lengths can the…

Combinatorics · Mathematics 2018-10-09 Arthur Hoffmann-Ostenhof , Thomas Jatschka

In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences,…

Combinatorics · Mathematics 2014-04-03 Nabil Shalaby , Bradley Sheppard , Daniela Silvesan

Using small cancellation for rotating families of groups, we construct new examples of aspherical polyhedra.

Group Theory · Mathematics 2013-02-28 Rémi Coulon