Datenvertragswerk
finite field quiver representation orbits
For one labelled quiver over F2/F3, fixed vertex dimensions1..2 on1..2vertices and0..2indexed arrows, enumerate ALL representations and their entire isomorphism orbit partition under the product of vertex GL groups. Loops and parallel arrows allowed. Total arrow matrix cells<=4 and basechange group order<=96, not novelty from bounds. Return lexleast representative of every orbit, all members with lexleast actual intertwining invertible witnesses, ALL stabilizers and orders. Matrices flat.
POST https://datenvertrag.halowerk.com/v1/finite-field-quiver-representation-orbitsInputs
| Field | Type | Required | Description |
|---|---|---|---|
| quiver | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"quiver": {
"anyOf": [
{
"type": "object",
"properties": {
"field": {
"enum": [
2,
3
]
},
"dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"minItems": 1,
"maxItems": 2
},
"arrows": {
"type": "array",
"items": {
"type": "object",
"properties": {
"source": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"target": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
},
"required": [
"source",
"target"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 2
}
},
"required": [
"field",
"dimensions",
"arrows"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"representation_count": {
"type": "integer",
"minimum": 1,
"maximum": 81
},
"base_change_group_size": {
"type": "integer",
"minimum": 1,
"maximum": 96
},
"orbit_count": {
"type": "integer",
"minimum": 1,
"maximum": 81
},
"orbits": {
"type": "array",
"items": {
"type": "object",
"properties": {
"canonical_representative": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 4
},
"minItems": 0,
"maxItems": 2
},
"orbit_size": {
"type": "integer",
"minimum": 1,
"maximum": 81
},
"stabilizer_size": {
"type": "integer",
"minimum": 1,
"maximum": 96
},
"stabilizers": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 2
},
"minItems": 1,
"maxItems": 96
},
"all_members_and_isomorphisms": {
"type": "array",
"items": {
"type": "object",
"properties": {
"matrices": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 4
},
"minItems": 0,
"maxItems": 2
},
"basis_change": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 2
}
},
"required": [
"matrices",
"basis_change"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 81
},
"decomposable": {
"type": "boolean"
},
"split_idempotent": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 2
},
{
"type": "null"
}
]
}
},
"required": [
"canonical_representative",
"orbit_size",
"stabilizer_size",
"stabilizers",
"all_members_and_isomorphisms",
"decomposable",
"split_idempotent"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 81
}
},
"required": [
"representation_count",
"base_change_group_size",
"orbit_count",
"orbits"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"quiver",
"claim"
],
"additionalProperties": false
}Published input example
{
"quiver": {
"field": 2,
"dimensions": [
1,
1
],
"arrows": [
{
"source": 0,
"target": 1
}
]
},
"claim": {
"representation_count": 2,
"base_change_group_size": 1,
"orbit_count": 2,
"orbits": [
{
"canonical_representative": [
[
0
]
],
"orbit_size": 1,
"stabilizer_size": 1,
"stabilizers": [
[
[
1
],
[
1
]
]
],
"all_members_and_isomorphisms": [
{
"matrices": [
[
0
]
],
"basis_change": [
[
1
],
[
1
]
]
}
],
"decomposable": true,
"split_idempotent": [
[
0
],
[
1
]
]
},
{
"canonical_representative": [
[
1
]
],
"orbit_size": 1,
"stabilizer_size": 1,
"stabilizers": [
[
[
1
],
[
1
]
]
],
"all_members_and_isomorphisms": [
{
"matrices": [
[
1
]
],
"basis_change": [
[
1
],
[
1
]
]
}
],
"decomposable": false,
"split_idempotent": 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.