Over quasi-pseudometric spaces, a GSOS law gives every model a least distance for which its coalgebra is nonexpansive, and every context is then nonexpansive with the modulus of its symbols. No final coalgebra is needed, so bisimilarity is a congruence even for unbounded branching, and similarity a precongruence for positive rules. For probabilistic specifications, Kantorovich envelopes compute the moduli from the rules, and for the standard process algebra no modulus does better.
The free models of a GSOS law resolve every model and give it a comonad homology. For polynomial behaviour, the Beck modules are the representations of a linearisation, generated by partial derivatives and transitions under a chain rule. With coefficients in the differentials, a complex of length two drawn on the model computes the homology, and its first group embeds into the relations of a presentation modulo their consequences. Constant coefficients exist exactly for linear rules, and they bound from below the number of relations of every presentation.
L. Melodia · hexagon:2610.00218 · with a Lean 4 formalisation.
A clopen partition of each nerve space cuts a finite chain model out of the Matui complex of an ample groupoid . Helly axioms on the covers constrain nothing, while laminar presentations bound the rank of a model by the size of the cover and, for second countable , give a complete system of models. No single model suffices in general: over is not finitely generated for the Cantor set.
For a simple distributive law , the comonad of free bialgebras resolves every model, and a coefficient functor turns the resolution into a chain complex. For linear rules with observational coefficients its homology reduces to two groups, which one Smith normal form computes. In degree one it finds laws that hold in a model but not in the free one, such as .
A quantitative equational theory gives every metric space a free algebra . Filtering its length nerve by length yields a persistence module whose associated graded is the magnitude complex, and a long exact sequence joins the two. The barcode in degree moves by at most under a perturbation of size , and the factor cannot be improved.
A change of task is a functor , and the invariants of a learned representation form a functor . The left Kan extension is the invariant that the source forces on the target, and its largest distance to the observed invariant is the transfer discrepancy. For persistent homology a functorial version is 1-Lipschitz under interleavings, and on finite samples the discrepancy is a bottleneck distance that is computed exactly.
The map is always injective, and surjective exactly when every compactly supported continuous map into is locally constant. The universal coefficient theorem is therefore about discrete coefficients, and it fails for on the Cantor set. Clopen invariant covers make the Mayer–Vietoris sequence trivial, while open invariant covers give one for every coefficient group.
L. Melodia · Extracta Mathematicae, to appear · arXiv:2602.13375.
Matui-type homology is built from compactly supported, locally constant chains on the nerve. For a discrete group it is the homology of the classifying space, but for a space seen as a groupoid of units it computes compactly supported cohomology. For the groupoid of units of the Cantor set , the two differ already in degree zero: is countable, while has cardinality . In every positive degree they agree.
Homology of ample groupoids with coefficients in a topological abelian group is functorial and invariant under Kakutani equivalence. On the nerve spaces , the image of the map consists of the compactly supported maps with finite image. For discrete the map is an isomorphism, and the universal coefficient sequence follows. Clopen saturated covers of the unit space give a Mayer–Vietoris sequence.
L. Melodia · Bachelor’s thesis · arXiv:2410.08323.
Chain complexes, simplicial and singular homology, exact sequences and relative homology lead up to excision, which shows that simplicial and singular homology agree on triangulable spaces. On this basis the thesis develops persistent homology and persistent cohomology of filtrations of point clouds, with many proofs written anew to make the connections between the techniques visible.
L. Melodia, R. Lenz · ECML PKDD 2021 Workshops, CCIS 1524, Springer, pp. 283–299.
Sliding windows turn sensor signals into point clouds, and their Vietoris–Rips persistence gives Betti curves in degrees and . A network with three branches of convolutions and LSTMs reads the raw signal and both curves and assigns each signal its designation in the plant. On 18,000 signals from four power plants it reaches an accuracy of 63.8% on the full designation.
L. Melodia, R. Lenz · ICPR 2020 Workshops, LNCS 12665, Springer, pp. 15–29.
If the data live on a connected abelian Lie group, that group is , and its Betti numbers determine . Reading them off persistence landscapes estimates the dimension of an embedding that keeps the topology of the data, and with it a lower bound for the number of neurons that a network layer needs to learn this topology.
L. Melodia, R. Lenz · IWCIA 2020, LNCS 12148, Springer, pp. 29–44.
Voronoi interpolation densifies a sample by natural neighbours, and sooner or later it changes the topology of the data. Persistent homology is computed after every step, and the interpolation stops once the bottleneck and Wasserstein distances to the original persistence diagram exceed a threshold. Experiments on handwritten signatures from the MOBISIG database compare three filtrations.
In radionuclide therapy with , a single dose kernel ignores differences between tissues, and Monte Carlo transport is slow. A U-residual network learns the map from local density to dose kernel instead, so that density-adapted kernels need no transport simulation for each patient. On unseen patients it reaches a continuous intersection over union of 0.86.
L. Melodia · In K. Šichová, R. Krapp, P. Rössler and V. Dovalil (eds.), Standardvarietät des Deutschen, Logos, Berlin, pp. 83–96.
A sociolinguistic case study, in German, of brauchen with and without zu before an infinitive. The variation between the two forms is read against Ammon’s social field of forces of a standard variety, in which codifiers, model speakers and writers, language experts and norm authorities together decide what counts as standard German.