Datenvertragswerk
free subgroup stallings core
From original generator WORDS of a subgroup H of the free group F(a,b), construct its entire folded pointed CORE graph, subgroup rank and exact membership witnesses for supplied words. Signed letters1,-1,2,-2 mean a,a-inverse,b,b-inverse. Freely reduce generator and query words, preserving the based subgroup rather than conjugacy class. Start with generator loops, fold equally labelled outgoing edges including formal inverses, and remove degree-one vertices OTHER THAN THE BASE. A conjugating.
POST https://datenvertrag.halowerk.com/v1/free-subgroup-stallings-coreInputs
| Field | Type | Required | Description |
|---|---|---|---|
| generators | See schema | Yes | |
| queries | array | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"generators": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
1,
-1,
2,
-2
]
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 2
},
{
"type": "null"
}
]
},
"queries": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
1,
-1,
2,
-2
]
},
"minItems": 0,
"maxItems": 8
},
"minItems": 0,
"maxItems": 8
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 4
},
"minItems": 4,
"maxItems": 4
},
"minItems": 1,
"maxItems": 5
},
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"members": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 0,
"maxItems": 8
}
},
"required": [
"transitions",
"rank",
"members"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"generators",
"queries",
"claim"
],
"additionalProperties": false
}Published input example
{
"generators": [],
"queries": [
[],
[
1
],
[
-1
],
[
2
],
[
-2
],
[
1,
2,
-1
],
[
1,
1
],
[
1,
-1,
2,
-2
]
],
"claim": 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.