Searcharxiv⌕ Search

arXiv subjects

Giacomo Maletto

Publications and source records attributed to Giacomo Maletto.

3 recordsLinked to original sources

Hilbert's 16th problem for arrangements of curves on a surface

We introduce a combinatorial structure $(n,W,T)$ encoding the topological type of a curve transverse to a fixed cellular arrangement of curves on a compact real surface, in terms of intersection numbers, Dyck words and rooted trees. We apply this formalism to analyze a natural generalization of Hilbert's 16th problem to arrangements of curves. We obtain a complete classification of arrangements of three lines and a cubic, and a partial classification of arrangements of three lines and a quartic. This is achieved using Bézout-type obstructions, Viro's patchworking and translations, and by developing the Julia library NWT to handle large databases of curves.

math.AG↗

The GameTheory package for Macaulay2

We describe the GameTheory package version 1.0 for computing equilibria in game theory available since version 1.25.05 of Macaulay2. We briefly explain the four equilibrium notions, Nash, correlated, dependency, and conditional independence, and demonstrate their implementation in the package with examples.

math.AG↗

Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean

Reversible Primitive Permutations (RPP) are recursively defined functions designed to model Reversible Computation. We illustrate a proof, fully developed with the proof-assistant Lean, certifying that: "RPP can encode every Primitive Recursive Function". Our reworking of the original proof of that statement is conceptually simpler, fixes some bugs, suggests a new more primitive reversible iteration scheme for RPP, and, in order to keep formalization and semi-automatic proofs simple, led us to identify a single pattern that can generate some useful reversible algorithms in RPP: Cantor Pairing, Quotient/Reminder of integer division, truncated Square Root. Our Lean source code is available for experiments on Reversible Computation whose properties can be certified.

cs.LO↗