Datenvertragswerk
finite quiver stability hardernarasimhan filtration
Compute the unique Harder-Narasimhan filtration of an actual finite acyclic quiver representation over F2, with rational vertex weights theta. Slope is sum(theta_i*dim_i)/sum(dim_i). Each nonzero successive quotient is semistable over F2 (all F2 subrepresentations have slope <= its own); quotient slopes strictly decrease. Return the whole ordered HN type, reduced rational slopes as {numerator,denominator}, semistability and the unique actual nested vertex subspaces in canonical row-RREF.
POST https://datenvertrag.halowerk.com/v1/finite-quiver-stability-hardernarasimhan-filtrationInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dimensions | See schema | Yes | |
| arrows | See schema | Yes | |
| weights | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dimensions": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"arrows": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"tail": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"head": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"matrix": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
}
},
"required": [
"tail",
"head",
"matrix"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"weights": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"numerator": {
"type": "integer",
"minimum": -12,
"maximum": 12
},
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 12
}
},
"required": [
"numerator",
"denominator"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"semistable": {
"type": "boolean"
},
"hn_type": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 6
},
"slopes": {
"type": "array",
"items": {
"type": "object",
"properties": {
"numerator": {
"type": "integer",
"minimum": -130000,
"maximum": 130000
},
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 12000
}
},
"required": [
"numerator",
"denominator"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 6
},
"filtration": {
"type": "array",
"items": {
"type": "object",
"properties": {
"dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
"bases": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
}
},
"required": [
"dimensions",
"bases"
],
"additionalProperties": false
},
"minItems": 2,
"maxItems": 7
}
},
"required": [
"semistable",
"hn_type",
"slopes",
"filtration"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"dimensions",
"arrows",
"weights",
"claim"
],
"additionalProperties": false
}Published input example
{
"dimensions": [
2,
2
],
"arrows": [
{
"tail": 0,
"head": 1,
"matrix": [
[
1,
0
],
[
0,
0
]
]
}
],
"weights": [
{
"numerator": 1,
"denominator": 1
},
{
"numerator": -1,
"denominator": 1
}
],
"claim": null
}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.