Results 1 to 10 of about 153,244 (275)
Homomorphisms of the lattice of slowly oscillating functions on the half-line [PDF]
Applied General Topology, 2023 We study the space H(SO) of all homomorphisms of the vector lattice of all slowly oscillating functions on the half-line ℍ = [ 0 , ∞ ) . In contrast to the case of homomorphisms of uniformly continuous functions, it is shown that a homomorphism in H(SO ...
Yutaka Iwamoto
doaj +2 more sources
Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism [PDF]
arXiv, 2013 For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $\varphi \colon V(G) \to V(H)$, which maps vertices adjacent in $G$ to adjacent vertices of $H$. A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in $H$.
Rzążewski, Paweł
arxiv +4 more sources
Extending Johnson's and Morita's homomorphisms to the mapping class group [PDF]
Algebr. Geom. Topol. 7 (2007) 1297-1326, 2007 We extend certain homomorphisms defined on the higher Torelli subgroups of the mapping class group to crossed homomorphisms defined on the entire mapping class group. In particular, for every $k\geq 2$, we construct a crossed homomorphism $\epsilon_k$ which extends Morita's homomorphism $\tilde \tau_k$ to the entire mapping class group.
Andreadakis +13 more
arxiv +3 more sources
Homomorphic Preimages of Geometric Cycles [PDF]
Discussiones Mathematicae Graph Theory, Vol. 38 (2) (2018): pp.
553 - 572, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in ...
Cockburn, Sally
arxiv +3 more sources
Forum of Mathematics, PiWe introduce new types of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks [Mar16].
Sebastian Brandt +5 more
doaj +4 more sources
On Normalistic Vague Soft Groups and Normalistic Vague Soft Group Homomorphism
Advances in Fuzzy Systems, 2015 We further develop the theory of vague soft groups by establishing the concept of normalistic vague soft groups and normalistic vague soft group homomorphism as a continuation to the notion of vague soft groups and vague soft homomorphism. The properties
Ganeshsree Selvachandran +1 more
doaj +2 more sources
Sexual homomorphism in dioecious trees: extensive tests fail to detect sexual dimorphism in Populus
Scientific Reports, 2017 The evolution of sexual dimorphism and expansion of sex chromosomes are both driven through sexual conflict, arising from differing fitness optima between males and females.
Athena D Mckown +2 more
exaly +2 more sources
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width [PDF]
Symposium on Theoretical Aspects of Computer Science, 2023 Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$ denotes the number ...
Daniel Neuen
semanticscholar +1 more source
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2023 Two graphs $G$ and $H$ are homomorphism indistinguishable over a class of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphisms from $F$ to $H$.
Tim Seppelt
semanticscholar +1 more source
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width [PDF]
International Colloquium on Automata, Languages and Programming, 2022 The generic homomorphism problem, which asks whether an input graph \(G\) admits a homomorphism into a fixed target graph \(H\) , has been widely studied in the literature.
R. Ganian +4 more
semanticscholar +1 more source