Maximal sum-free sets and block designs
Angelina Y. M. Chin (2001)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Small maximal sum-free sets.”
Maximal sum-free sets and block designs
Generalized sum-free subsets.
Caro, Yair (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The nucleus of the free alternative algebra.
Hentzel, I.R., Peresi, L.A. (2006)
Experimental Mathematics
Similarity:
Square-free and overlap-free words
A. J. Kfoury (1988)
Banach Center Publications
Similarity:
Fixed-point free maps of Euclidean spaces
R. Z. Buzyakova, A. Chigogidze (2011)
Fundamenta Mathematicae
Similarity:
Our main result states that every fixed-point free continuous self-map of ℝⁿ is colorable. This result can be reformulated as follows: A continuous map f: ℝⁿ → ℝⁿ is fixed-point free iff f̃: βℝⁿ → βℝⁿ is fixed-point free. We also obtain a generalization of this fact and present some examples
Maximum subsets of with no solutions to .
Chung, Fan R.K., Goldwasser, John L. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nilpotent free groups
Andrzej Mostowski (1961)
Fundamenta Mathematicae
Similarity:
Equilateral triangles in finite metric spaces.
Mascioni, Vania (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Free subgroups of the orthogonal group
J. de Groot, T. Dekker (1954-1956)
Compositio Mathematica
Similarity:
Some Recent Results on Squarefree Words
Jean Berstel (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
Fixed points of endomorphisms of certain free products
Pedro V. Silva (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.
Fixed points of endomorphisms of certain free products
Pedro V. Silva (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.