Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSpaces of embeddings: Nonsingular bilinear maps, chirality, and their generalizations
143
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Given a space X we study the topology of the space of embeddings of X into $mathbb{R}^d$ through the combinatorics of triangulations of X. We give a simple combinatorial formula for upper bounds for the largest dimension of a sphere that antipodally maps into the space of embeddings. This result summarizes and extends results about the nonembeddability of complexes into $mathbb{R}^d$, the nonexistence of nonsingular bilinear maps, and the study of embeddings into $mathbb{R}^d$ up to isotopy, such as the chirality of spatial graphs.
rate research
Read More
We study relations between maps between relatively hyperbolic groups/spaces and quasisymmetric embeddings between their boundaries. More specifically, we establish a correspondence between (not necessarily coarsely surjective) quasi-isometric embeddings between relatively hyperbolic groups/spaces that coarsely respect peripherals, and quasisymmetric embeddings between their boundaries satisfying suitable conditions. Further, we establish a similar correspondence regarding maps with at most polynomial distortion. We use this to characterise groups which are hyperbolic relative to some collection of virtually nilpotent subgroups as exactly those groups which admit an embedding into a truncated real hyperbolic space with at most polynomial distortion, generalising a result of Bonk and Schramm for hyperbolic groups.
Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded nets with small quotient graphs. We enumerate the 25 periodic isotopy classes of depth 1 embedded nets with a single vertex quotient graph. Additionally, we classify embeddings of n-fold copies of pcu with all connected components in a parallel orientation and n vertices in a repeat unit, and determine their maximal symmetry periodic isotopes. We also introduce the methodology of linear graph knots on the flat 3-torus [0, 1)^3. These graph knots, with linear edges, are spatial embeddings of the labelled quotient graphs of an embedded net which are associated with its periodicity bases.
In this paper, we investigate representations of links that are either centrally symmetric in $mathbb{R}^3$ or antipodally symmetric in $mathbb{S}^3$. By using the notions of antipodally self-dual and antipodally symmetric maps, introduced and studied by the authors, we are able to present sufficient combinatorial conditions for a link $L$ to admit such representations. The latter naturally arises sufficient conditions for $L$ to be amphichiral. We also introduce another (closely related) method yielding again to sufficient conditions for $L$ to be amphichiral. We finally prove that a link $L$, associated to a map $G$, is amphichiral if the self-dual pairing of $G$ is not one of 6 specific ones among the classification of the 24 self-dual pairing $Cor(G) rhd Aut(G)$.
We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s vertices. Let f be a simplicial map of the graph S to the plane. The map f is approximable by embeddings if and only if for each i=0,...,s the i-th derivative of the map f (defined by Minc) neither contains transversal self-intersections nor is the standard winding of degree greater than 1. We deduce from the Minc result the completeness of the van Kampen obstruction to approximability by embeddings of piecewise linear maps of a segment to the plane. We also generalize these criteria to simplicial maps of a graph without vertices of degree >3 to a circle.
We show that the size of codes in projective space controls structural results for zeros of odd maps from spheres to Euclidean space. In fact, this relation is given through the topology of the space of probability measures on the sphere whose supports have diameter bounded by some specific parameter. Our main result is a generalization of the Borsuk--Ulam theorem, and we derive four consequences of it: (i) We give a new proof of a result of Simonyi and Tardos on topological lower bounds for the circular chromatic number of a graph; (ii) we study generic embeddings of spheres into Euclidean space, and show that projective codes give quantitative bounds for a measure of genericity of sphere embeddings; and we prove generalizations of (iii) the Ham Sandwich theorem and (iv) the Lyusternik--Shnirelman- Borsuk covering theorem for the case where the number of measures or sets in a covering, respectively, may exceed the ambient dimension.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
