Results 1 to 10 of about 152,483 (296)
Lattice Homomorphisms Induced by Group Homomorphisms [PDF]
Proceedings of the American Mathematical Society, 1951 Introduction. By a lattice homorphism of a group G onto a group G' we mean a single-valued mapping sb of the lattice L(G) of subgroups of G onto the lattice L(G') of subgroups of G', which preserves all unions and intersections, that is, which is subject to the conditions 1. (U,S,)(k U= (S,(k), 2.
D. G. Higman
openalex +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
A note on the homomorphism theorem for hemirings [PDF]
International Journal of Mathematics and Mathematical Sciences, 1978 The fundamental homomorphism theorem for rings is not generally applicable in hemiring theory. In this paper, we show that for the class of N-homomorphism of hemirings the fundamental theorem is valid.
D. M. Olson
doaj +2 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
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
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability [PDF]
International Colloquium on Automata, Languages and Programming, 2023 We show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation.
David E. Roberson, 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
Capturing Homomorphism-Closed Decidable Queries with Existential Rules [PDF]
International Conference on Principles of Knowledge Representation and Reasoning, 2021 Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering.
Camille Bourgaux +4 more
semanticscholar +1 more source