Datenvertragswerk
classical pattern avoiding permutation family
For length n0..5 and one original permutation pattern of length1..4 on0..m-1, generate EVERY permutation of0..n-1 with no increasing index subsequence whose selected values have that pattern relative order. Gaps are allowed; this is classical, not consecutive pattern avoidance. Return all full permutations in numeric lexicographic order, count, and inversion_histogram indexed0..n*(n-1)/2 including zero bins. Empty source length has one empty permutation; a one-letter pattern forbids every.
POST https://datenvertrag.halowerk.com/v1/classical-pattern-avoiding-permutation-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| pattern | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 5
},
{
"type": "null"
}
]
},
"pattern": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"permutations": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 5
},
"minItems": 0,
"maxItems": 120
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 120
},
"inversion_histogram": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 120
},
"minItems": 1,
"maxItems": 11
}
},
"required": [
"permutations",
"count",
"inversion_histogram"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"pattern",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 0,
"pattern": [
0
],
"claim": {
"permutations": [
[]
],
"count": 1,
"inversion_histogram": [
1
]
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.