Datenvertragswerk
association scheme primitive idempotent pairings
For a labelled symmetric association-scheme relation matrix on 1..6 points, reconstructs every primitive Bose-Mesner projector in the original vertex basis, the ranks, the eigenmatrices P and Q and all Krein coefficients q[i][j][k], with Ei Hadamard Ej = (1/n) sum_k q[i][j][k] Ek. E0 = J/n comes first. Exact coefficients [a,b] mean a+b*sqrt(5), given as reduced rational strings p/q. Every relation class 0..d must occur, with class 0 exactly the diagonal.
POST https://datenvertrag.halowerk.com/v1/association-scheme-primitive-idempotent-pairingsInputs
| Field | Type | Required | Description |
|---|---|---|---|
| relation_matrix | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"relation_matrix": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"coefficient_encoding": {
"type": "object",
"properties": {
"type": {
"const": "quadratic_pair"
},
"value": {
"const": "a+b*sqrt(5)"
},
"positive_sqrt_embedding": {
"const": true
},
"rational_parts_reduced": {
"const": true
}
},
"required": [
"type",
"value",
"positive_sqrt_embedding",
"rational_parts_reduced"
],
"additionalProperties": false
},
"splitting_field": {
"enum": [
"Q",
"Q(sqrt(5))"
]
},
"primitive_order": {
"const": "E0=J/v;remaining eigenvalue rows lexicographic in relation order using exact real comparison."
},
"vertex_count": {
"type": "integer",
"minimum": 1,
"maximum": 6
},
"multiplicities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 6
},
"minItems": 1,
"maxItems": 6
},
"first_eigenmatrix_P": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^(0|-[1-9][0-9]*|[1-9][0-9]*)/[1-9][0-9]*$",
"maxLength": 13
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
"second_eigenmatrix_Q": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^(0|-[1-9][0-9]*|[1-9][0-9]*)/[1-9][0-9]*$",
"maxLength": 13
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
"primitive_idempotents": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^(0|-[1-9][0-9]*|[1-9][0-9]*)/[1-9][0-9]*$",
"maxLength": 13
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
"krein_parameters": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^(0|-[1-9][0-9]*|[1-9][0-9]*)/[1-9][0-9]*$",
"maxLength": 13
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
}
},
"required": [
"coefficient_encoding",
"splitting_field",
"primitive_order",
"vertex_count",
"multiplicities",
"first_eigenmatrix_P",
"second_eigenmatrix_Q",
"primitive_idempotents",
"krein_parameters"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"relation_matrix",
"claim"
],
"additionalProperties": false
}Published input example
{
"relation_matrix": [
[
0,
1,
1
],
[
1,
0,
1
],
[
1,
1,
0
]
],
"claim": {
"coefficient_encoding": {
"type": "quadratic_pair",
"value": "a+b*sqrt(5)",
"positive_sqrt_embedding": true,
"rational_parts_reduced": true
},
"splitting_field": "Q",
"primitive_order": "E0=J/v;remaining eigenvalue rows lexicographic in relation order using exact real comparison.",
"vertex_count": 3,
"multiplicities": [
1,
2
],
"first_eigenmatrix_P": [
[
[
"1/1",
"0/1"
],
[
"2/1",
"0/1"
]
],
[
[
"1/1",
"0/1"
],
[
"-1/1",
"0/1"
]
]
],
"second_eigenmatrix_Q": [
[
[
"1/1",
"0/1"
],
[
"2/1",
"0/1"
]
],
[
[
"1/1",
"0/1"
],
[
"-1/1",
"0/1"
]
]
],
"primitive_idempotents": [
[
[
[
"1/3",
"0/1"
],
[
"1/3",
"0/1"
],
[
"1/3",
"0/1"
]
],
[
[
"1/3",
"0/1"
],
[
"1/3",
"0/1"
],
[
"1/3",
"0/1"
]
],
[
[
"1/3",
"0/1"
],
[
"1/3",
"0/1"
],
[
"1/3",
"0/1"
]
]
],
[
[
[
"2/3",
"0/1"
],
[
"-1/3",
"0/1"
],
[
"-1/3",
"0/1"
]
],
[
[
"-1/3",
"0/1"
],
[
"2/3",
"0/1"
],
[
"-1/3",
"0/1"
]
],
[
[
"-1/3",
"0/1"
],
[
"-1/3",
"0/1"
],
[
"2/3",
"0/1"
]
]
]
],
"krein_parameters": [
[
[
[
"1/1",
"0/1"
],
[
"0/1",
"0/1"
]
],
[
[
"0/1",
"0/1"
],
[
"1/1",
"0/1"
]
]
],
[
[
[
"0/1",
"0/1"
],
[
"1/1",
"0/1"
]
],
[
[
"2/1",
"0/1"
],
[
"1/1",
"0/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.