Search arXivSearch

arXiv · math/0301012

An Affine Linear Solution for the 2-Face Colorable Gauss Code Problem in the Klein Bottle and a Quadratic System for Arbitrary Closed Surfaces

Abstract

Let $\bar{P}$ be a sequence of length $2n$ in which each element of $\{1,2,...,n\}$ occurs twice. Let $P'$ be a closed curve in a closed surface $S$ having $n$ points of simple auto-intersections, inducing a 4-regular graph embedded in $S$ which is 2-face colorable. If the sequence of auto-intersections along $P'$ is given by $\bar{P}$, we say that is a {\em $P'$ 2-face colorable solution for the Gauss Code $\bar{P}$ on surface $S$} or a {\em lacet for $\bar{P}$ on $S$}. In this paper we present a necessary and sufficient condition yielding these solutions when $S$ is Klein bottle. The condition take the form of a system of $m$ linear equations in $2n$ variables over $\Z_2$, where $m \le n(n-1)/2$. Our solution generalize solutions for the projective plane and on the sphere. In a strong way, the Klein bottle is an extremal case admitting an affine linear solution: we show that the similar problem on the torus and on surfaces of higher connectivity are modelled by a quadratic system of equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sostenes Lins, Emerson Oliveira-Lima, Valdenberg Silva. 2003-06-08. An Affine Linear Solution for the 2-Face Colorable Gauss Code Problem in the Klein Bottle and a Quadratic System for Arbitrary Closed Surfaces. https://arxiv.org/abs/math/0301012

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO