Results 191 to 200 of about 6,567 (235)

Derived category of weak chain U -complexes. [PDF]

Heliyon
Yuliawan F, Muchtadi-Alamsyah I, Pratama V, Elfiyanti G.   +3 more
europepmc   +1 more source

Rank-expanding satellites, Whitehead doubles, and Heegaard Floer homology. [PDF]

J Topol
Dai I, Hedden M, Mallick A, Stoffregen M.   +3 more
europepmc   +1 more source

Absolutely closed semigroups. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Banakh T, Bardyla S.
europepmc   +1 more source

Sequential topological complexity of aspherical spaces and sectional categories of subgroup inclusions. [PDF]

Math Ann
Espinosa Baro A, Farber M, Mescher S, Oprea J.   +3 more
europepmc   +1 more source

Extremal graphs for homomorphisms [PDF]

Journal of Graph Theory, 2011
The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of ...
Jonathan Cutler, A J Radcliffe
exaly   +2 more sources

Orlicz mixed radial Blaschke–Minkowski homomorphisms

Revista De La Real Academia De Ciencias Exactas, Fisicas Y Naturales - Serie A: Matematicas, 2020
Our main aim is to generalize the mixed radial Blaschke–Minkowski homomorphisms to the Orlicz space. By calculating first-order variation of the harmonic p-dual quermassintegrals of mixed radial Blaschke–Minkowski homomorphisms, we introduce a new affine
Wing Sum Cheung, Zhao Chang-Jian
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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

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

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