English
Related papers

Related papers: Topology of geometric joins

200 papers

Given a group $G$, its lattice of subgroups $\mathcal{L}(G)$ can be viewed as a simplicial complex in a natural way. The inclusion of $1_G, G \in \mathcal{L}(G)$ implies that $\mathcal{L}(G)$ is contractible, and so we study the topology of…

Combinatorics · Mathematics 2021-04-27 Emilio Pierro

The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…

Metric Geometry · Mathematics 2018-11-06 Károly Bezdek , Márton Naszódi

Classically, the projective duality between joins of varieties and the intersections of varieties only holds in good cases. In this paper, we show that categorically, the duality between joins and intersections holds in the framework of…

Algebraic Geometry · Mathematics 2018-11-14 Qingyuan Jiang , Naichung Conan Leung

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

Optimization and Control · Mathematics 2025-01-29 Adrian S. Lewis , Adriana Nicolae , Tonghua Tian

The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…

Combinatorics · Mathematics 2022-02-14 Remie Janssen , Leonie van Steijn

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

Computational Geometry · Computer Science 2019-12-04 Seri Nishimoto , Takashi Horiyama , Tomohiro Tachi

If $X$ is a compact set, a {\it topological contraction} is a self-embedding $f$ such that the intersection of the successive images $f^k(X)$, $k>0$, consists of one point. In dimension 3, we prove that there are smooth topological…

Geometric Topology · Mathematics 2010-01-18 Viatcheslav Grines , François Laudenbach

In homotopy type theory we can define the join of maps as a binary operation on maps with a common co-domain. This operation is commutative, associative, and the unique map from the empty type into the common codomain is a neutral element.…

Category Theory · Mathematics 2017-01-27 Egbert Rijke

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

Metric Geometry · Mathematics 2015-06-23 Michael Gene Dobbins , Andreas Holmsen , Alfredo Hubard

We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…

Rings and Algebras · Mathematics 2010-05-19 Wolfgang Bertram , Michael Kinyon

We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…

Rings and Algebras · Mathematics 2010-05-31 Wolfgang Bertram , Michael Kinyon

We establish a geometric framework by transforming a graph $G$ into a $(d-1)$-dimensional CW complex $U^{d-1}(G)$. This construction is achieved by systematically attaching $i$-spheres ($2 \le i \le d-1$) to $G$ according to specific rules,…

Combinatorics · Mathematics 2026-03-13 Qiming Fang , Sihong Shao

Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…

Number Theory · Mathematics 2019-08-16 Stephanie Chan

We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…

History and Overview · Mathematics 2011-03-23 Mario Barra

Magnitude homology is an $\mathbf{R}^+$-graded homology theory of metric spaces that captures information on the complexity of geodesics. Here we address the question: when are two metric spaces magnitude homology equivalent, in the sense…

Metric Geometry · Mathematics 2026-02-25 Adrián Doña Mateo , Tom Leinster

We lay the foundations of convex hypersurface theory in contact topology, extending the work of Giroux in dimension three. Specifically, we prove that any closed hypersurface in a contact manifold can be $C^0$-approximated by a convex one.…

Symplectic Geometry · Mathematics 2026-04-30 Joseph Breen , Austin Christian , Ko Honda , Yang Huang

Starting from the (apparently) elementary problem of deciding how many different topological spaces can be obtained by gluing together in pairs the faces of an octahedron, we will describe the central role played by hyperbolic geometry…

Geometric Topology · Mathematics 2011-01-18 Carlo Petronio , Damian Heard , Ekaterina Pervova

We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean $d$-space under additional dilation constraints in specified coordinate directions. In this setting we obtain a complete characterisation of generic rigidity.…

Combinatorics · Mathematics 2024-02-23 Sean Dewar , Anthony Nixon , Andrew Sainsbury

Let $M$ be a model set meeting two simple conditions: (1) the internal space $H$ is a product of $R^n$ and a finite group, and (2) the window $W$ is a finite union of disjoint polyhedra. Then any point pattern with finite local complexity…

Dynamical Systems · Mathematics 2018-07-10 Johannes Kellendonk , Lorenzo Sadun

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

Discrete Mathematics · Computer Science 2009-02-10 N. S. Narayanaswamy , N. Sadagopan , Apoorve Dubey
‹ Prev 1 3 4 5 6 7 10 Next ›