Hub · More Tools
Datenvertragswerk
340 published endpoint URLs. Methods, prices, inputs and original documentation on every detail page.
datenvertrag.halowerk.com · Catalog updated 2026-11-17 UTC
Endpoints
241–300 of 340- Datenvertragswerk0.003 USDC
pathwidth optimal layout inventory
POSThttps://datenvertrag.halowerk.com/v1/pathwidth-optimal-layout-inventoryFor an original labelled simple undirected graph n0..5 including disconnected and empty graphs, derive minimum outside-prefix vertex frontier size over ALL permutations. Return exact pathwidth, ALL minimizing orders in numeric lexicographic
- Datenvertragswerk0.003 USDC
perfect elimination order family
POSThttps://datenvertrag.halowerk.com/v1/perfect-elimination-order-familyFor one simple undirected graph with n 0..5 vertices 0..n-1 (edge_mask bit k encodes pair (u,v), u<v, in numeric lex order), reconstructs every perfect elimination order of its vertices without adding edges: for each deleted vertex, its nei
- Datenvertragswerk0.003 USDC
permutation cycle record bijection ledger
POSThttps://datenvertrag.halowerk.com/v1/permutation-cycle-record-bijection-ledgerFor a permutation P of 0..n-1, n 0..7, follows the directed map cycles, rotates each cycle to its largest value, orders cycles by increasing largest value and erases parentheses. Returns that entire transformed word, all canonical cycles, t
- Datenvertragswerk0.003 USDC
permutation group molien prefix
POSThttps://datenvertrag.halowerk.com/v1/permutation-group-molien-prefixFor a COMPLETE supplied finite permutation group G acting on n=1..4 variables by permutation over Q, return all invariant-ring Hilbert dimensions h0..hD through D=0..8. Molien formula M(t)=average_g product over disjoint cycles c of (1-t^le
- Datenvertragswerk0.003 USDC
permutation square root inventory audit
POSThttps://datenvertrag.halowerk.com/v1/permutation-square-root-inventory-auditFor a supplied permutation of1..7anonymous labels0..n-1, reconstruct every permutation q with q[q[i]]=p[i], lexicographically sorted, complete canonical source cycles and root count. Compare the entire ordered claimed-root inventory; null i
- Datenvertragswerk0.003 USDC
pfaffian orientation family
POSThttps://datenvertrag.halowerk.com/v1/pfaffian-orientation-familyFor one labelled simple undirected graph on vertices 0..n-1 (n 0..5), given as edge_mask over lexicographic pairs (u,v), u<v, generates every Pfaffian edge orientation: all perfect-matching terms of the skew adjacency Pfaffian have the same
- Datenvertragswerk0.003 USDC
pgoutput transaction scope audit
POSThttps://datenvertrag.halowerk.com/v1/pgoutput-transaction-scope-auditReconstruct bounded nonstreaming Begin/Commit transaction scopes and check Origin-before-DML plus announced-relation use in supplied normalized pgoutput messages. Null capture stops interpretation; earlier contradictions survive. No binary
- Datenvertragswerk0.003 USDC
planar lattice cone hilbert basis
POSThttps://datenvertrag.halowerk.com/v1/planar-lattice-cone-hilbert-basisFrom two original primitive integer rays left/right with coordinates0..4 in the firstquadrant and positive determinant, construct the unique Hilbert basis: ALL nonzero latticepoints in their rational cone that cannot split as sum of two non
- Datenvertragswerk0.003 USDC
planar lattice voronoi cell
POSThttps://datenvertrag.halowerk.com/v1/planar-lattice-voronoi-cellFrom two independent integer basis vectors with coordinates -2..2, constructs the planar lattice and returns its whole Voronoi cell at the origin: all rational vertices counterclockwise from the lexicographically least (x,y), all true facet
- Datenvertragswerk0.003 USDC
pointstamp completion audit
POSThttps://datenvertrag.halowerk.com/v1/pointstamp-completion-auditA streaming-runtime fixture maintainer checks whether claimed blocked/unblocked completion requests follow from a reconciled global capability/message stock and a supplied finite graph of product-time location summaries. Additive two-coordi
- Datenvertragswerk0.003 USDC
poisson binomial distribution audit
POSThttps://datenvertrag.halowerk.com/v1/poisson-binomial-distribution-auditOwn bounded BigInt polynomial convolution for <=12supplied Bernoulli marginals, denominators<=100; output reduced exact rational PMF/CDF and expectation; compare whole supplied PMF by rational equality. Independence must be explicitly suppl
- Datenvertragswerk0.003 USDC
polymatroid base vertex inventory
POSThttps://datenvertrag.halowerk.com/v1/polymatroid-base-vertex-inventoryFrom a complete integer polymatroid rank table f on labels 0..n-1 (n 0..4, ranks 0..6, length exactly 2^n, rank_table[mask] with bit i for element i), validates f(empty)=0, monotonicity and submodularity and returns every distinct vertex of
- Datenvertragswerk0.003 USDC
pop stack permutation image
POSThttps://datenvertrag.halowerk.com/v1/pop-stack-permutation-imageCompute the full image of one captured permutation under ONE deterministic POP-STACK pass. Read left to right. Before pushing a new value, if it exceeds the current stack top, empty the ENTIRE stack into the output; after the final input, e
- Datenvertragswerk0.003 USDC
poset evacuation action ledger
POSThttps://datenvertrag.halowerk.com/v1/poset-evacuation-action-ledgerReconstructs the complete Schuetzenberger evacuation action on all linear extensions of one labelled finite poset on labels 0..n-1 (n 0..4). relations is the entire strict transitive relation: row a, bit b means a<b. Extensions are enumerat
- Datenvertragswerk0.003 USDC
poset promotion action ledger
POSThttps://datenvertrag.halowerk.com/v1/poset-promotion-action-ledgerFor one arbitrary finite poset on labels 0..n-1 (n 0..4), given as the entire strict order (row u, bit v means u<v, transitive closure already captured), reconstructs the whole Schuetzenberger promotion action on all its linear extensions.
- Datenvertragswerk0.003 USDC
positive row graver basis
POSThttps://datenvertrag.halowerk.com/v1/positive-row-graver-basisGiven ONE indexed positive integer weight row a of length1..3, each weight1..3, reconstruct its ENTIRE Graver basis: every nonzero integer vector z with sum(a[i]*z[i])=0 that has no distinct nonzero kernelvector u conformally below it (same
- Datenvertragswerk0.003 USDC
precedence order index ledger
POSThttps://datenvertrag.halowerk.com/v1/precedence-order-index-ledgerFor 0..8 anonymous vertices and complete DAG precedence edges, ranks a supplied permutation among all lex-sorted topological orders and independently unranks a supplied index. Returns the exact total, the full orders and every candidate ver
- Datenvertragswerk0.003 USDC
prefix function source word family
POSThttps://datenvertrag.halowerk.com/v1/prefix-function-source-word-familyGiven a whole prefix_table of length 0..6 with integers 0<=prefix_table[i]<=i, reconstructs every word over the fixed alphabet 0,1,2 whose prefix function equals that vector exactly. Returns every word as a digit string in lexicographic ord
- Datenvertragswerk0.003 USDC
prepost binary tree fiber inventory
POSThttps://datenvertrag.halowerk.com/v1/prepost-binary-tree-fiber-inventoryFor two permutations of the same labels 0..n-1 (n 0..5), reconstructs all ordered binary trees with exactly the supplied root-left-right preorder and left-right-root postorder; unary children may be left or right, so uniqueness is not assum
- Datenvertragswerk0.003 USDC
prescribed outdegree orientation inventory
POSThttps://datenvertrag.halowerk.com/v1/prescribed-outdegree-orientation-inventoryFor a labelled simple undirected graph on 0..n-1 (n 0..4) and exact outgoing-degree demands b_i in 0..n-1, reconstructs all edge orientations meeting every demand. Returns ascending direction masks (a zero bit on canonical edge u<v directs
- Datenvertragswerk0.003 USDC
prime field discrete log ledger
POSThttps://datenvertrag.halowerk.com/v1/prime-field-discrete-log-ledgerFor supplied prime modulus2..251, nonzero basis and target residue, returns exact multiplicative order, all powers in exponent order0..order-1, target subgroup membership and canonical least nonnegative discrete logarithm if one exists. Tar
- Datenvertragswerk0.003 USDC
prime power root forest audit
POSThttps://datenvertrag.halowerk.com/v1/prime-power-root-forest-auditFor integerpolynomial coefficients in ascendingpowers, p2/3/5 and exponents1..3, reconstruct ALL residue roots at everyprimepower, including singular0/1/p-child branches and deadends. Return orderedlevels and everyparent with derivative/quo
- Datenvertragswerk0.003 USDC
primitive quadratic class inventory
POSThttps://datenvertrag.halowerk.com/v1/primitive-quadratic-class-inventoryFor an original negative discriminant D from-160through-3 with D congruent0or1mod4, reconstruct the complete primitive positive definite binary quadratic form class inventory. Return every integer[a,b,c] for ax^2+bxy+cy^2 with b^2-4ac=D,gcd
- Datenvertragswerk0.003 USDC
proposer optimal stable matching audit
POSThttps://datenvertrag.halowerk.com/v1/proposer-optimal-stable-matching-auditFor two equally sized sides n1..6 with complete strict preference permutations, independently runs deferred acceptance from each side. Returns both entire left-indexed assignments and each side personal rank vectors, and whether the stable
- Datenvertragswerk0.003 USDC
prufer tree reconstruction audit
POSThttps://datenvertrag.halowerk.com/v1/prufer-tree-reconstruction-auditOwn bounded Prufer bijection decoder on labels0..n-1,n2..32. Return all canonical undirected edges, original degrees and smallest-leaf elimination trace, then compare whole claimed edge multiset ignoring endpoint orientation/list order. Dup
- Datenvertragswerk0.003 USDC
quadratic surd periodic continued fraction
POSThttps://datenvertrag.halowerk.com/v1/quadratic-surd-periodic-continued-fractionFor the positive square-root branch value x=(sqrt(d)+p)/q with nonsquare integer d 2..31, integer p -2..2 and positive q 1..3, reconstructs the canonical regular continued fraction by floor, then reciprocal of the fractional part. Returns t
- Datenvertragswerk0.003 USDC
quadtree face balance refinement ledger
POSThttps://datenvertrag.halowerk.com/v1/quadtree-face-balance-refinement-ledgerFrom a full partition of the logical unit square into prefix-free quadtree leaf codes (max depth 3, at most 10 leaves; digits 0 SW, 1 SE, 2 NW, 3 NE), derives the unique coarsest refinement with face-neighbor level difference at most 1. Onl
- Datenvertragswerk0.003 USDC
quandle cocycle braid state sum
POSThttps://datenvertrag.halowerk.com/v1/quandle-cocycle-braid-state-sumCompute the quandle TWO-COCYCLE state-sum of the closure of one captured signed braid. table[x][y]=x*y is a finite RIGHT QUANDLE on labels0..n-1,n1..3: square/closed, each column bijective, x*x=x, (x*y)*z=(x*z)*(y*z). modulus is2or3; cocycl
- Datenvertragswerk0.003 USDC
ramanujan gcd class projection
POSThttps://datenvertrag.halowerk.com/v1/ramanujan-gcd-class-projectionFor a period vector of length 1..12 with integers -16..16 at positions 0..n-1, projects onto the subspace constant on gcd(position,n) classes. Returns every positive divisor q of n ascending, phi(q), the integer Ramanujan-sum basis row c_q(
- Datenvertragswerk0.003 USDC
rational group algebra wedderburn witness
POSThttps://datenvertrag.halowerk.com/v1/rational-group-algebra-wedderburn-witnessGiven a complete group multiplication table, construct the actual Wedderburn decomposition of its rational group algebra: simple cyclotomic fields, rational matrix blocks or the Hamilton division algebra, together with full forward and inve
- Datenvertragswerk0.003 USDC
rational ideal rees algebra hilbert series
POSThttps://datenvertrag.halowerk.com/v1/rational-ideal-rees-algebra-hilbert-seriesConstruct 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
- Datenvertragswerk0.003 USDC
rational multivariate residue local algebra
POSThttps://datenvertrag.halowerk.com/v1/rational-multivariate-residue-local-algebraFor the ordered rational complete intersection f=x^a, g=y^b+x*h(y), construct its ENTIRE origin local algebra residue-duality artifact: fixed monomial basis, both multiplication matrices, normalized residue functional on every basis monomia
- Datenvertragswerk0.003 USDC
rational point configuration secondary fan
POSThttps://datenvertrag.halowerk.com/v1/rational-point-configuration-secondary-fanConstruct the ENTIRE pointed secondary fan of an ordered strictly convex rational planar4..6point configuration, modulo affine height functions: all primitive hinge-lift rays, every regular triangulation chamber, exact GKZ twice-area coordi
- Datenvertragswerk0.003 USDC
rational polygon ehrhart quasipolynomial family
POSThttps://datenvertrag.halowerk.com/v1/rational-polygon-ehrhart-quasipolynomial-familyFor a fully supplied rational convex planar polygon compute its ENTIRE Ehrhart lattice-point quasipolynomial: all residue constituent degree-two polynomials, exact denominator period and least quasipolynomial period including period collaps
- Datenvertragswerk0.003 USDC
rational polyhedron projection farkas certificate
POSThttps://datenvertrag.halowerk.com/v1/rational-polyhedron-projection-farkas-certificateProject an original full-dimensional nonempty rational H-polyhedron{(y,z):A(y,z)<=b} onto ALL remaining REAL y by eliminating its last real coordinate z. Source dimension2or3,0..6inequalities,canonical rationals numerator abs<=4/denominator
- Datenvertragswerk0.003 USDC
rational polynomial bezout ledger
POSThttps://datenvertrag.halowerk.com/v1/rational-polynomial-bezout-ledgerFor two integer polynomials of degree <=3 in ascending powers, returns the monic gcd G over Q[x], the exact quotients A/G and B/G, and rational S, T with SA+TB=G. The canonical S has degree < deg(B/G); B=0 uses S=1/lead(A), T=0; both zero y
- Datenvertragswerk0.003 USDC
rational polynomial sturm tarski query
POSThttps://datenvertrag.halowerk.com/v1/rational-polynomial-sturm-tarski-queryComputes a Sturm-Tarski query: the sum of sign(Q(x)) over the distinct real zeros of P in the open interval (a,b) (positive +1, negative -1, Q zero 0); repeated zeros of P count once. Inputs are rational coefficients in ascending powers (P
- Datenvertragswerk0.003 USDC
rational polytope minkowski indecomposability witness
POSThttps://datenvertrag.halowerk.com/v1/rational-polytope-minkowski-indecomposability-witnessFrom the ORIGINAL complete extreme vertices of a rational convex3polytope, determine its entire Minkowski edge length deformation cone and whether EVERY real convex Minkowski summand is a translated dilation. Derive all supporting facet cyc
- Datenvertragswerk0.003 USDC
rational radix expansion audit
POSThttps://datenvertrag.halowerk.com/v1/rational-radix-expansion-auditFor a supplied exact signed rational and base2..16, return integer digits, shortest nonrepeating fractional prefix, minimal repeating block, reduced fraction and full finite remainder-cycle witness, then compare the entire canonical expansi
- Datenvertragswerk0.003 USDC
rational weighted automaton minimal realization
POSThttps://datenvertrag.halowerk.com/v1/rational-weighted-automaton-minimal-realizationGiven a fully supplied rational weighted automaton alpha M(word) beta of dimension1..3 over1..2 ordered symbols, reconstruct a canonical minimum-dimensional linear realization of the ENTIRE word-to-rational series. Entries of original autom
- Datenvertragswerk0.003 USDC
rational zonotope fine tiling flip graph
POSThttps://datenvertrag.halowerk.com/v1/rational-zonotope-fine-tiling-flip-graphEnumerate EVERY fine parallelogram tiling of a planar zonogon from2..4 ordered rational generating vectors, and the ENTIRE elementary3-tile hexagon flip graph. Return exact global vertex coordinates, every used pair/base-mask cell with its4
- Datenvertragswerk0.003 USDC
reader row lineage audit
POSThttps://datenvertrag.halowerk.com/v1/reader-row-lineage-auditAn Iceberg-v3 reader fixture maintainer audits inherited row-lineage claims from ordered manifest entries and physical row positions,while retaining explicitly stored lineage values. Pinned Iceberg1.10.0 reader fragment only; semantic null
- Datenvertragswerk0.003 USDC
reduced adjacent swap word inventory
POSThttps://datenvertrag.halowerk.com/v1/reduced-adjacent-swap-word-inventoryFor a complete permutation of0..n-1,n0..5, construct ALL shortest words of adjacent POSITION swaps which sort it to identity. Each word lists zero-based left positions, applied left-to-right to the supplied source permutation. Return numeri
- Datenvertragswerk0.003 USDC
ribbon bollobas riordan polynomial ledger
POSThttps://datenvertrag.halowerk.com/v1/ribbon-bollobas-riordan-polynomial-ledgerComputes the complete three-variable Bollobas-Riordan polynomial of one orientable ribbon embedding of a connected simple labelled graph (n 1..4): R(u,v,w)=sum over all spanning edge subsets F of u^(r(G)-r(F))*v^nullity(F)*w^(k(F)-bc(F)+nul
- Datenvertragswerk0.003 USDC
ribbon graph partial dual ledger
POSThttps://datenvertrag.halowerk.com/v1/ribbon-graph-partial-dual-ledgerFor one orientable ribbon graph with m 0..2 labelled edges, encoded by its complete half-edge rotation permutation on darts 0..2m-1 (edge i pairs darts 2i, 2i+1), and an edge subset A given by dual_mask, constructs the entire Chmutov partia
- Datenvertragswerk0.003 USDC
rook board placement polynomial
POSThttps://datenvertrag.halowerk.com/v1/rook-board-placement-polynomialFor a complete binary board with0to4rows and0to4columns, enumerate all placements using only allowed1cells, with at most one rook per row and per column. Return the complete coefficient vector r0..rmin(rows,columns), counting each cardinali
- Datenvertragswerk0.003 USDC
rooted acyclic orientation family
POSThttps://datenvertrag.halowerk.com/v1/rooted-acyclic-orientation-familyGiven one simple undirected graph on 1..5 fixed labels 0..n-1 and a specified root, derives all acyclic orientations whose only sink is that root. Returns the canonical edges sorted (min,max), ascending direction masks (bit k 0 = lower-to-h
- Datenvertragswerk0.003 USDC
rooted labelled euler circuit family
POSThttps://datenvertrag.halowerk.com/v1/rooted-labelled-euler-circuit-familyFrom one ordered list of 0..4 directed edge records on fixed vertex labels 0,1,2 (entry code 3*u+v means arc u->v), generates every rooted closed Euler replay as a sequence of original edge indices: start at 0, keep head-to-tail adjacency,
- Datenvertragswerk0.003 USDC
rooted tree admissible cut coproduct
POSThttps://datenvertrag.halowerk.com/v1/rooted-tree-admissible-cut-coproductFor a complete rooted tree on 1..5 labels 0..n-1 (parents[0]=-1, root 0), reconstructs the commutative nonplanar Connes-Kreimer coproduct Delta(T)=sum coefficient*forest tensor trunk, pruned forest on the left, root trunk on the right. Admi
- Datenvertragswerk0.003 USDC
rooted triplet tree family
POSThttps://datenvertrag.halowerk.com/v1/rooted-triplet-tree-familyFor 1..4 taxon labels 0..n-1 and up to 12 rooted triplets [a,b,c] with a<b and all three distinct, constructs all full binary rooted trees displaying every ab|c, i.e. lca(a,b) strictly below lca(a,c)=lca(b,c). Returns the lexicographic Newi
- Datenvertragswerk0.003 USDC
rotor router tree action ledger
POSThttps://datenvertrag.halowerk.com/v1/rotor-router-tree-action-ledgerFrom ONE original connected simple UNDIRECTED labelled graph on vertices0..n with1..3 NONSINK vertices0..n-1 and sink=n, a supplied original sink-rooted spanning TREE parent vector and a chip start<n, compute the rotor-router chip-addition
- Datenvertragswerk0.003 USDC
sandpile burning tree bijection ledger
POSThttps://datenvertrag.halowerk.com/v1/sandpile-burning-tree-bijection-ledgerFrom one recurrent stable sandpile on a connected simple undirected labelled graph with 0..3 non-sink vertices 0..n-1 and sink=n, reconstructs its whole Majumdar-Dhar burning-bijection tree. Inputs are edge_mask over lexicographic pairs (u,
- Datenvertragswerk0.003 USDC
sandpile group addition table ledger
POSThttps://datenvertrag.halowerk.com/v1/sandpile-group-addition-table-ledgerFor a connected simple undirected labelled graph with 0..3 non-sink vertices 0..n-1 and sink=n, reconstructs its whole finite recurrent sandpile group. Returns every recurrent stable chip vector in numeric lexicographic order as indexed ele
- Datenvertragswerk0.003 USDC
sandpile recurrent configuration inventory
POSThttps://datenvertrag.halowerk.com/v1/sandpile-recurrent-configuration-inventoryFrom an original loopless undirected multigraph with1..3nonsink vertices and sink at index n, symmetric edge multiplicities0..2 and every vertex connected to sink, enumerate ALL recurrent stable chip configurations in lexicographic order. R
- Datenvertragswerk0.003 USDC
scd2 validity ledger
POSThttps://datenvertrag.halowerk.com/v1/scd2-validity-ledgerCheck a bounded corrected dimension history before a data agent publishes it. Caller-supplied pseudonyms/hashes only; no external identity claim. Conflicting selected hashes yield not_observed; missing coverage yields unknown. A schema-vali
- Datenvertragswerk0.003 USDC
semigroup factorization lengths
POSThttps://datenvertrag.halowerk.com/v1/semigroup-factorization-lengthsGiven 1..8 distinct positive generators 1..32 with collective gcd 1 and a target 0..128, returns every distinct length (sum of coefficients) of a nonnegative generator-coefficient factorization of that target, sorted ascending, plus delta_s
- Datenvertragswerk0.003 USDC
semistandard shape weight family
POSThttps://datenvertrag.halowerk.com/v1/semistandard-shape-weight-familyFor an original partition shape with at most7cells and exactly three nonnegative content counts summing to that size, reconstruct ALL semistandard Young tableaux on letters1,2,3. English convention: longer left-aligned rows above, rows weak
- Datenvertragswerk0.003 USDC
serial order cycle audit
POSThttps://datenvertrag.halowerk.com/v1/serial-order-cycle-auditReconstruct complete RFC1982 serial comparisons from original finite snapshot-value domains: equal/less/greater/undefined, every half-circle incomparable pair, every directed triangle witness and indices not older than every value under def
- Datenvertragswerk0.003 USDC
serial32 update replay
POSThttps://datenvertrag.halowerk.com/v1/serial32-update-replayApply RFC1982 wrapped32bit serial ordering to a supplied finite accept-strictly-newer receiver policy. Return every checked proposal, known accepted-prefix count and state; ignore equal/older proposals. Half-space ordering is undefined and
- Datenvertragswerk0.003 USDC
set functor grothendieck category
POSThttps://datenvertrag.halowerk.com/v1/set-functor-grothendieck-categoryConstruct the Grothendieck category of elements of a supplied COVARIANT finite Set-valued functor F:C->Set. Base objects are0..n-1 from fiber_sizes; arrows are0..m-1 from source/target; identities[c] names id_c. composition[g][f] means g AF