Datenvertragswerk
finite incidence spectral design certificate
For original point labels0..v-1 with v2..5 and1..6 indexed block masks, construct point degrees, original block sizes, point concurrence M M^T and every block intersection M^T M. Bit i means point i belongs to that block; preserve duplicate/empty blocks and original order. Return exact integer coefficients of det(xI-MM^T) ascending in x. bibd is true exactly when every block has one common size k with2<=k<v, all point degrees equal r and all DISTINCT point pairs occur in one common positive.
POST https://datenvertrag.halowerk.com/v1/finite-incidence-spectral-design-certificateInputs
| Field | Type | Required | Description |
|---|---|---|---|
| v | See schema | Yes | |
| blocks | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"v": {
"anyOf": [
{
"type": "integer",
"minimum": 2,
"maximum": 5
},
{
"type": "null"
}
]
},
"blocks": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"point_degrees": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 2,
"maxItems": 5
},
"block_sizes": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"point_concurrence": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 2,
"maxItems": 5
},
"minItems": 2,
"maxItems": 5
},
"block_intersections": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
"gram_characteristic": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1000000000,
"maximum": 1000000000
},
"minItems": 3,
"maxItems": 6
},
"bibd": {
"type": "boolean"
},
"parameters": {
"anyOf": [
{
"type": "object",
"properties": {
"v": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"b": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"r": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"k": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"lambda": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
},
"required": [
"v",
"b",
"r",
"k",
"lambda"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"bibd_spectrum": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 36
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 2
},
{
"type": "null"
}
]
}
},
"required": [
"point_degrees",
"block_sizes",
"point_concurrence",
"block_intersections",
"gram_characteristic",
"bibd",
"parameters",
"bibd_spectrum"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"v",
"blocks",
"claim"
],
"additionalProperties": false
}Published input example
{
"v": 3,
"blocks": [
3,
5,
6
],
"claim": {
"point_degrees": [
2,
2,
2
],
"block_sizes": [
2,
2,
2
],
"point_concurrence": [
[
2,
1,
1
],
[
1,
2,
1
],
[
1,
1,
2
]
],
"block_intersections": [
[
2,
1,
1
],
[
1,
2,
1
],
[
1,
1,
2
]
],
"gram_characteristic": [
-4,
9,
-6,
1
],
"bibd": true,
"parameters": {
"v": 3,
"b": 3,
"r": 2,
"k": 2,
"lambda": 1
},
"bibd_spectrum": [
[
1,
2
],
[
4,
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.