Datenvertragswerk
finite coxeter weak order congruence quotient
From a genuine finite Coxeter MATRIX whose group has order<=6, construct the entire RIGHT weakorder and its least lattice congruence generated by supplied contracted covers. Return full quotient order/join/meet, shortlex reducedwords and joinirreducible forcing. This profile includes every Coxeter type of order<=6: rank<=2 follows from |W|>=2^rank; rank2 offdiagonal m is2or3 and group is the exact dihedral model. Rank0 is trivial,rank1 C2. Rank2 group labels are lex(a,b), a0..m-1,b0or1;.
POST https://datenvertrag.halowerk.com/v1/finite-coxeter-weak-order-congruence-quotientInputs
| Field | Type | Required | Description |
|---|---|---|---|
| coxeter_matrix | See schema | Yes | |
| contracted_covers | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"coxeter_matrix",
"contracted_covers",
"claim"
],
"properties": {
"coxeter_matrix": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
}
}
},
{
"type": "null"
}
]
},
"contracted_covers": {
"anyOf": [
{
"type": "array",
"maxItems": 15,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"group_labels",
"reduced_words",
"weak_covers",
"classes",
"quotient_order",
"quotient_join",
"quotient_meet",
"join_irreducible_edges",
"forcing_matrix",
"contracted_join_irreducibles"
],
"properties": {
"group_labels": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
},
"reduced_words": {
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
}
},
"weak_covers": {
"type": "array",
"maxItems": 15,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"classes": {
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"quotient_order": {
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "boolean"
}
}
},
"quotient_join": {
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"quotient_meet": {
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"join_irreducible_edges": {
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"forcing_matrix": {
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "boolean"
}
}
},
"contracted_join_irreducibles": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"coxeter_matrix": [
[
1,
3
],
[
3,
1
]
],
"contracted_covers": [],
"claim": {
"group_labels": [
0,
1,
2,
3,
4,
5
],
"reduced_words": [
[],
[
0
],
[
1,
0
],
[
1
],
[
0,
1
],
[
0,
1,
0
]
],
"weak_covers": [
[
0,
1
],
[
0,
3
],
[
1,
4
],
[
2,
5
],
[
3,
2
],
[
4,
5
]
],
"classes": [
[
0
],
[
1
],
[
2
],
[
3
],
[
4
],
[
5
]
],
"quotient_order": [
[
true,
true,
true,
true,
true,
true
],
[
false,
true,
false,
false,
true,
true
],
[
false,
false,
true,
false,
false,
true
],
[
false,
false,
true,
true,
false,
true
],
[
false,
false,
false,
false,
true,
true
],
[
false,
false,
false,
false,
false,
true
]
],
"quotient_join": [
[
0,
1,
2,
3,
4,
5
],
[
1,
1,
5,
5,
4,
5
],
[
2,
5,
2,
2,
5,
5
],
[
3,
5,
2,
3,
5,
5
],
[
4,
4,
5,
5,
4,
5
],
[
5,
5,
5,
5,
5,
5
]
],
"quotient_meet": [
[
0,
0,
0,
0,
0,
0
],
[
0,
1,
0,
0,
1,
1
],
[
0,
0,
2,
3,
0,
2
],
[
0,
0,
3,
3,
0,
3
],
[
0,
1,
0,
0,
4,
4
],
[
0,
1,
2,
3,
4,
5
]
],
"join_irreducible_edges": [
[
0,
1
],
[
0,
3
],
[
1,
4
],
[
3,
2
]
],
"forcing_matrix": [
[
true,
false,
true,
true
],
[
false,
true,
true,
true
],
[
false,
false,
true,
false
],
[
false,
false,
false,
true
]
],
"contracted_join_irreducibles": []
}
}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.