The distribution of values of the enumerating function of non-isomorphic abelian groups of finite order

1978 ◽  
Vol 30 (1) ◽  
pp. 374-379 ◽  
Author(s):  
Aleksandar Ivić
Keyword(s):  
Finite Order ◽  
Abelian Groups ◽  
Enumerating Function ◽  
Distribution Of Values

Relations between Finite Homology and Homotopy

1969 ◽  
Vol 12 (2) ◽  
pp. 139-150
Author(s):  
B. Brown
Keyword(s):  
Abelian Group ◽  
Positive Integer ◽  
Finite Order ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finitely Generated ◽  
Simply Connected

For a finite abelian group G let λ(G) be the least positive integer such that λ(G)G = 0. Let be the least integer such that λ(G) | (λ(G) divides ) and if 2 | λ(G) then 4 | . For a finitely generated abelian group G let GT be the subgroup of G made up of all elements of G of finite order, and let GF = G/GT. For a simply-connected C-W complex X, let be the smallest class of abelian groups containing the groups .

scholarly journals Logarithms in multiplier algebras

1979 ◽  
Vol 22 (3) ◽  
pp. 187-190
Author(s):  
G. V. Wood
Keyword(s):  
Abelian Group ◽  
Finite Order ◽  
Compact Abelian Group ◽  
Abelian Groups ◽  
Translation Operator ◽  
Locally Compact Abelian Group ◽  
Locally Compact ◽  
Multiplier Algebra ◽  
Multiplier Algebras

In (3) it is shown that, for a locally compact abelian group G and x∈G, δx has a logarithm in M(G) if and only if x has finite order. Since M(G) can be identified with the multipliers of L1(G), one might expect a similar result for the algebras of multipliers on Lp(G) for 1 < p < ∞. However, in contrast, it is shown in (2) that for a locally compact abelian group G and 1 < p < ∞, every translation operator on Lp(G) has a logarithm in the multiplier algebra. Here we consider whether the same results are true for non-abelian groups.

Automorphisms of finite order of nilpotent groups II

2014 ◽  
Vol 51 (4) ◽  
pp. 547-555 ◽  
Author(s):  
B. Wehrfritz
Keyword(s):  
Nilpotent Group ◽  
Finite Order ◽  
Finite Index ◽  
Nilpotent Groups ◽  
Finitely Generated

Let G be a nilpotent group with finite abelian ranks (e.g. let G be a finitely generated nilpotent group) and suppose φ is an automorphism of G of finite order m. If γ and ψ denote the associated maps of G given by \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\gamma :g \mapsto g^{ - 1} \cdot g\phi and \psi :g \mapsto g \cdot g\phi \cdot g\phi ^2 \cdots \cdot \cdot g\phi ^{m - 1} for g \in G,$$ \end{document} then Gγ · kerγ and Gψ · ker ψ are both very large in that they contain subgroups of finite index in G.

Finite-order Integration Weights Can be Dangerous

2007 ◽  
Vol 7 (3) ◽  
pp. 239-254 ◽  
Author(s):  
I.H. Sloan
Keyword(s):  
Function Space ◽  
Finite Order ◽  
Small Subset ◽  
Worst Case ◽  
Integration Rule ◽  
Dimensional Lattice ◽  
3 Dimensional ◽  
Sum Of Functions ◽  
Integration Rules

Abstract Finite-order weights have been introduced in recent years to describe the often occurring situation that multivariate integrands can be approximated by a sum of functions each depending only on a small subset of the variables. The aim of this paper is to demonstrate the danger of relying on this structure when designing lattice integration rules, if the true integrand has components lying outside the assumed finiteorder function space. It does this by proving, for weights of order two, the existence of 3-dimensional lattice integration rules for which the worst case error is of order O(N¯½), where N is the number of points, yet for which there exists a smooth 3- dimensional integrand for which the integration rule does not converge.

On Commutation Properties of the Composition Relation of Convergent and Divergent Permutations (Part I)

2014 ◽  
Vol 58 (1) ◽  
pp. 13-22
Author(s):  
Roman Wituła ◽  
Edyta Hetmaniok ◽  
Damian Słota
Keyword(s):  
Finite Order ◽  
Convergent Series ◽  
The Other ◽  
Other Hand ◽  
The Family ◽  
Composition Relation ◽  
The Continuum

Abstract In the paper we present the selected properties of composition relation of the convergent and divergent permutations connected with commutation. We note that a permutation on ℕ is called the convergent permutation if for each convergent series ∑an of real terms, the p-rearranged series ∑ap(n) is also convergent. All the other permutations on ℕ are called the divergent permutations. We have proven, among others, that, for many permutations p on ℕ, the family of divergent permutations q on ℕ commuting with p possesses cardinality of the continuum. For example, the permutations p on ℕ having finite order possess this property. On the other hand, an example of a convergent permutation which commutes only with some convergent permutations is also presented.

Sign in / Sign up

Export Citation Format

Share Document