Datenvertragswerk
max plus spectral projector eigencone
From one all-finite irreducible integer max-plus matrix, returns its entire canonical max-linear spectral projector Q, the exact rational eigenvalue, right eigencone generators and critical graph certificates. Multiplication is max of sums with column action (A*x)_i=max_j(A_ij+x_j). With B=A-lambda and K=B*, Q_ij=max over all critical k of K_ik+K_kj; Q projects every finite input vector onto the eigencone and satisfies Q*Q=Q and B*Q=Q*B=Q.
POST https://datenvertrag.halowerk.com/v1/max-plus-spectral-projector-eigenconeInputs
| Field | Type | Required | Description |
|---|---|---|---|
| matrix | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"matrix",
"claim"
],
"properties": {
"matrix": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": -20,
"maximum": 20
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"eigenvalue",
"critical_graph",
"critical_classes",
"generator_representatives",
"generators",
"spectral_projector",
"critical_cycle_witnesses",
"projector_critical_witness"
],
"properties": {
"eigenvalue": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$",
"maxLength": 24
},
"critical_graph": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "boolean"
}
}
},
"critical_classes": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
},
"generator_representatives": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"generators": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$",
"maxLength": 24
}
}
},
"spectral_projector": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$",
"maxLength": 24
}
}
},
"critical_cycle_witnesses": {
"type": "array",
"minItems": 1,
"maxItems": 16,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"edge",
"cycle",
"weight",
"length"
],
"properties": {
"edge": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"cycle": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"weight": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]*)$",
"maxLength": 8
},
"length": {
"type": "integer",
"minimum": 1,
"maximum": 4
}
}
}
},
"projector_critical_witness": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"matrix": [
[
0,
-2
],
[
-3,
-1
]
],
"claim": {
"eigenvalue": "0",
"critical_graph": [
[
true,
false
],
[
false,
false
]
],
"critical_classes": [
[
0
]
],
"generator_representatives": [
0
],
"generators": [
[
"0",
"-3"
]
],
"spectral_projector": [
[
"0",
"-2"
],
[
"-3",
"-5"
]
],
"critical_cycle_witnesses": [
{
"edge": [
0,
0
],
"cycle": [
0
],
"weight": "0",
"length": 1
}
],
"projector_critical_witness": [
[
0,
0
],
[
0,
0
]
]
}
}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.