English
Related papers

Related papers: Simple Euclidean arrangements with one (>=5)-gon

200 papers

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes…

Combinatorics · Mathematics 2022-10-06 Alan Frieze , Wesley Pegden

We investigate pairwise quasi-orthogonal subalgebras in $M_{p^{kn}}$ which are isomorphic to $M_{p^{k}}$ for $k \ge 1$, $n \ge 2$ and a prime number $p$ with $p \ge 3$. We prove there exist $p^{2kn}-1/p^{2k}-1$ such subalgebras and they…

Operator Algebras · Mathematics 2008-01-10 Hiromichi Ohno

An Euler tour in a hypergraph $H$ is a closed walk that traverses each edge of $H$ exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of $H$ exactly once. An $\ell$-covering $k$-hypergraph, for $2…

Combinatorics · Mathematics 2021-01-28 Mateja Šajna , Andrew Wagner

We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.

Metric Geometry · Mathematics 2012-03-14 J. Konarzewski , M. Żynel

We show that any n-vertex graph without even cycles of length at most 2k has at most 1/2(n^{1 + 1/k}) + O(n) edges, and polarity graphs of generalized polygons show that this is asymptotically tight when k = 2,3,5.

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Jacques Verstraete

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara

We give a simple argument showing that the number of edges in the intersection graph $G$ of a family of $n$ sets in the plane with a linear union-complexity is $O(\omega(G)n)$. In particular, we prove $\chi(G)\leq \text{col}(G)<…

Combinatorics · Mathematics 2014-10-21 Piotr Micek , Rom Pinchasi

We display the construction of a twisted superalgebra for the N=1 Euclidian supergravity on 4-manifolds with an almost complex structure. It acts on a representation of twisted supersymmetry made of forms with odd and even statistics and it…

High Energy Physics - Theory · Physics 2012-11-22 Laurent Baulieu , Marc Bellon , Valentin Reys

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.

Metric Geometry · Mathematics 2020-07-08 Atte Lohvansuu

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

Combinatorics · Mathematics 2007-05-23 Klavdija Kutnar , Dragan Marusic

Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…

Combinatorics · Mathematics 2021-07-12 Kinkar Ch. Das , Ali Ghalavand , Ali Reza Ashrafi

Constructions of regular heptagon and triskaidecagon by trisection of an angle are well known. An elegant construction of the heptagon by S. Adlaj shows a 3-fold symmetry related to a Galois group. Based on the latter construction, in this…

History and Overview · Mathematics 2025-07-18 Helmut Ruhland

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

Combinatorics · Mathematics 2022-07-29 Alvaro Carbonero

A simple graph G is said to be representable in a real vector space of dimension m if there is an embedding of the vertex set in the vector space such that the Euclidean distance between any two distinct vertices is one of only two distinct…

Combinatorics · Mathematics 2009-05-30 Aidan Roy

With the couplings between the eight gluons constrained by the structure constants of the su(3) algebra in QCD, one would expect that there should exist a special basis (or set of bases) for the algebra wherein, unlike in a Cartan-Weyl…

High Energy Physics - Phenomenology · Physics 2016-11-01 P. F. Harrison , R. Krishnan , W. G. Scott

Over any field $\mathbb K$, there is a bijection between regular spreads of the projective space ${\rm PG}(3,{\mathbb K})$ and $0$-secant lines of the Klein quadric in ${\rm PG}(5,{\mathbb K})$. Under this bijection, regular parallelisms of…

Algebraic Geometry · Mathematics 2024-02-02 Hans Havlicek , Rolf Riesinger

We study a novel five-dimensional, {\it N}=5 supergravity in the context of Lie superalgebra SU(5/2). The possible successive superalgebraic truncations from {\it N}=5 theory to the lower supersymmetric {\it N}=4,3,2, and 1 supergravity…

High Energy Physics - Theory · Physics 2007-05-23 Chang-Ho Kim , Young-Jai Park

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…

Computational Geometry · Computer Science 2008-01-28 Alex Benton , Joseph O'Rourke