Sage partition
Aaron Lauve, Mike Zabrocki (2018): Implementation of orbit basis for Partition algebra. class sage.combinat.diagram_algebras.AbstractPartitionDiagram(parent ... ,Return a list of all the partitions that can be obtained by adding a horizontal border strip of length k to self . EXAMPLES: sage: Partition([]). ,2007年7月28日 — Jonathan Bober (2007-07-28): wrote the program partitions_c.cc that does all the actual heavy lifting. sage.combinat.partitions. ,An ordered set partition p of a set s is a list of pairwise disjoint nonempty subsets of s such that the union of these subsets is s. These subsets are called ... ,A partition μ is said to be included in a partition λ if μi≤λi, for all i. In other words, the diagram of μ is a subset of the diagram of λ ... ,Sage follows the usual python conventions when dealing with partitions, so that the first part of the partition mu=Partition([4,3,2,2]) is mu[0], the second ... ,A set partition p of a set S is a partition of S into subsets called parts and represented as a set of sets. By extension, a set partition of a nonnegative ...,A skew partition can be depicted by a diagram made of rows of cells, in the same way as a partition. Only the cells of the outer partition p1 which are not in ...,A super partition of size n and fermionic sector m is a pair consisting of a strict partition of some integer r of length m (that may end in a 0) and an integer ...,min – A list of non-negative integers dominated elementwise by vect. OUTPUT: A list in lexicographic order of all integer vectors (as lists) which are ...
| 相關軟體 Write! 資訊 | |
|---|---|
 Sage partition 相關參考資料
Diagram and Partition Algebras — Sage 9.4 Reference Manual
Aaron Lauve, Mike Zabrocki (2018): Implementation of orbit basis for Partition algebra. class sage.combinat.diagram_algebras.AbstractPartitionDiagram(parent ... https://doc.sagemath.org Integer partitions — Sage 9.4 Reference Manual - SageMath ...
Return a list of all the partitions that can be obtained by adding a horizontal border strip of length k to self . EXAMPLES: sage: Partition([]). https://doc.sagemath.org Iterators over the partitions of an integer
2007年7月28日 — Jonathan Bober (2007-07-28): wrote the program partitions_c.cc that does all the actual heavy lifting. sage.combinat.partitions. https://doc.sagemath.org Ordered Set Partitions — Sage 9.4 Reference Manual
An ordered set partition p of a set s is a list of pairwise disjoint nonempty subsets of s such that the union of these subsets is s. These subsets are called ... https://doc.sagemath.org Partitions — More Sage Thematic Tutorials 0.1 documentation
A partition μ is said to be included in a partition λ if μi≤λi, for all i. In other words, the diagram of μ is a subset of the diagram of λ ... https://more-sagemath-tutorial Partitions — Sage Reference Manual v4.5.1
Sage follows the usual python conventions when dealing with partitions, so that the first part of the partition mu=Partition([4,3,2,2]) is mu[0], the second ... http://fe.math.kobe-u.ac.jp Set Partitions — Sage 9.4 Reference Manual: Combinatorics
A set partition p of a set S is a partition of S into subsets called parts and represented as a set of sets. By extension, a set partition of a nonnegative ... https://doc.sagemath.org Skew Partitions — Sage 9.4 Reference Manual: Combinatorics
A skew partition can be depicted by a diagram made of rows of cells, in the same way as a partition. Only the cells of the outer partition p1 which are not in ... https://doc.sagemath.org Super Partitions — Sage 9.3 Reference Manual: Combinatorics
A super partition of size n and fermionic sector m is a pair consisting of a strict partition of some integer r of length m (that may end in a 0) and an integer ... https://doc.sagemath.org Vector Partitions — Sage 9.4 Reference Manual: Combinatorics
min – A list of non-negative integers dominated elementwise by vect. OUTPUT: A list in lexicographic order of all integer vectors (as lists) which are ... https://doc.sagemath.org |