Combinatorial map as multiplication of combinatorial knots
نویسنده
چکیده
We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot’s square and trivial knot (= μ · ν · π1).
منابع مشابه
Graphs as rotations
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we define multiplication of these objects, that coincides with the multiplication of permutations. We consider closed under multiplication classes of combi...
متن کاملNormalization of Twisted Alexander Invariants
Twisted Alexander invariants of knots are well-defined up to multiplication of units. We get rid of this multiplicative ambiguity via a combinatorial method and define normalized twisted Alexander invariants. We can show that the invariants coincide with signdetermined Reidemeister torsion in a normalized setting and refine the duality theorem. As an application, we obtain stronger necessary co...
متن کاملRefinement of Twisted Alexander Invariants and Sign-determined Reidemeister Torsions
Twisted Alexander invariants of knots are well-defined up to multiplication of units. We get rid of this multiplicative ambiguity via a combinatorial method. We can show that the refined invariants coincide with sign-determined Reidemeister torsions associated to some Euler structures. As an application, we obtain stronger necessary conditions for a knot to be fibered than those previously know...
متن کاملTorsion of 3-Dimensional Euler Structures with Simple Boundary Tangency and Legendrian Knots
We generalize Turaev’s definition of torsion invariants of pairs (M, ξ), where M is a 3-dimensional manifold and ξ is an Euler structure on M (a non-singular vector field up to homotopy relative to ∂M and local modifications in Int(M)). Namely, we allow M to have arbitrary boundary and ξ to have simple (convex and/or concave) tangency circles to the boundary. We prove that Turaev’s H1(M)-equiva...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009