Datenvertragswerk
finite quiver auslander reiten mesh
Compute the complete Auslander Reiten quiver and all almost split exact sequences of ALL finite dimensional representations of an original labelled acyclic path quiver A1 A2 or A3 over F2 or F3. Return every interval indecomposable, complete normalized Hom bases, irreducible vertex maps, projective injective flags, translation and signed mesh maps. For each sequence return full exact factorization coefficient tables for EVERY indecomposable and EVERY nonretraction into the target and.
POST https://datenvertrag.halowerk.com/v1/finite-quiver-auslander-reiten-meshInputs
| Field | Type | Required | Description |
|---|---|---|---|
| field | See schema | Yes | |
| vertices | See schema | Yes | |
| arrows | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"field",
"vertices",
"arrows",
"claim"
],
"properties": {
"field": {
"anyOf": [
{
"enum": [
2,
3
]
},
{
"type": "null"
}
]
},
"vertices": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"arrows": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"indecomposables",
"hom_table",
"irreducible_maps",
"almost_split_sequences"
],
"properties": {
"indecomposables": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"support",
"dimensions",
"arrow_scalars",
"projective",
"injective"
],
"properties": {
"support": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 1,
"maxItems": 3
},
"arrow_scalars": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 2
},
"projective": {
"type": "boolean"
},
"injective": {
"type": "boolean"
}
}
},
"minItems": 1,
"maxItems": 6
},
"hom_table": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"source",
"target",
"dimension",
"basis"
],
"properties": {
"source": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"target": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"dimension": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"basis": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
}
}
},
"minItems": 1,
"maxItems": 36
},
"irreducible_maps": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"source",
"target",
"map"
],
"properties": {
"source": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"target": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"map": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 1,
"maxItems": 3
}
}
},
"minItems": 0,
"maxItems": 30
},
"almost_split_sequences": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"target",
"tau",
"middle",
"alpha",
"beta",
"right_factorizations",
"left_factorizations"
],
"properties": {
"target": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"tau": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"middle": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"minItems": 1,
"maxItems": 6
},
"alpha": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 6
},
"beta": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 6
},
"right_factorizations": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"object",
"morphism",
"factors"
],
"properties": {
"object": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"morphism": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"factors": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 6
}
}
},
"minItems": 1,
"maxItems": 16
},
"left_factorizations": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"object",
"morphism",
"factors"
],
"properties": {
"object": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"morphism": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"factors": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 6
}
}
},
"minItems": 1,
"maxItems": 16
}
}
},
"minItems": 0,
"maxItems": 3
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"field": 2,
"vertices": 2,
"arrows": [
[
0,
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.