2009
DOI: 10.1007/s11425-009-0027-5
|View full text |Cite
|
Sign up to set email alerts
|

Schreier rewriting beyond the classical setting

Abstract: Using actions of the free monoids and free associative algebras, we establish some Schreier-type formulas involving the ranks of actions and the ranks of subactions in free actions or Grassmann-type relations for the ranks of intersections of subactions of free actions. The coset action of the free group is used to establish the generalization of the Schreier formula to the case of subgroups of infinite index. We also study and apply large modules over free associative algebras in the spirit of [1,11].

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…If none of (a) or (b) applies, then Γ i = Γ i−1 = Γ. It is easy to check that the chain thus constructed satisfies all conditions (1) to (3) and that Γ is the union of all Γ i .…”
Section: One Lemma About Graphs With Bounded Degrees Of Verticesmentioning
confidence: 97%
See 1 more Smart Citation
“…If none of (a) or (b) applies, then Γ i = Γ i−1 = Γ. It is easy to check that the chain thus constructed satisfies all conditions (1) to (3) and that Γ is the union of all Γ i .…”
Section: One Lemma About Graphs With Bounded Degrees Of Verticesmentioning
confidence: 97%
“…According to [4], any such module has a free submodule of finite codimension, in particular, such module is large. Given an algebra R over a field Φ, a right R-module M is called large if it has a submodule of finite codimension which can be mapped onto the free R-module R. Free actions in all four cases and large module in the case of A r and F r have been studied in our previous paper [3].…”
Section: Introductionmentioning
confidence: 99%