Results 31 to 40 of about 11,002 (236)
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors [PDF]
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$.
Seppelt, Tim, Seppelt, Tim Frederik
core +1 more source
Universal mapping properties of some pseudovaluation domains and related quasilocal domains
If (R,M) and (S,N) are quasilocal (commutative integral) domains and f:R→S is a (unital) ring homomorphism, then f is said to be a strong local homomorphism (resp., radical local homomorphism) if f(M)=N (resp., f(M)⊆N and for each x∈N, there exists a
Ahmed Ayache +2 more
doaj +1 more source
Topology optimization for two-dimensional structures using boundary cycles in homology theory
Various prominent methods for structural topology optimization have been developed, especially since the late 1980s when the homogenization method was proposed.
Yasuhiko NAKANISHI
doaj +1 more source
Pták homomorphism theorem revisited [PDF]
summary:Rodrigues’ extension (1989) of the classical Pták’s homomorphism theorem to a non-necessarily locally convex setting stated that a nearly semi-open mapping between a semi-B-complete space and an arbitrary topological vector space is semi-open. In
López Pellicer, M. +3 more
core +1 more source
Factoring Continuous Characters Defined on Subgroups of Products of Topological Groups
This study is on the factorization properties of continuous homomorphisms defined on subgroups (or submonoids) of products of (para)topological groups (or monoids).
Mikhail G. Tkachenko
doaj +1 more source
Maximal Homomorphism in Fundamental Theorem of Homomorphism Semiring
Semiring is a generalization of ring. Some concepts in ring can be developed in semiring. The contructions of quotient semiring requires a specific ideal, namely Q-ideal.
Khurul Wardati +2 more
core +1 more source
Simplifications of homomorphisms
The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is demonstrated in providing rather short proofs of the following results: (i) Given an arbitrary homomorphism h and arbitrary words x, y it is decidable whether or not there exists an integer n such that hn(x) = hn(y). (ii) Given an arbitrary homomorphism h
Andrzej Ehrenfeucht, Grzegorz Rozenberg
openaire +2 more sources
The Complexity of Homomorphism Reconstructibility [PDF]
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would like
Seppelt, Tim +4 more
core +1 more source
We introduce and study a notion of pureness for *-homomorphisms and, more generally, for cpc. order-zero maps. After providing several examples of pureness, such as "$\mathcal{Z}$-stable"-like maps, we focus on the question of when pure maps factor through a pure C*-algebra.
Bosa, Joan, Vilalta Vila, Eduard
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laura Mancinska, David E. Roberson
openaire +3 more sources

