نتایج جستجو برای: natural homomorphisms

تعداد نتایج: 484435  

2009
P. Christopher Staecker

We give a simple method which can be used to show that an element of a free group is the only member of its doubly-twisted conjugacy class with respect to a pair of homomorphisms having a natural remnant property. We also show that most pairs of homomorphisms have infinitely many such singleton classes.

2008
Amiel Ferman Tahl Nowik Robert Schwartz Mina Teicher

We give a new infinite family of group homomorphisms from the braid group Bk to the symmetric group Smk for all k and m ≥ 2. Most known permutation representations of braids are included in this family. We prove that the homomorphisms in this family are non-cyclic and transitive. For any divisor l of m, 1 ≤ l < m, we prove in particular that if m l is odd then there are 1+ m l non-conjugate hom...

2008
Helmut Jürgensen Ian McQuillan

The concept of density in a free monoid can be generalized from the infix relation to arbitrary relations. Many of the properties known for density can be established over these more general notions of densities. In this paper, we investigate homomorphisms which preserve different types of density. We demonstrate a strict hierarchy between families of homomorphisms which preserve density over d...

In this note we study some topological properties of bounded sets and Bourbaki-bounded sets. Also we introduce two types of Bourbaki-bounded homomorphisms on topological groups  including, n$-$Bourbaki-bounded homomorphisms and$hspace{1mm}$ B$-$Bourbaki-bounded homomorphisms. We compare them to each other and with the class of continuous homomorphisms. So, two topologies are presented on them a...

Journal: :Order 2022

We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit a logarithmic natural duality. characterize homomorphism posets of finite algebras terms disjoint unions dual partition lattices and investigate reconstruction problems homomorphisms.

2008
Pavol Hell

Homomorphisms are a useful model for a wide variety of combinatorial problems dealing with mappings and assignments, typified by scheduling and channel assignment problems. Homomorphism problems generalize graph colourings, and are in turn generalized by constraint satisfaction problems; they represent a robust intermediate class of problems – with greater modeling power than graph colourings, ...

Journal: :bulletin of the iranian mathematical society 0
sh. ghaffary ghaleh department of mathematics, payame noor university of zahedan branch, zahedan, iran kh. ghasemi department of mathematics, payame noor university of khash branch, khash, iran

in this paper, we introduce n-jordan homomorphisms and n-jordan *-homomorphisms and also investigate the hyers-ulam-rassiasstability of n-jordan *-homomorphisms on c*-algebras.

2008
PETER ALBERS

A. This article address two issues. First, we explore to what extend the techniques of Piunikhin, Salamon and Schwarz in [PSS96] can be carried over to Lagrangian Floer homology. In [PSS96] an isomorphism between Hamiltonian Floer homology and singular homology is established. In contrast, Lagrangian Floer homology is not isomorphic to the singular homology of the Lagrangian submanifold,...

Journal: :CoRR 2017
Thomas Kahl

We define labeling homomorphisms on the cubical homology of higher-dimensional automata and show that they are natural with respect to cubical dimaps and compatible with tensor products. We also indicate two possible applications of labeled homology in concurrency theory.

2009
Ambar Sengupta Bogdan Oporowski

We obtain the picture group as the quotient with a torsion subgroup, of an extended picture group, which is isomorphic to the kernel of a precrossed module homomorphism. In addition to expanding the notion of a picture group, the new formulation gives a natural way to construct homomorphisms between picture groups by describing deformations of one-vertex subpictures. The extended picture group ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید