اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTopological Symmetry Groups of Complete Bipartite Graphs
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The symmetries of complex molecular structures can be modeled by the {em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract graphs. This question has been answered for complete graphs; it is natural next to consider complete bipartite graphs. In previous work we classified the complete bipartite graphs that can realize topological symmetry groups isomorphic to $A_4$, $S_4$ or $A_5$; in this paper we determine which complete bipartite graphs have an embedding in $S^3$ whose topological symmetry group is isomorphic to $mathbb{Z}_m$, $D_m$, $mathbb{Z}_r times mathbb{Z}_s$ or $(mathbb{Z}_r times mathbb{Z}_s) ltimes mathbb{Z}_2$.
قيم البحث
اقرأ أيضاً
A weight system is a function on chord diagrams that satisfies the so-called four-term relations. Vassilievs theory of finite-order knot invariants describes these invariants in terms of weight systems. In particular, there is a weight system corresp
onding to the colored Jones polynomial. This weight system can be easily defined in terms of the Lie algebra $mathfrak{sl}_2$, but this definition is too cumbersome from the computational point of view, so that the values of this weight system are known only for some limited classes of chord diagrams. In the present paper we give a formula for the values of the $mathfrak{sl}_2$ weight system for a class of chord diagrams whose intersection graphs are complete bipartite graphs with no more than three vertices in one of the parts. Our main computational tool is the Chmutov--Varchenko reccurence relation. Furthermore, complete bipartite graphs with no more than three vertices in one of the parts generate Hopf subalgebras of the Hopf algebra of graphs, and we deduce formulas for the projection onto the subspace of primitive elements along the subspace of decomposable elements in these subalgebras. We compute the values of the $mathfrak{sl}_2$ weight system for the projections of chord diagrams with such intersection graphs. Our results confirm certain conjectures due to S.K.Lando on the values of the weight system $mathfrak{sl}_2$ at the projections of chord diagrams on the space of primitive elements.
This note gives a detailed proof of the following statement. Let $din mathbb{N}$ and $m,n ge d + 1$, with $m + n ge binom{d+2}{2} + 1$. Then the complete bipartite graph $K_{m,n}$ is generically globally rigid in dimension $d$.
We classify all groups which can occur as the topological symmetry group of some embedding of the Heawood graph in $S^3$.
We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general position.
Even without any of these assumptions, in complete generality, we extend these ideas to obtain an efficient algorithm, based on a sequence of linear programs, that determines whether an input framework of a complete bipartite graph is universally rigid or not.
Let $mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $mathrm{rex}(n, F)$, that are best possible up to a constant factor, when $F$ is one of
$C_4$, $K_{2,t}$, $K_{3,3}$ or $K_{s,t}$ when $t>s!$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
