Related papers: Visibility Representations of Toroidal and Klein-b…
Recently Penskoi [J. Geom. Anal. 25 (2015), 2645-2666, arXiv:1308.1628] generalized the well known two-parametric family of Lawson tau-surfaces $\tau_{r,m}$ minimally immersed in spheres to a three-parametric family $T_{a,b,c}$ of tori and…
Bredon and Wood have given a complete answer to the embeddability question for nonorientable surfaces in lens spaces. They formulate their result in terms of a recursive formula that determines, for a given lens space, the minimal genus of…
Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a…
We show that Lawson's bipolar surface $\tilde\tau_{3,1}$ is after stereographic projection the unique minimizer among immersed Klein bottles in its conformal class. We conjecture that it actually is the unique minimizer among immersed Klein…
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold.…
We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…
Gotay showed that a representation of the whole Poisson algebra of the torus given by geometric quantization is irreducible with respect to the most natural overcomplete set of observables. We study this representation and argue that it…
In this article we emphasize on the connection between two fields of study that are Penny Graphs, and the Optimal Packing of Spheres on the Flat Torus. We give a brief litterature overview on related results in the fields of planar graphs,…
For each surface besides the sphere, projective plane, and Klein bottle, we construct a face-simple minimal quadrangulation, i.e., a simple quadrangulation on the fewest number of vertices possible, whose dual is also a simple graph. Our…
A 4-regular planar graph $G$ is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to the vertices of $G$, and the circular arcs between those…
We show that under a lower Ricci curvature bound and an upper diameter bound, a torus admits a finite-sheeted covering space with volume bounded from below and diameter bounded from above. This partially recovers a result of Kloeckner and…
We study a minimal partition problem on the flat rectangular torus. We give a partial review of the existing literature, and present some numerical and theoretical work recently published elsewhere by V. Bonnaillie-No{\"e}l and the author,…
Crystalline assemblages of identical sub-units packed together and elastically bent in the form of a torus have been found in the past ten years in a variety of systems of surprisingly different nature, such as viral capsids, self-assembled…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
Let $T$ be a torus of dimension $n>1$ and $M$ a compact $T-$manifold. $M$ is a GKM manifold if the set of zero dimensional orbits in the orbit space $M/T$ is zero dimensional and the set of one dimensional orbits in $M/T$ is one…
Contact representations of graphs have a long history. Most research has focused on problems in 2D, but 3D contact representations have also been investigated, mostly concerning fully-dimensional geometric objects such as spheres or cubes.…
Donald Davis initiated the study of an $n$-dimensional analogue of the Klein bottle. This generalized Klein bottle occurs as a moduli space of planar polygons for a certain choice of side lengths. In this paper, we show that the…
A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open…
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…
Through computer-assisted enumeration, we list minimal obstructions for 5-choosability of graphs on the torus with the following additional property: There exists a cyclic system of non-contractible triangles around the torus where the…