Results 1  10
of
18,527
Homomorphisms And Strong Homomorphisms Of Relational Structures
, 1997
"... In this paper, we present a construction of all homomorphisms of an nary relational structure into another nary relational structure. This construction may be used if constructing continuous transformations of a totally additive closure space into another space of the same type. ..."
Abstract
 Add to MetaCart
In this paper, we present a construction of all homomorphisms of an nary relational structure into another nary relational structure. This construction may be used if constructing continuous transformations of a totally additive closure space into another space of the same type.
On Weak Lattice and Frame Homomorphisms
, 2003
"... In the context of distributive lattices, frames, or frames, a join homomorphism preserving the unit and those binary meets which are zero often preserves all binary meets. This paper analyzes this phenomenon. ..."
Abstract
 Add to MetaCart
In the context of distributive lattices, frames, or frames, a join homomorphism preserving the unit and those binary meets which are zero often preserves all binary meets. This paper analyzes this phenomenon.
Generic Homomorphic Undeniable Signatures
 Advances in Cryptology  Asiacrypt ’04, LNCS 3329
, 2004
"... Abstract. We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, DiffieHellman, and RSA. As an application, we propose a generic undeniable signature scheme which generalizes the ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
Abstract. We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, DiffieHellman, and RSA. As an application, we propose a generic undeniable signature scheme which generalizes
Homomorphisms of Lattices, Finite Join and Finite Meet
"... the notation and terminology for this paper. 1. PRELIMINARIES In this paper x, X, X1, Y, Z are sets. One can prove the following three propositions: (1) If � Y ⊆ Z and X ∈ Y, then X ⊆ Z. (2) � (X ⋓Y) = � X ∩ � Y. (3) Let given X. Suppose that (i) X � = /0, and (ii) for every Z such that Z � = /0 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the notation and terminology for this paper. 1. PRELIMINARIES In this paper x, X, X1, Y, Z are sets. One can prove the following three propositions: (1) If � Y ⊆ Z and X ∈ Y, then X ⊆ Z. (2) � (X ⋓Y) = � X ∩ � Y. (3) Let given X. Suppose that (i) X � = /0, and (ii) for every Z such that Z � = /0 and Z ⊆ X and Z is ⊆linear there exists Y such that Y ∈ X and for every X1 such that X1 ∈ Z holds X1 ⊆ Y. Then there exists Y such that Y ∈ X and for every Z such that Z ∈ X and Z � = Y holds Y � ⊆ Z. 2. LATTICE THEORY We adopt the following rules: L is a lattice, F, H are filters of L, and p, q, r are elements of L. We now state three propositions: (4) [L) is prime.
Antichains in the homomorphism order of graphs
 Comment. Math. Univ. Carolin
"... Denote by G and D, respectively, the the homomorphism poset of the finite undirected and directed graphs, respectively. A maximal antichain A in a poset P splits if A has a partition (B, C) such that for each p ∈ P either b ≤P p for some b ∈ B or p ≤p c for some c ∈ C. We construct both splitting an ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Denote by G and D, respectively, the the homomorphism poset of the finite undirected and directed graphs, respectively. A maximal antichain A in a poset P splits if A has a partition (B, C) such that for each p ∈ P either b ≤P p for some b ∈ B or p ≤p c for some c ∈ C. We construct both splitting
Exact algorithms for graph homomorphisms
 Proceedings of FCT 2005, LNCS 3623, 2005
"... Graph homomorphism, also called Hcoloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if G is kcolorable. During the recent years the topic of exact (exponentialtime) algorithms for NPhard problems in genera ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Graph homomorphism, also called Hcoloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if G is kcolorable. During the recent years the topic of exact (exponentialtime) algorithms for NPhard problems
Relations, Multialgebras and Homomorphisms
"... This paper is an attempt to bring some order into this chaos. Instead of listing and defending new definitions we hope that approaching the problem from a more algebraic perspective may bring at least some clarification. Section 2 addresses the question of composition of homomorphisms. In subsection ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper is an attempt to bring some order into this chaos. Instead of listing and defending new definitions we hope that approaching the problem from a more algebraic perspective may bring at least some clarification. Section 2 addresses the question of composition of homomorphisms
Minimum Cost Homomorphisms to Digraphs
, 2009
"... For digraphs D and H, a homomorphism of D to H is a mapping f: V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative integer costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) c f(u)(u). The minimum cost ..."
Abstract
 Add to MetaCart
For digraphs D and H, a homomorphism of D to H is a mapping f: V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative integer costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) c f(u)(u). The minimum
Results 1  10
of
18,527