اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSelf-dual maps II: links and symmetry
97
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links into an invariant of ribbon graphs, and vice versa.
A vertex-transitive map $X$ is a map on a closed surface on which the automorphism group ${rm Aut}(X)$ acts transitively on the set of vertices. If the face-cycles at all the vertices in a map are of same type then the map is said to be a semi-equive
lar map. Clearly, a vertex-transitive map is semi-equivelar. Converse of this is not true in general. We show that there are eleven types of semi-equivelar maps on the torus. Three of these are equivelar maps. It is known that two of the three types of equivelar maps on the torus are always vertex-transitive. We show that this is true for the remaining one type of equivelar map and one other type of semi-equivelar maps, namely, if $X$ is a semi-equivelar map of type $[6^3]$ or $[3^3, 4^2]$ then $X$ is vertex-transitive. We also show, by presenting examples, that this result is not true for the remaining seven types of semi-equivelar maps. There are ten types of semi-equivelar maps on the Klein bottle. We present examples in each of the ten types which are not vertex-transitive.
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.
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 suppor
ts 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.
The ribbon cocycle invariant is defined by means of a partition function using ternary cohomology of self-distributive structures (TSD) and colorings of ribbon diagrams of a framed link, following the same paradigm introduced by Carter, Jelsovsky, Ka
mada, Langfor and Saito in Transactions of the American Mathematical Society 2003;355(10):3947-89, for the quandle cocycle invariant. In this article we show that the ribbon cocycle invariant is a quantum invariant. We do so by constructing a ribbon category from a TSD set whose twisting and braiding morphisms entail a given TSD $2$-cocycle. Then we show that the quantum invariant naturally associated to this braided category coincides with the cocycle invariant. We generalize this construction to symmetric monoidal categories and provide classes of examples obtained from Hopf monoids and Lie algebras. We further introduce examples from Hopf-Frobenius algebras, objects studied in quantum computing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
