Results 191 to 200 of about 11,002 (236)

Block mapping class groups and their finiteness properties. [PDF]

Geom Dedic
Aramayona J, Aroca J, Cumplido M, Skipper R, Wu X.   +4 more
europepmc   +1 more source

The Abelian group structure of full factorial designs. [PDF]

Front Psychol
Altieri NA.
europepmc   +1 more source

An algebraic approach to circulant column parity mixers. [PDF]

Des Codes Cryptogr
Subroto RC.
europepmc   +1 more source

Stability of Homomorphisms, Coverings and Cocycles I: Equivalence

Chapman M, Lubotzky A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

In praise of homomorphisms

Computer Science Review, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Hell, Jaroslav Nesetril
openaire   +1 more source

Varieties of misrepresentation and homomorphism [PDF]

European Journal for Philosophy of Science, 2015
This paper is a critical response to Andreas Bartels’ (2006) sophisticated defense of a structural account of scientific representation. We show that, contrary to Bartels’ claim, homomorphism fails to account for the phenomenon of misrepresentation. Bar-
Mauricio Suarez
exaly   +2 more sources

On the restricted homomorphism problem [PDF]

Discrete Applied Mathematics, 2008
The restricted homomorphism problem RHP(H,Y) asks: given an input digraph G and a homomorphism g:G→Y, does there exist a homomorphism f:G→H? We prove that if H is hereditarily hard and Y↛H, then RHP(H,Y) is NP-complete.
Brewster, Richard C., Graves, Timothy
exaly   +2 more sources

On the Arens Homomorphism

Functional Analysis and Its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turan, Bahri, Aslantaş, Mustafa
openaire   +3 more sources

Independence and graph homomorphisms graph homomorphisms

Journal of Graph Theory, 1993
AbstractA 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, Lily Chan, Ruth Haas   +2 more
openaire   +1 more source

Approximate Homomorphisms II: Group Homomorphisms

Combinatorica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources