I understand that Schläfli symbols with integral elements $\{p,q\}$ both greater than or equal to $2$ represent planar graphs (multigraphs if $p$ is $2$), and these graphs, if finite, represent tilings of the sphere. However, $\{2,1\}$ and $\{1,2\}$ also represent spherical tilings - the monogonal hosohedron and dihedron respectively, despite containing $1$'s. I am wondering if there is a way to have planar graphs that would have Schläfli symbols of $\{1,n\}$ or $\{n,1\}$ for arbitrary integral $n > 0$?
2026-03-27 03:42:16.1774582936
Degenerate Schläfli symbols involving 1
55 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GEOMETRY
- Point in, on or out of a circle
- Find all the triangles $ABC$ for which the perpendicular line to AB halves a line segment
- How to see line bundle on $\mathbb P^1$ intuitively?
- An underdetermined system derived for rotated coordinate system
- Asymptotes of hyperbola
- Finding the range of product of two distances.
- Constrain coordinates of a point into a circle
- Position of point with respect to hyperbola
- Length of Shadow from a lamp?
- Show that the asymptotes of an hyperbola are its tangents at infinity points
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in PLANAR-GRAPHS
- max planarity and triangulation
- How to find a minimal planar covering of a graph
- Complete bipartite planar graphs
- Is graph Planar?
- Kuratowski's theorem on Planar graphs
- Graph Theory: Degree of regions in a planar graph
- On the Hex/Nash connection game theorem
- Graph Theory: There is only one planar graph with all vertices of degree 4 and 10 regions
- Intersection of circles and regions
- Which of these graphs is planar?
Related Questions in SPHERICAL-GEOMETRY
- Name of some projection of sphere onto $\mathbb{R}^2$
- Can you generalize the Triangle group to other polygons?
- motion on the surface of a 3-sphere
- What length would the sides of a triangle over Earth's surface be for the sum of its angles to be 180.1°
- why is the content of a n-sphere given by $\int_{0}^{R} S_nr^{n-1}dr = {S_nR^n \over n} $?
- Rotate a point according to a perpendicular point
- Rotate the surface of a sphere using altitude
- Is there a nice way to calculate $\int (1-x_3)^2$ over the hemisphere?
- Integrate the normal vector over a spherical polygon
- Spherical Geometry inequalities with triangles using main formula
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
A Schläfli symbol of $\{n,1\}$ would have to correspond to a graph in which every vertex has degree $1$. We know what all such graphs are: they only exist when $n$ is even, and they have $n$ vertices divided up into $n/2$ pairs, with an edge between the vertices in each pair.
This is certainly a planar graph, with a single face of length $n$; the boundary of the face has $n/2$ components. Whether you consider it to be a valid realization of the Schläfli symbol $\{n,1\}$ would depend on how strict you are with the definition. Every vertex is certainly incident to a face of length $n$, but it is only questionably a regular $n$-gon. It is even more questionably a regular $n$-gon when $n>2$.
As Schläfli symbol of $\{1,n\}$ means that each of our vertices should have $n$ faces around it, each of length $1$. This is, unquestionably, only possible on a sphere when $n=2$. A length-$1$ face is a face whose boundary is a loop in the graph. When $n=2$, a single loop does create two length-$1$ faces. However, when $n>2$, $n/2$ loops do not create $n$ length-$1$ faces; some of the faces merge together into a larger face. (Exactly how they merge depends on the embedding.)
You could, very tenuously, say that if we take a topological surface consisting of $n/2$ spheres that meet at a single point, then there is a tiling of this surface with Schläfli symbol $\{n,1\}$. Put down a single vertex where all the spheres meet, and draw a single loop in each of the spheres.