English
Related papers

Related papers: Quadrilateral reptiles

200 papers

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

The fundamental geometry of self-similar sets becomes significantly more complex when the generating contractive maps include non-trivial rotational components. A well-known family exemplifying this complexity is that of the dragon curves…

Metric Geometry · Mathematics 2026-01-01 Fan Wen

Part I: The two-dimensional Pascal Triangle will be generalized into a three-dimensional Pascal Pyramid and four-, five- or whatsoever-dimensional hyper-pyramids. Part II: The Bilateral Binomial Theorem will be generalised into a Bilateral…

General Mathematics · Mathematics 2007-05-23 Martin Erik Horn

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Metric Geometry · Mathematics 2013-12-12 Yohji Akama , Yudai Sakano

The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…

Number Theory · Mathematics 2015-05-13 Nicolas Brody , Jordan Schettler

A d-dimensional simplex S is called a k-reptile if it can be tiled without overlaps by simplices S_1,S_2,...,S_k that are all congruent and similar to S. For d=2, k-reptile simplices (triangles) exist for many values of k and they have been…

Combinatorics · Mathematics 2010-06-10 Jiří Matoušek , Zuzana Safernová

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

Algebraic Geometry · Mathematics 2022-12-21 Jaeho Shin

One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their…

Geometric Topology · Mathematics 2014-07-24 Michael W. Davis

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…

Discrete Mathematics · Computer Science 2017-07-27 Nicolas Bonichon , Benjamin Lévêque

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Combinatorics · Mathematics 2010-02-14 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun , Richard Ehrenborg

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

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

Two triangles are called orthologic if the perpendiculars from the vertices of one of them to the sides of the other are concurrent. In this paper, we explore the concept of orthology from various points of view. Mostly we work in terms of…

Metric Geometry · Mathematics 2023-12-22 Egor Bakaev , Pavel Kozhevnikov

A $p$-caterpillar is a caterpillar such that every non-leaf vertex is adjacent to exactly $p$ leaves. We give a tight minimum degree condition for a graph to have a spanning $p$-caterpillar.

Combinatorics · Mathematics 2017-11-30 Andrzej Czygrinow , Jangwon Yie

In classical geometry, a linear space is a space that is closed under linear combinations. In tropical geometry, it has long been a consensus that tropical varieties defined by valuated matroids are the tropical analogue of linear spaces.…

Algebraic Geometry · Mathematics 2015-05-11 Simon Hampe

A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…

Metric Geometry · Mathematics 2025-10-06 Théophile Buffière , Lionel Pournin

Let P be a cyclic n-gon with n\ge3, the central angles \th_0,...,\th_{n-1} in (-\pi,\pi], and the winding number w:=(\th_0+...+\th_{n-1})/(2\pi). The vertices of P are assumed to be all distinct from one another. It is then proved that P is…

General Mathematics · Mathematics 2017-01-17 Iosif Pinelis

Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…

Computational Geometry · Computer Science 2018-12-17 Yeganeh Bahoo , Stephane Durocher , J. Mark Keil , Debajyoti Mondal , Saeed Mehrabi , Sahar Mehrpour
‹ Prev 1 4 5 6 7 8 10 Next ›