English
Related papers

Related papers: The geometry of quadrangular convex pyramids

200 papers

Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to…

Combinatorics · Mathematics 2019-12-03 Karim Adiprasito , Eran Nevo

In this note we establish the existence of a new type of rigidity of symplectic embeddings coming from obligatory intersections with symplectic planes. More precisely, we prove that if a Euclidean ball is symplectically embedded in the…

Symplectic Geometry · Mathematics 2025-10-10 Pazit Haim-Kislev , Richard Hind , Yaron Ostrover

We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an operation that matches the isolated vertex and,…

Computational Complexity · Computer Science 2026-02-11 Joseph Dorfer

Given an Archimedean vector lattice $E$, we present one elementary property of $E$ which is equivalent to the entire traditional list of axioms which makes $E$ a $\Phi$-algebra. We call a vector lattice with this property ``square closed".…

Functional Analysis · Mathematics 2025-10-21 Christopher Schwanke

An ellipsoid is the image of a ball under an affine transformation. If this affine transformation is over the complex numbers, we refer to it as a complex ellipsoid. Characterizations of real ellipsoids have received much attention over the…

Metric Geometry · Mathematics 2022-12-12 Jorge Luis Arocha , Javier Bracho , Luis Montejano

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

Computational Geometry · Computer Science 2021-08-17 Sarah Carmesin , André Schulz

An oriented compact closed manifold is called inflexible if the set of mapping degrees ranging over all continuous self-maps is finite. Inflexible manifolds have become of importance in the theory of functorial semi-norms on homology.…

Algebraic Topology · Mathematics 2011-09-06 Manuel Amann

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with any irrational angle in degree: they are three $1$-parameter families of pentagonal subdivisions of the Platonic solids, with…

Combinatorics · Mathematics 2024-12-12 Junjie Shu , Yixi Liao , Erxiao Wang

This paper presents a systematic study of the structure of non-solvable cyclic metric Lie algebras. A cyclic metric is a symmetric bilinear form satisfying a cyclic cocycle condition, which arises naturally in the contexts of…

Differential Geometry · Mathematics 2025-09-19 An Huihui , Tan Ju , Yan Zaili

We call a finite-dimensional complex Lie algebra $\mathfrak{g}$ strongly rigid if its universal enveloping algebra $\Ug$ is rigid as an associative algebra, i.e. every formal associative deformation is equivalent to the trivial deformation.…

Rings and Algebras · Mathematics 2007-05-23 M. Bordemann , A. Makhlouf , T. Petit

A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by…

Metric Geometry · Mathematics 2010-11-23 Kiril Ratmanski

Let $\Lambda$ be a finite abelian group. A dynamical system with transformation group $\Lambda$ is a triple $(A,\Lambda,\alpha)$, consisting of a unital locally convex algebra $A$, the finite abelian group $\Lambda$ and a group homomorphism…

Differential Geometry · Mathematics 2025-12-24 Stefan Wagner

A \emph{generic rectangular layout} (for short, \emph{layout}) is a subdivision of an axis-aligned rectangle into axis-aligned rectangles, no four of which have a point in common. Such layouts are used in data visualization and in…

Computational Geometry · Computer Science 2024-05-22 Stefan Felsner , Andrew Nathenson , Csaba D. Tóth

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…

Computational Geometry · Computer Science 2014-10-24 Stylianos C. Despotakis , Ioannis Z. Emiris

A class of topological spaces is topologically rigid if any two spaces with the same fundamental group are also homeomorphic. Topological rigidity, in addition to its intrinsic interest, has been useful for solving abstract commensurability…

Geometric Topology · Mathematics 2023-09-21 Yandi Wu

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…

Geometric Topology · Mathematics 2013-06-18 Tianqi Wu , Xianfeng Gu , Jian Sun

Let B be a thick spherical building equipped with its natural CAT(1) metric and let M be a proper, convex subset of B. If M is open or if M is a closed ball of radius pi/2, then the maximal subcomplex supported by the complement of M is…

Geometric Topology · Mathematics 2016-01-20 Bernd Schulz

The purpose of the present paper is to show few examples of nonlinear PDEs (mostly with strong geometric features) for which there is a hidden convex structure. This is not only a matter of curiosity. Once the convex structure is…

Analysis of PDEs · Mathematics 2009-02-17 Yann Brenier

We show that learning a convex body in $\RR^d$, given random samples from the body, requires $2^{\Omega(\sqrt{d/\eps})}$ samples. By learning a convex body we mean finding a set having at most $\eps$ relative symmetric difference with the…

Machine Learning · Computer Science 2009-04-09 Navin Goyal , Luis Rademacher
‹ Prev 1 3 4 5 6 7 10 Next ›