Datenvertragswerk
rational ideal rees algebra hilbert series
Construct the ENTIRE trigraded Rees algebra Hilbert series of I=(c1*x^a1*y^b1,c2*x^a2*y^b2) inside Q[x,y,t], retaining original ordered generator labels T1,T2. Exactlytwo nonzero rational monomial generators, exponents0..3; neither divides the other, so they are the actual minimal generators. Coefficient numerator -3..3 excluding0,positive denominator1..3. Degrees x=(1,0,0),y=(0,1,0),Ti=(ai,bi,1). Return exact reduced numerator1-X^lcm*t and denominator factors(1-x)(1-y)(1-X^u*t)(1-X^v*t),.
POST https://datenvertrag.halowerk.com/v1/rational-ideal-rees-algebra-hilbert-seriesInputs
| Field | Type | Required | Description |
|---|---|---|---|
| generators | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"generators": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"coefficient": {
"type": "object",
"properties": {
"num": {
"type": "integer",
"minimum": -3,
"maximum": 3
},
"den": {
"type": "integer",
"minimum": 1,
"maximum": 3
}
},
"required": [
"num",
"den"
],
"additionalProperties": false
},
"exponents": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
}
},
"required": [
"coefficient",
"exponents"
],
"additionalProperties": false
},
"minItems": 2,
"maxItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"generator_multidegrees": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 3,
"maxItems": 3
},
"minItems": 2,
"maxItems": 2
},
"gcd_exponents": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"kernel_vector": {
"type": "array",
"items": {
"type": "integer",
"minimum": -3,
"maximum": 3
},
"minItems": 4,
"maxItems": 4
},
"relation_terms": {
"type": "array",
"items": {
"type": "object",
"properties": {
"exponents": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 4,
"maxItems": 4
},
"coefficient": {
"type": "object",
"properties": {
"num": {
"type": "integer",
"minimum": -9,
"maximum": 9
},
"den": {
"type": "integer",
"minimum": 1,
"maximum": 9
}
},
"required": [
"num",
"den"
],
"additionalProperties": false
}
},
"required": [
"exponents",
"coefficient"
],
"additionalProperties": false
},
"minItems": 2,
"maxItems": 2
},
"relation_multidegree": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 3,
"maxItems": 3
},
"hilbert_numerator": {
"type": "array",
"items": {
"type": "object",
"properties": {
"degree": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 3,
"maxItems": 3
},
"coefficient": {
"type": "integer",
"minimum": -1,
"maximum": 1
}
},
"required": [
"degree",
"coefficient"
],
"additionalProperties": false
},
"minItems": 2,
"maxItems": 2
},
"hilbert_denominator_degrees": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 3,
"maxItems": 3
},
"minItems": 4,
"maxItems": 4
},
"dimension": {
"const": 3
},
"complete": {
"const": true
}
},
"required": [
"generator_multidegrees",
"gcd_exponents",
"kernel_vector",
"relation_terms",
"relation_multidegree",
"hilbert_numerator",
"hilbert_denominator_degrees",
"dimension",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"generators"
],
"additionalProperties": false
}Published input example
{
"generators": [
{
"coefficient": {
"num": 1,
"den": 1
},
"exponents": [
1,
0
]
},
{
"coefficient": {
"num": 1,
"den": 1
},
"exponents": [
0,
1
]
}
]
}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.