Zobrazeno 1 - 10
of 340
pro vyhledávání: '"Peter Hilton"'
Autor:
Peter Hilton
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2005, Iss 20, Pp 3269-3272 (2005)
Externí odkaz:
https://doaj.org/article/66c40370fe494a47924e0e01743f75c2
Autor:
Peter Hilton, C. Joanna Su
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2005, Iss 1, Pp 155-162 (2005)
In a system of interlocking sequences, the assumption that three out of the four sequences are exact does not guarantee the exactness of the fourth. In 1967, Hilton proved that, with the additional condition that it is differential at the crossing po
Externí odkaz:
https://doaj.org/article/0be986764beb49f8a872d6926abb88a9
Autor:
Giora Dula, Peter Hilton
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2003, Iss 62, Pp 3903-3920 (2003)
Given a set K with cardinality ‖K‖ =n, a wedge decomposition of a space Y indexed by K, and a cogroup A, the homotopy group G=[A,Y] is shown, by using Pierce-like idempotents, to have a direct sum decomposition indexed by P(K)−{ϕ} which is str
Externí odkaz:
https://doaj.org/article/2b3ed8e4873b456aa6fded66fe9a4e64
Autor:
Peter Hilton
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 28, Iss 8, Pp 455-460 (2001)
We study the ramifications of Schur's theorem that, if G is a group such that G/ZG is finite, then G′ is finite, if we restrict attention to nilpotent group. Here ZG is the center of G, and G′ is the commutator subgroup. We use localization metho
Externí odkaz:
https://doaj.org/article/21a9025c05da423fa90f8663dde10dc1
Autor:
Peter Hilton, Dirk Scevenels
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 24, Iss 8, Pp 539-548 (2000)
In an earlier paper, the authors proved that a process described much earlier for passing from a finitely generated nilpotent group N of a certain kind to a nilpotent space X of finite type produced a bijection of Mislin genera 𝒢(N)≅𝒢(X). The
Externí odkaz:
https://doaj.org/article/692e03429f1a48afb7fced333dfb0f00
Autor:
Peter Hilton
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 20, Iss 4, Pp 617-620 (1997)
We use methods of algebraic topology to study when a connected topological space admits an n-mean map.
Externí odkaz:
https://doaj.org/article/2d2d7ae497e74ed7ac04c494ad9edb61
Autor:
Peter Hilton, Robert Militello
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 19, Iss 3, Pp 539-544 (1996)
A nilpotent group G is fgp if Gp, is finitely generated (fg) as a p-local group for all primes p; it is fg-like if there exists a nilpotent fg group H such that Gp≃Hp for all primes p. The fgp nilpotent groups form a (generalized) Serre class; the
Externí odkaz:
https://doaj.org/article/b970c7ecd9c14e80b2008d7d0df56979
Autor:
Peter Hilton, Jean Pedersen
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 10, Iss 1, Pp 113-123 (1987)
In an earlier paper the authors described an algorithm for determining the quasi-order, Qt(b), of tmodb, where t and b are mutually prime. Here Qt(b) is the smallest positive integer n such that tn=±1modb, and the algorithm determined the sign (−1
Externí odkaz:
https://doaj.org/article/a85c1e84dd70404b87a8cc26efb3a968
Autor:
Peter Hilton, Jean Pedersen
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 9, Iss 2, Pp 245-251 (1986)
This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algori
Externí odkaz:
https://doaj.org/article/7114bc68d91a4abea2d25e08b9190dd3
Autor:
Peter Hilton, Jean Pedersen
This easy-to-read 2010 book demonstrates how a simple geometric idea reveals fascinating connections and results in number theory, the mathematics of polyhedra, combinatorial geometry, and group theory. Using a systematic paper-folding procedure it i
