English
Related papers

Related papers: Topology of geometric joins

200 papers

We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…

Operator Algebras · Mathematics 2010-04-06 Kenneth R. Davidson , Jean Roydor

In some scientific fields, a scaling is able to modify the topology of an observed object. Our goal in the present work is to introduce a new formalism adapted to the mathematical representation of this kind of phenomenon. To this end, we…

Geometric Topology · Mathematics 2008-12-11 Guy Wallet

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

Combinatorics · Mathematics 2026-04-27 Sean Dewar , Georg Grasegger , Anthony Nixon , Zvi Rosen , William Sims , Meera Sitharam , David Urizar

Using a probabilistic method, we prove that $d(d+1)$-connected graphs are rigid in $\mathbb{R}^d$, a conjecture of Lov\'asz and Yemini. Then, using recent results on weakly globally linked pairs, we modify our argument to prove that…

Combinatorics · Mathematics 2023-12-05 Soma Villányi

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

Combinatorics · Mathematics 2022-12-06 Daniel W. Cranston , Jiaxi Nie , Jacques Verstraëte , Alexandra Wesolek

Suppose we have an embedding of a graph $\mathbf{G}$ created by subdividing the edges of a simpler graph $\mathbf{G'}$. The edges of $\mathbf{G}$ can be divided into subsets which join pairs of ``junction'' vertices in $\mathbf{G'}$. The…

Combinatorics · Mathematics 2024-09-30 Jason Cantarella , Henrik Schumacher , Clayton Shonkwiler

We say that two unitary or orthogonal representations of a finitely generated group $G$ are additive conjugates if they are intertwined by an additive map, which need not be continuous. We associate to each representation of $G$ a…

Group Theory · Mathematics 2021-02-16 Zachary Chase , Wade Hann-Caruthers , Omer Tamuz

Let H = (H,V) be a hypergraph with edge set H and vertex set V. Then hypergraph H is invertible iff there exists a permutation pi of V such that for all E belongs to H(edges) intersection of(pi(E) and E)=0. H is invertibility critical if H…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

Call a pure Hodge structure geometric if it is contained in the cohomology of a smooth complex projective variety. The main goal is to show that for any set of Hodge numbers (subject to the obvious constraints), there exists a geometric…

Algebraic Geometry · Mathematics 2014-12-05 Donu Arapura

Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…

Probability · Mathematics 2024-11-04 Holger Sambale , Christoph Thäle , Tara Trauthwein

It is shown that in dimension at least three a local diffeomorphism of Euclidean n-space into itself is injective provided that the pull-back of every plane is a Riemannian submanifold which is conformal to a plane. Using a similar…

Differential Geometry · Mathematics 2020-03-02 Frederico Xavier

Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. The upper bound of 7 is obtained using tilings of the…

Combinatorics · Mathematics 2016-03-28 James D. Currie , Roger B. Eggleton

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

Combinatorics · Mathematics 2016-01-08 Wei-Guo Chen , Zhi-Hong Chen , Mei Lu

We consider infinite conformal iterated function systems on $\mathbb{R}^d$. We study the geometric structure of the limit set of such systems. Suppose this limit set intersects some $l$-dimensional $C^1$-submanifold with positive Hausdorff…

Classical Analysis and ODEs · Mathematics 2017-01-31 Antti Käenmäki

The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to \R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d=1, and if q is a prime power, but not yet in general.) The…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn , Günter M. Ziegler

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

Combinatorics · Mathematics 2023-11-10 Leah Leiner , Steven Simon

When one considers the collection $\mathcal{H}(\mathbb{R}^n)$ of all compact subsets of $\mathbb{R}^n$ and equip it with a topology, many questions can be asked about the topological space one ends up with. This is an example of a…

General Topology · Mathematics 2022-01-19 Bryant Rosado Silva , Rodney Josué Biezuner

A family of graphs $\mathcal{F}$ is said to have the joint embedding property (JEP) if for every $G_1, G_2\in \mathcal{F}$, there is an $H\in \mathcal{F}$ that contains both $G_1$ and $G_2$ as induced subgraphs. If $\mathcal{F}$ is given by…

Combinatorics · Mathematics 2024-09-11 Daniel Carter

We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…

Combinatorics · Mathematics 2007-05-23 Alina Vdovina