Searcharxiv⌕ Search

arXiv · 2611.02229

Generalized Quasi-Symmetric Nets: A Constructive Approach to the Equimodular Elliptic Type and to Flexible $m \times n$ Nets

Abstract

Quadrilateral meshes that flex with rigid planar faces are of interest to transformable architecture, rigid-foldable origami, and mechanical metamaterials. Their building blocks are flexible $3 \times 3$ nets, that is, Kokotsakis polyhedra with a quadrangular base, classified by Izmestiev. We study one of his types, the equimodular elliptic type, defined by three conditions on the flat angles, the third of them through Jacobi elliptic functions. We turn these conditions into equivalent algebraic ones, free of elliptic functions, which lead to the generalized quasi-symmetric nets (GQS-nets), polyhedra of this type that include the known elliptic quasi-symmetric nets. For every polyhedron of this type, we give a flexible polyhedron with the same flat angles and its flexion in closed form. From the simplest GQS-nets, we assemble arbitrarily large flexible $m \times n$ nets. Examples include nets that, at one position, form letters; further nets in the supplementary materials form digits or, seen along their rows, approximately follow the side silhouettes of a bunny and a fish. Unlike numerically computed mechanisms, these nets are exactly flexible. As an application, we design three such nets as transportable arch halls of 80 mm sandwich panels, which fold to fit through the door of a standard container or into the well of a low-bed semi-trailer, and we check them numerically under snow load and build a 1:20 model of one. Supplementary Mathematica notebooks verify the symbolic computations, a Python tool constructs the nets and checks them numerically, including for self-intersections, and further scripts recheck the halls.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abdukhomid Nurmatov, Florian Rist, Jonathan Klein, Dominik L. Michels. 2026-11-01. Generalized Quasi-Symmetric Nets: A Constructive Approach to the Equimodular Elliptic Type and to Flexible $m \times n$ Nets. https://arxiv.org/abs/2611.02229

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

KEEP EXPLORING

Related papers

Many Antipodal Pairs Force Many Neighboring Pairs

Let $X=\{x_1,\dots,x_n\}\subset \mathbb{R}^2$ be a finite set of points of diameter at most $1$. It is natural to expect that if many pairs $(x_i,x_j)$ lie at distance close to $1$ from each other, then some clustering phenomenon must occur, implying that a significant number of these pairs are also very close to each other. %For $0<\varepsilon<1$, we call a pair $(x_i,x_j)$ $\varepsilon$-antipodal if $\|x_i-x_j\|\ge 1-\varepsilon$ and $\varepsilon$-neighboring if $\|x_i-x_j\|\le \varepsilon$. We prove that there exists a universal constant $c>0$ such that for all $0<\varepsilon<1$, whenever $n$ is large enough, we have: \[ \big|\{(i,j):\|x_i-x_j\|\le \varepsilon\}\big| \geq c\cdot \varepsilon^{1/2}\cdot \big|\{(i,j):\|x_i-x_j\|\geq 1-\varepsilon\}\big|. \] This confirms a recent conjecture of Steinerberger, who asked whether the $\varepsilon^{1/2}$ ratio is the best possible. We also study a two-parameter version of Steinerberger's question by considering the number of pairs at distance at most $\varepsilon_1$ and at distance at least $1-\varepsilon_2$. We show that in this case the optimal ratio is $\varepsilon_1^2\cdot\varepsilon_2^{-3/2}$ when $\varepsilon_1\leq\varepsilon_2$, and $\varepsilon_1^{1/2}$ otherwise. The proof proceeds by introducing an auxiliary graph associated with the set $X$ and reducing the problem to bounding the largest eigenvalue of its adjacency matrix. Our main result is the outcome of human--AI interactions using ChatGPT 5.4.

math.MG↗

Monge's transport problem in synthetic Lorentzian spacetimes

We prove the existence of solutions to the Lorentzian Monge problem on synthetic Lorentzian spacetimes that satisfy the forward timelike measure contraction property $TMCP^+(K,N)$. The cost for this problem is the time separation function $\ell(x,y)$ (the Lorentz distance), which represents the maximum amount a particle can age when traveling from $x$ to $y$. The solution is based on the needle decomposition technique, and amounts to a reduction of the full problem to its one-dimensional counterparts. As an application of needle decomposition, we introduce the blended $TMCP$ condition, and obtain a quantitative refinement of the synthetic Hawking singularity theorem. We additionally prove a timelike nonbranching reversibility theorem for $TCD_p(K,N)$ spacetimes, showing that forward $p$-essentially nonbranching spacetimes are backward $p$-essentially nonbranching.

math.MG↗

Metric foundations of geometry

A metric space is called all-set-homogeneous if every isometry between two of its subsets extends to an isometry of the whole space. We classify all-set-homogeneous length spaces: besides the classical examples, they include the universal metric trees of finite valence.

math.MG↗