# SymPy | Partition.RGS_generalized() in Python

Partition.RGS_generalized() : RGS_generalized() is a sympy Python library function that calculates the m + 1 generalized unrestricted growth strings (string where a[i] is the block in which element i occurs) and then return it as rows in matrix.

Restricted growth strings – string in which each character, ai results in the Block (Bi) in which the corresponding element belongs.

Syntax : sympy.combinatorics.partitions.Partition.RGS_generalized()

Return : generalized unrestricted growth strings as row of matrix.

Code #1 : RGS_generalized() Example

 `] ` ` `  `# Python code explaining ` `# SymPy.RGS_generalized() ` ` `  `# importing SymPy libraries ` `from` `sympy.combinatorics.partitions ``import` `Partition ` `from` `sympy.combinatorics.partitions ``import` `RGS_generalized ` ` `  `# Using from sympy.combinatorics.partitions.Partition.RGS_generalized() method  ` `p ``=` `RGS_generalized(``3``) ` ` `  `print` `(``"Row of Matrx : \n"``, p) `

Output :

Row of Matrx :
Matrix([[1, 1, 1, 1], [1, 2, 3, 0], [2, 5, 0, 0], [5, 0, 0, 0]])

Code #2 : RGS_generalized() Example

 `] ` ` `  `# Python code explaining ` `# SymPy.RGS_generalized() ` ` `  `# importing SymPy libraries ` `from` `sympy.combinatorics.partitions ``import` `Partition ` `from` `sympy.combinatorics.partitions ``import` `RGS_generalized ` ` `  `# Using from sympy.combinatorics.partitions.Partition.RGS_generalized() method  ` `p ``=` `RGS_generalized(``-``1``) ` ` `  `print` `(``"Row of Matrx : \n"``, p) `

Output :

Row of Matrx :
Matrix(0, 0, [])

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.