HALOWERKDatenvertragswerk
binary matroid tutte audit
For supplied rectangular1..4by0..8binarymatrix, returns rank, every nonzero integer Tutte coefficient ordered(x_degree,y_degree), every originalcolumn-index bitmask basis, basiscount and loop/coloop masks. Admits nongraphic binarymatroids, including simple7element rank3Fano. A graphTutte input only covers graphic cyclematroids; this is not that profile. Whole canonical polynomial/basis/rank claim checked. Emptygroundset hasT=1 and singleemptybasis mask0. Nullentry/claim unknown; known.
POST https://datenvertrag.halowerk.com/v1/binary-matroid-tutte-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| matrix | array | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"matrix": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"maxItems": 8,
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1
},
{
"type": "null"
}
]
}
}
},
"claimed": {
"anyOf": [
{
"type": "object",
"properties": {
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"terms": {
"type": "array",
"maxItems": 45,
"items": {
"type": "object",
"properties": {
"x_degree": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"y_degree": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"coefficient": {
"type": "integer",
"minimum": 1,
"maximum": 256
}
},
"required": [
"x_degree",
"y_degree",
"coefficient"
],
"additionalProperties": false
}
},
"basis_masks": {
"type": "array",
"maxItems": 256,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 255
}
}
},
"required": [
"rank",
"terms",
"basis_masks"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"matrix",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"matrix": [
[
1,
0,
1,
0,
1,
0,
1
],
[
0,
1,
1,
0,
0,
1,
1
],
[
0,
0,
0,
1,
1,
1,
1
]
],
"claimed": {
"rank": 3,
"terms": [
{
"x_degree": 0,
"y_degree": 1,
"coefficient": 3
},
{
"x_degree": 0,
"y_degree": 2,
"coefficient": 6
},
{
"x_degree": 0,
"y_degree": 3,
"coefficient": 3
},
{
"x_degree": 0,
"y_degree": 4,
"coefficient": 1
},
{
"x_degree": 1,
"y_degree": 0,
"coefficient": 3
},
{
"x_degree": 1,
"y_degree": 1,
"coefficient": 7
},
{
"x_degree": 2,
"y_degree": 0,
"coefficient": 4
},
{
"x_degree": 3,
"y_degree": 0,
"coefficient": 1
}
],
"basis_masks": [
11,
13,
14,
19,
21,
22,
26,
28,
35,
37,
38,
41,
44,
49,
50,
56,
67,
69,
70,
73,
74,
81,
84,
88,
98,
100,
104,
112
]
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden