The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 8 of 8

Showing per page

Order by Relevance | Title | Year of publication

Su di un problema combinatorio in teoria dei gruppi

Mario CurzioPatrizia LongobardiMercede Maj — 1983

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Let G be a group and n an integer 2 . We say that G has the n -permutation property ( G P n ) if, for any elements x 1 , x 2 , , x n in G , there exists some permutation σ of { 1 , 2 , , n } , σ i d . such that x 1 , x 2 , , x n = x σ ( 1 ) , x σ ( 2 ) , , x σ ( n ) . We prouve that every group G P n is an FC-nilpotent group of class n - 1 , and that a finitely generated group has the n -permutation property (for some n ) if, and only if, it is abelian by finite. We prouve also that a group G P 3 if, and only if, its derived subgroup has order at most 2.

Su di un problema combinatorio in teoria dei gruppi

Mario CurzioPatrizia LongobardiMercede Maj — 1983

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Let G be a group and n an integer 2 . We say that G has the n -permutation property ( G P n ) if, for any elements x 1 , x 2 , , x n in G , there exists some permutation σ of { 1 , 2 , , n } , σ i d . such that x 1 , x 2 , , x n = x σ ( 1 ) , x σ ( 2 ) , , x σ ( n ) . We prouve that every group G P n is an FC-nilpotent group of class n - 1 , and that a finitely generated group has the n -permutation property (for some n ) if, and only if, it is abelian by finite. We prouve also that a group G P 3 if, and only if, its derived subgroup has order at most 2.

Page 1

Download Results (CSV)