Results 271 to 280 of about 152,483 (296)
Some of the next articles are maybe not open access.
Mathematical Proceedings of the Cambridge Philosophical Society, 1996
AbstractWe investigate homomorphisms between finite oriented paths. We demonstrate the surprising richness of this perhaps simplest case of homomorphism between graphs by proving the density theorem for oriented paths. As a consequence every two dimensional countable poset is represented finite paths and their homomorphisms, and every finite ...
Nešetřil, Jaroslav, Zhu, Xuding
openaire +2 more sources
AbstractWe investigate homomorphisms between finite oriented paths. We demonstrate the surprising richness of this perhaps simplest case of homomorphism between graphs by proving the density theorem for oriented paths. As a consequence every two dimensional countable poset is represented finite paths and their homomorphisms, and every finite ...
Nešetřil, Jaroslav, Zhu, Xuding
openaire +2 more sources
A Frobenius homomorphism for Lusztig's quantum groups over arbitrary roots of unity
, 2014For a finite dimensional semisimple Lie algebra and a root of unity, Lusztig defined an infinite dimensional quantum group of divided powers. Under certain restrictions on the order of the root of unity, he constructed a Frobenius homomorphism with ...
S. Lentner
semanticscholar +1 more source
Independence and graph homomorphisms graph homomorphisms
Journal of Graph Theory, 1993AbstractA graph with n vertices that contains no triangle and no 5‐cycle and minimum degree exceeding n/4 contains an independent set with at least (3n)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism Lemma.
Michael O. Albertson +2 more
openaire +3 more sources
Czechoslovak Mathematical Journal, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Homomorphisms and promotability
1989The construction of structure-preserving maps, or “homomorphisms,” is described for an arbitrary data type: examples of these functions are given for list- and tree-like structures and types defined by mutual induction. From the definition of a data type it is also possible to infer a “promotion” theorem for proving equalities of homomorphisms.
openaire +3 more sources
COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On the suspension homomorphism
2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DRAGOTTI, SARA +2 more
openaire +2 more sources
The Inflation Homomorphism [PDF]
Journal of the London Mathematical Society, 1972 L. R. Vermani, Inder Bir S. Passi
openaire +1 more source
Shifted Adaption Homomorphism Encryption for Mobile and Cloud Learning
Computers & electrical engineering, 2017G. Kalpana +3 more
semanticscholar +1 more source
The Complexity of Homomorphism Indistinguishability
International Symposium on Mathematical Foundations of Computer Science, 2019Jan Böker +3 more
semanticscholar +1 more source