DeepAI AI Chat
Log In Sign Up

The Shadows of a Cycle Cannot All Be Paths

by   Prosenjit Bose, et al.
Freie Universität Berlin
Carleton University

A "shadow" of a subset S of Euclidean space is an orthogonal projection of S into one of the coordinate hyperplanes. In this paper we show that it is not possible for all three shadows of a cycle (i.e., a simple closed curve) in R^3 to be paths (i.e., simple open curves). We also show two contrasting results: the three shadows of a path in R^3 can all be cycles (although not all convex) and, for every d≥ 1, there exists a d-sphere embedded in R^d+2 whose d+2 shadows have no holes (i.e., they deformation-retract onto a point).


page 1

page 2

page 3

page 4


On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...

Digraph Polynomials for Counting Cycles and Paths

Many polynomial invariants are defined on graphs for encoding the combin...

Alternating Hamiltonian cycles in 2-edge-colored multigraphs

A path (cycle) in a c-edge-colored multigraph is alternating if no two c...

A simple proof for visibility paths in simple polygons

The purpose of this note is to give a simple proof for a necessary and s...

Tangled Splines

Extracting shape information from object bound- aries is a well studied ...

On Virtual Network Embedding: Paths and Cycles

Network virtualization provides a promising solution to overcome the oss...

A Euclidean Algorithm for Binary Cycles with Minimal Variance

The problem is considered of arranging symbols around a cycle, in such a...