Linear relations between roots of polynomials
Kurt Girstmair (1999)
Acta Arithmetica
Similarity:
Displaying similar documents to “A generalization of Sturmian sequences: Combinatorial structure and transcendence”
Linear relations between roots of polynomials
Counting solutions of decomposable form equations
G. R. Everest, K. Győry (1997)
Acta Arithmetica
Similarity:
Embedding partially ordered sets into
Ilijas Farah (1996)
Fundamenta Mathematicae
Similarity:
We investigate some natural questions about the class of posets which can be embedded into ⟨ω,≤*⟩. Our main tool is a simple ccc forcing notion which generically embeds a given poset E into ⟨ω,≤*⟩ and does this in a “minimal” way (see Theorems 9.1, 10.1, 6.1 and 9.2).
Irreducible representations of metrizable spaces and strongly countable-dimensional spaces
Richard Millspaugh, Leonard Rubin, Philip Schapiro (1995)
Fundamenta Mathematicae
Similarity:
A Nielsen theory for intersection numbers
Christopher McCord (1997)
Fundamenta Mathematicae
Similarity:
Nielsen theory, originally developed as a homotopy-theoretic approach to fixed point theory, has been translated and extended to various other problems, such as the study of periodic points, coincidence points and roots. In this paper, the techniques of Nielsen theory are applied to the study of intersections of maps. A Nielsen-type number, the Nielsen intersection number NI(f,g), is introduced, and shown to have many of the properties analogous to those of the Nielsen fixed point number....
Spaces of polynomials with roots of bounded multiplicity
M. Guest, A. Kozlowski, K. Yamaguchi (1999)
Fundamenta Mathematicae
Similarity:
We describe an alternative approach to some results of Vassiliev ([Va1]) on spaces of polynomials, by applying the "scanning method" used by Segal ([Se2]) in his investigation of spaces of rational functions. We explain how these two approaches are related by the Smale-Hirsch Principle or the h-Principle of Gromov. We obtain several generalizations, which may be of interest in their own right.
Wildness in the product groups
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.