Wolfram Language Paclet Repository

Community-contributed installable additions to the Wolfram Language

Primary Navigation

    • Cloud & Deployment
    • Core Language & Structure
    • Data Manipulation & Analysis
    • Engineering Data & Computation
    • External Interfaces & Connections
    • Financial Data & Computation
    • Geographic Data & Computation
    • Geometry
    • Graphs & Networks
    • Higher Mathematical Computation
    • Images
    • Knowledge Representation & Natural Language
    • Machine Learning
    • Notebook Documents & Presentation
    • Scientific and Medical Data & Computation
    • Social, Cultural & Linguistic Data
    • Strings & Text
    • Symbolic & Numeric Computation
    • System Operation & Setup
    • Time-Related Computation
    • User Interface Construction
    • Visualization & Graphics
    • Random Paclet
    • Alphabetical List
  • Using Paclets
    • Get Started
    • Download Definition Notebook
  • Learn More about Wolfram Language

TensorNetworks

Guides

  • TensorNetworks

Tech Notes

  • Building Tensor Networks
  • Contraction Paths and Execution
  • Matrix Product States
  • A Working Tour of the Symmetry Functions
  • Tensor Networks Overview
  • Young Tableaux and Tensor Symmetries

Symbols

  • ActivateTensors
  • BinaryTensorNetwork
  • BinaryTensorNetworkQ
  • CanonicalPath
  • CanonicalPathQ
  • ContractIndices
  • ContractionTree
  • EinsteinSummation
  • GreedyContractionPath
  • HookFactor
  • HookLength
  • HookLengths
  • IndexedMultiply
  • InitializeTensorNetwork
  • MetricTensor
  • MetricTensorQ
  • MPSCanonicalForm
  • MPSCanonicalQ
  • MPSEntanglementEntropy
  • MPSNormalize
  • MPSNorm
  • MPSOverlap
  • MPSSchmidtValues
  • MPSTruncate
  • OptimalContractionPath
  • PartitionQ
  • PathIndexContractions
  • PathQ
  • PathToTreePath
  • RandomTensorNetwork
  • SchurDimension
  • SparseTensorNetwork
  • TableauColumns
  • TableauDimension
  • TableauRows
  • TableauShape
  • TableauSize
  • TableauWeylDimension
  • TensorNetworkAdd
  • TensorNetworkContraction
  • TensorNetworkContractions
  • TensorNetworkContract
  • TensorNetworkData
  • TensorNetworkDelete
  • TensorNetworkFreeIndices
  • TensorNetworkGraphData
  • TensorNetworkGraphQ
  • TensorNetworkIndexDimensions
  • TensorNetworkIndexGraph
  • TensorNetworkIndices
  • TensorNetwork
  • TensorNetworkQ
  • TensorNetworkRemoveCycles
  • TensorNetworkReplaceIndices
  • TensorNetworkSize
  • TensorNetworkTensors
  • TensorNetworkToNetGraph
  • ToTensorNetworkGraph
  • TransposePartition
  • TreePathQ
  • TreePathToPath
  • YoungProject
  • YoungSymmetrize
  • YoungTableau
  • YoungTableauQ
Wolfram`TensorNetworks`Symmetry`
PartitionQ
​
PartitionQ
[list]
yields
True
if
list
is a valid integer partition: a non-empty list of positive integers in non-increasing order.
​
Details and Options
Examples  
(5)
Scope  
(3)
Valid partitions  
(1)
A single-element list with a positive entry is the smallest valid partition:
In[1]:=
PartitionQ
[{5}]
Out[1]=
True
​
Repeated entries are allowed; the order is weakly decreasing:
In[1]:=
PartitionQ
[{3,3,2}]
Out[1]=
True
​
A row of ones is a partition (the trivial column-shape diagram):
In[1]:=
PartitionQ
[{1,1,1,1,1}]
Out[1]=
True
Rejection cases  
(1)

From IntegerPartitions  
(1)

Applications  
(1)

Properties & Relations  
(1)

SeeAlso
TransposePartition
 
▪
TableauDimension
 
▪
HookFactor
 
▪
HookLengths
 
▪
YoungTableau
 
▪
YoungTableauQ
 
▪
IntegerPartitions
 
▪
OrderedQ
TechNotes
▪
Young Symmetries
RelatedGuides
▪
TensorNetworks
A weakly decreasing list of positive integers is a partition:
In[1]:=
PartitionQ
[{3,2,1}]
Out[1]=
True
​
The empty list is rejected because the kernel requires at least one entry:
In[2]:=
PartitionQ
[{}]
Out[2]=
False
​
An increasing-order list violates the partition convention:
In[3]:=
PartitionQ
[{1,2,3}]
Out[3]=
False
""

© 2026 Wolfram. All rights reserved.

  • Legal & Privacy Policy
  • Contact Us
  • WolframAlpha.com
  • WolframCloud.com