On the diameter of sets of almost powers
B. M. M. de Weger, C. E. van de Woestijne (1999)
Acta Arithmetica
Similarity:
B. M. M. de Weger, C. E. van de Woestijne (1999)
Acta Arithmetica
Similarity:
Kurt Girstmair (1999)
Acta Arithmetica
Similarity:
G. R. Everest, K. Győry (1997)
Acta Arithmetica
Similarity:
Jozef Bobok (1999)
Fundamenta Mathematicae
Similarity:
Defining the complexity of a green pattern exhibited by an interval map, we give the best bounds of the topological entropy of a pattern with a given complexity. Moreover, we show that the topological entropy attains its strict minimum on the set of patterns with fixed eccentricity m/n at a unimodal X-minimal case. Using a different method, the last result was independently proved in[11].
G. Hjorth (2000)
Fundamenta Mathematicae
Similarity:
Non-abelian Polish groups arising as countable products of countable groups can be tame in arbitrarily complicated ways. This contrasts with some results of Solecki who revealed a very different picture in the abelian case.
Chaoping Xing, Harald Niederreiter (1995)
Acta Arithmetica
Similarity:
N. Brunner, Paul Howard, Jean Rubin (1997)
Fundamenta Mathematicae
Similarity:
Węglorz' models are models for set theory without the axiom of choice. Each one is determined by an atomic Boolean algebra. Here the algebraic properties of the Boolean algebra are compared to the set theoretic properties of the model.