Polytopes that Fill Rn and Scissors Congruence.
J.C. Lagarias, D. Moews (1995)
Discrete & computational geometry
Similarity:
J.C. Lagarias, D. Moews (1995)
Discrete & computational geometry
Similarity:
Emo Welzl, H. Alt, Kurt Mehlhorn, Hubert Wagener (1988)
Discrete & computational geometry
Similarity:
Manfred Armbrust (1973)
Colloquium Mathematicae
Similarity:
Scott Ahlgren (2003)
Acta Arithmetica
Similarity:
Marica D. Prešić (1979)
Publications de l'Institut Mathématique
Similarity:
G. Reinelt (1993)
Discrete & computational geometry
Similarity:
V. Klee, P. Gritzmann, D. Larman (1995)
Discrete & computational geometry
Similarity:
G.T. Sallee (1987)
Discrete & computational geometry
Similarity:
Hao Pan (2007)
Acta Arithmetica
Similarity:
Ivan Chajda, Radomír Halaš (2002)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We present a countable infinite chain of conditions which are essentially weaker then congruence modularity (with exception of first two). For varieties of algebras, the third of these conditions, the so called 4-submodularity, is equivalent to congruence modularity. This is not true for single algebras in general. These conditions are characterized by Maltsev type conditions.
Magill, K.D.jun. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity:
Ying Zhang (2007)
Acta Arithmetica
Similarity:
W. Jockusch (1993)
Discrete & computational geometry
Similarity: