Related papers: The Shadows of a Cycle Cannot All Be Paths

We say that a topologically embedded 3-sphere in a smoothing of Euclidean 4-space is a barrier provided, roughly, no diffeomorphism of the 4-manifold moves the 3-sphere off itself. In this paper we construct infinitely many one parameter…

Haj\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new…

Let $Q_n$ denote the graph of the $n$-dimensional cube with vertex set $\{0,1\}^n$ in which two vertices are adjacent if they differ in exactly one coordinate. Suppose $G$ is a subgraph of $Q_n$ with average degree at least $d$. How long a…

Our purpose is to classify acyclic 4-manifolds having shadow complexity zero. In this paper, we focus on simple polyhedra and discuss this problem combinatorially. We consider a shadowed polyhedron $X$ and a simple polyhedron $X_0$ that is…

A reflexive cycle is any reflexive digraph whose underlying undirected graph is a cycle. Call a relational structure Slupecki if its surjective polymorphisms are all essentially unary. We prove that all reflexive cycles of girth at least 4…

A shadowed polyhedron is a simple polyhedron equipped with half integers on regions, called gleams, which represents a compact, oriented, smooth 4-manifold. The polyhedron is embedded in the 4-manifold and it is called a shadow of that…

We develop a connection between the inscribed square problem and the question of understanding relation avoiding paths in a complex vector space. Our main theorem is that a Jordan curve with no inscribed squares would have a seemingly…

A geodesic cycle is a closed curve that connects finitely many points along geodesics. We study geodesic cycles on the sphere in regard to their role in equal-weight quadrature rules and approximation.

A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three internally vertex-disjoint paths of length at least 2 between the same pair of distinct vertices. A wheel is a graph formed by a hole and a node…

The notion of constant cycle curves on K3 surfaces is introduced. These are curves that do not contribute to the Chow group of the ambient K3 surface. Rational curves are the most prominent examples. We show that constant cycle curves…

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…

It is known that cyclic arrangements are the only {\em unavoidable} simple arrangements of pseudolines: for each fixed $m\ge 1$, every sufficiently large simple arrangement of pseudolines has a cyclic subarrangement of size $m$. In the same…

A rack shadow is a set X with a rack action by a rack R, analogous to a vector space over a field. We use shadow colorings of classical link diagrams to define enhanced rack counting invariants and show that the enhanced invariants are…

A black hole casts a shadow as an optical appearance because of its strong gravitational field. We study the shadow cast by the five-dimensional Myers-Perry black hole with equal rotation parameters. We demonstrate that the null geodesic…

Turaev's shadow can be seen locally as the Stein factorization of a stable map. In this paper, we define the notion of stable map complexity for a compact orientable 3-manifold bounded by (possibly empty) tori counting, with some weights,…

In terms of Turaev's shadows, we provide a sufficient condition for a compact, smooth, acyclic 4-manifold with boundary the 3-sphere to be diffeomorphic to the standard 4-ball. As a consequence, we prove that if a compact, smooth, acyclic…

For each i = 1, ..., n constructions are given for convex bodies K and L in n-dimensional Euclidean space such that each rank i orthogonal projection of K can be translated inside the corresponding projection of L, even though K has…

A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…

A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…

We prove that a closed 4-manifold has shadow-complexity zero if and only if it is a kind of 4-dimensional graph manifold, which decomposes into some particular blocks along embedded copies of S^2 x S^1, plus some complex projective spaces.…