Datenvertragswerk
finite affine plane quasifield coordinatization
Construct a finite affine-plane incidence with q2..9, points0..q^2-1, lines exactlyq(q+1) distinct qpointsets, supplied noncollinear affine frame[O,X,Y]. Validate all affine-plane incidence axioms and frame. Canonical xaxisOX labelsO=0,X=1,remainingpoints ascending originalID. Vertical directionOY, horizontalOX; E is verticalthroughX intersect horizontalthroughY. DiagonalOE identifies xaxis labels with yaxis via vertical-to-diagonal then horizontal-to-yaxis. Every original point returns its.
POST https://datenvertrag.halowerk.com/v1/finite-affine-plane-quasifield-coordinatizationInputs
| Field | Type | Required | Description |
|---|---|---|---|
| q | integer | Yes | |
| lines | See schema | Yes | |
| frame | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"q": {
"type": "integer",
"minimum": 2,
"maximum": 9
},
"lines": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 80
},
"minItems": 2,
"maxItems": 9
},
"minItems": 6,
"maxItems": 90
},
{
"type": "null"
}
]
},
"frame": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 80
},
"minItems": 3,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"point_coordinates": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 81
},
"line_coordinates": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 3,
"maxItems": 3
},
"minItems": 0,
"maxItems": 90
},
"ternary_table": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 0,
"maxItems": 729
},
"addition_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 0,
"maxItems": 9
},
"minItems": 0,
"maxItems": 9
},
"multiplication_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 0,
"maxItems": 9
},
"minItems": 0,
"maxItems": 9
},
"is_right_quasifield": {
"type": "boolean"
},
"obstruction": {
"anyOf": [
{
"type": "object",
"properties": {
"axiom": {
"type": "string",
"maxLength": 40
},
"witness": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 0,
"maxItems": 4
}
},
"required": [
"axiom",
"witness"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"point_coordinates",
"line_coordinates",
"ternary_table",
"addition_table",
"multiplication_table",
"is_right_quasifield",
"obstruction"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"q",
"lines",
"frame",
"claim"
],
"additionalProperties": false
}Published input example
{
"q": 2,
"lines": [
[
0,
1
],
[
2,
3
],
[
0,
2
],
[
1,
3
],
[
0,
3
],
[
1,
2
]
],
"frame": [
0,
2,
1
],
"claim": {
"point_coordinates": [
[
0,
0
],
[
0,
1
],
[
1,
0
],
[
1,
1
]
],
"line_coordinates": [
[
0,
0,
0
],
[
0,
1,
0
],
[
1,
0,
0
],
[
1,
0,
1
],
[
1,
1,
0
],
[
1,
1,
1
]
],
"ternary_table": [
0,
1,
0,
1,
0,
1,
1,
0
],
"addition_table": [
[
0,
1
],
[
1,
0
]
],
"multiplication_table": [
[
0,
0
],
[
0,
1
]
],
"is_right_quasifield": true,
"obstruction": 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.