English
Related papers

Related papers: Vertex-Minimal Paper Tori

200 papers

We give necessary and sufficient conditions for an orthogonal group defined over a field of characteristic not 2 to contain a maximal torus of a given type.

Number Theory · Mathematics 2013-05-16 Eva Bayer-Fluckiger

A graph is apex if it becomes planar after the deletion of one vertex. The family of apex graphs is closed under taking minors, so it is characterized by a finite set of forbidden minors. Determining the finite set of forbidden minors for…

Combinatorics · Mathematics 2026-04-07 Andrei Pavelescu , Elena Pavelescu , Madeline Potter

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to…

Computational Geometry · Computer Science 2010-03-19 Gaiane Panina , Ileana Streinu

Semi-Equivelar maps are generalizations of Archimedean solids to the surfaces other than 2-sphere. There are eight semi-equivelar maps of types $\{3^{3},4^{2}\}$, $\{3^{2},4,3,4\}$, $\{6,3,6,3\}$, $\{3^{4},6\}$, $\{4,8^{2}\}$,…

Combinatorics · Mathematics 2013-09-02 Dipendu Maity , Ashish Kumar Upadhyay

A symplectic toric orbifold is a compact connected orbifold $M$, a symplectic form $\omega$ on $M$, and an effective Hamiltonian action of a torus $T$ on $M$, where the dimension of $T$ is half the dimension of $M$. We prove that there is a…

dg-ga · Mathematics 2008-02-03 Eugene Lerman , Susan Tolman

We use microlocal sheaf theory to show that if two knots have Legendrian isotopic conormal tori, then the knots are isotopic or mirror images.

Geometric Topology · Mathematics 2021-02-02 Vivek Shende

Let $\TT$ be a torus. We prove that all subsets of $\TT$ with finitely many boundary components (none of them being points) embed properly into $\CC^2$.

Complex Variables · Mathematics 2007-05-23 Erlend Fornaess Wold

A word contains a \emph{half-flip} if it contains non-empty factors $uv$ and $vu$ where $|u|=|v|$. Fici reports a non-constructive proof of the existence of an infinite word over a finite alphabet avoiding half-flips and asks for the size…

Combinatorics · Mathematics 2026-05-20 Pascal Ochem

This work is a natural continuation of our previous work \cite{yz}. In this paper, we give a complete classification of toric surface codes of dimension less than or equal to 6, except a special pair, $C_{P_6^{(4)}}$ and $C_{P_6^{(5)}}$…

Information Theory · Computer Science 2015-08-11 Xue Luo , Stephen S. -T. Yau , Mingyi Zhang , Huaiqing Zuo

Twisted torus knots are torus knots with some full twists added along some number of adjacent strands. There are infinitely many known examples of twisted torus knots which are actually torus knots. We give eight more infinite families of…

Geometric Topology · Mathematics 2021-08-26 Sangyop Lee , Thiago de Paiva

We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…

Combinatorics · Mathematics 2025-11-14 Erica Flapan , Hugh Howards

A connected graph whose automorphism group acts transitively on the edges and vertices, but not on the set of ordered pairs of adjacent vertices of the graph is called half-arc-transitive. It is well known that the valence of a…

Combinatorics · Mathematics 2015-03-16 Primož Potočnik , Rok Požar

We prove the 2-torus $\mathbb T$, an abelian linear algebraic group, is a fine moduli space of labeled, oriented, possibly-degenerate inscribable similarity classes of triangles, where a triangle is {\it inscribable} if it can be inscribed…

Metric Geometry · Mathematics 2025-01-08 Eric Brussel , Madeleine E. Goertz

Maxwell introduced a necessary minimum number of edges in terms of the number of vertices required for a graph to yield a Euclidean rigid generic framework in $\mathbb{R}^3$, this count was generalised to $\mathbb{R}^d$, for all $d\geq 1$.…

Combinatorics · Mathematics 2023-06-27 Jack Southgate

A vertex $v$ in a map $M$ has the face-sequence $(p_1 ^{n_1}. \ldots. p_k^{n_k})$, if there are $n_i$ numbers of $p_i$-gons incident at $v$ in the given cyclic order, for $1 \leq i \leq k$. A map $M$ is called a semi-equivelar map if each…

Combinatorics · Mathematics 2022-02-08 Yogendra Singh , Anand Kumar Tiwari

The second author classified configurations of the singularities on tame sextics of torus type. In this paper, we give a complete classification of the singularities on irreducible sextics of torus type, without assuming the tameness of the…

Algebraic Geometry · Mathematics 2007-05-23 Mutsuo Oka , Duc Tai Pho

Let $\mathcal{K}$ be the space of properly embedded minimal tori in quotients of $\R^3$ by two independent translations, with any fixed (even) number of parallel ends. After an appropriate normalization, we prove that $\mathcal{K}$ is a…

Differential Geometry · Mathematics 2007-05-23 Joaquin Perez , M. Magdalena Rodriguez , Martin Traizet

A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…

Combinatorics · Mathematics 2017-09-22 Diego Nicodemos , Matěj Stehlík

A quasitoric manifold $M$ is a $2n$-dimensional manifold which admits an action of an $n$-dimensional torus which has some nice properties. We determine the isomorphism type of a maximal compact connected Lie-subgroup $G$ of…

Geometric Topology · Mathematics 2015-11-05 Michael Wiemeler

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

Combinatorics · Mathematics 2021-04-12 Simon Špacapan