2000
DOI: 10.1080/00927870008826958
|View full text |Cite
|
Sign up to set email alerts
|

The number of homomorphisms from a finite abelian group to a symmetric group

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
18
0

Year Published

2001
2001
2023
2023

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(19 citation statements)
references
References 3 publications
1
18
0
Order By: Relevance
“…If p = 2, there is a case which does not fall under the conditions of Theorem 2 (more precisely, Condition (2.3) is violated by a small margin), in which one may nevertheless even improve the bound in (2.4). The corresponding theorem, given below, vastly generalises Theorem 1.4 in [10]. We shall apply it in the proof of Theorem 26.…”
Section: P-divisibility Of Coefficients In Exponentials Of Power Serimentioning
confidence: 88%
See 2 more Smart Citations
“…If p = 2, there is a case which does not fall under the conditions of Theorem 2 (more precisely, Condition (2.3) is violated by a small margin), in which one may nevertheless even improve the bound in (2.4). The corresponding theorem, given below, vastly generalises Theorem 1.4 in [10]. We shall apply it in the proof of Theorem 26.…”
Section: P-divisibility Of Coefficients In Exponentials Of Power Serimentioning
confidence: 88%
“…The most general results in this direction, prior to the present paper, are due to Katsurada, Takegahara, and Yoshida, who establish lower bounds for the p-adic valuation v p h n (G) in the case when G is a finite Abelian p-group of rank (minimal number of generators) at most 2; cf. Theorems 1.3 and 1.4 in [10]. For instance, they show that, for a prime p and integers ℓ, m with ℓ ≥ m ≥ 0,…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We will give a proof of the fact that ord p (a(n)) ≥ γ(n) (Corollary 3.3 in Section 3). This inequality is shown in [5,6,8,10] and is also a consequence of [7, equation (3)]. If p = 2, this result is equivalent to [3,Theorem 10].…”
Section: Introductionmentioning
confidence: 79%
“…[6,10] Let m be an arbitrary nonnegative integer, and let and u be nonnegative integers less than p. Then…”
Section: So (13) Follows From the Preceding Property Of C(x)mentioning
confidence: 99%