Explore by topic
Choose a subject to see the different ways you can explore it. A mathematical lesson develops the ideas, a library guide helps you work with them in Julia, and a reference gives the details of an operation. Where available, you will also find accounts of how the computation works and reports of its measured performance. An article that connects several subjects appears under each of them, with links to the same page.
You can use these groups to move between related treatments as a question arises. For a sequence of lessons that develops the mathematics from an example or its definitions, use the reading map.
Article outline by topic
Getting started
- A hole appears and disappears Mathematical lesson — When does a hole appear and disappear, and how can I read its interval?
- Optional integrations Task recipe — Which dependency activates the optional capability I need?
- Using TamerOp with coding agents API reference — How can a coding agent choose a TamerOp workflow, run it and interpret its result?
Persistence and filtered complexes
- A hole appears and disappears Mathematical lesson — When does a hole appear and disappear, and how can I read its interval?
- Finite encodings: recovering a module from finite data Mathematical lesson — How can finite data recover a module over an infinite parameter domain?
- Persistence modules over posets Mathematical lesson — How do vector spaces and compatible maps describe persistence?
- Why two parameters change the problem Mathematical lesson — Why do two parameters require spaces and maps beyond a barcode?
- Choosing views and inspecting intervals Library guide — Which view lets me investigate the mathematical object I have computed?
- Exploring slices, intervals and signed contributions Library guide — How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- From inputs to computed objects Library guide — Which construction route should I choose, and what object will it return?
- From source cells to representative classes Library guide — Which source cells explain a selected class, and how is that correspondence checked?
- Ordinary persistent homology Library guide — Which ordinary persistence construction and retained output answer my question?
- Working with complexes and spectral pages Library guide — How do I build a compatible complex and inspect its homology, connecting maps or successive pages?
- Compute persistence relative to a boundary Task recipe — How do I construct a checked filtered pair and read its relative interval?
- Explain a distance through its matching Task recipe — Which matched and unmatched intervals account for a computed diagram distance?
- From a point cloud to comparisons and features Task recipe — How do I compare two ordinary diagrams, make finite features and save the result with retained data?
- Filtered pairs and relative persistence API reference — What input, basis and map conventions define relative persistence?
- Source representatives API reference — What is retained and verified when a chain or cocycle is traced to source cells?
- Exact rhomboid multicover construction Implementation account — Which representations and algorithms underlie exact rhomboid multicover construction, and why?
- Relative persistence of filtered pairs Implementation account — How are quotient persistence and its connecting maps computed for a filtered pair?
- Retaining representatives and tracing them to source cells Implementation account — Which representations and algorithms underlie retaining representatives and tracing them to source cells, and why?
- C++ Ripser: ordinary Rips barcodes Benchmark report — How does TamerOp compare with original C++ Ripser on larger complete-barcode requests?
- CubicalRipser: cubical barcodes Benchmark report — How do TamerOp and CubicalRipser compare on large image and volume barcodes?
- PHAT: ordinary persistence Benchmark report — What does the scoped comparison with PHAT establish?
- Ripser.py: Vietoris–Rips persistence Benchmark report — What does the fixed comparison with Ripser.py establish for ordinary Rips barcodes, cocycles and landmark workflows?
Finite descriptions and parameter queries
- Categories, encodings, and derived computations Mathematical lesson — In which category does a computation take place, and when can its result be transported?
- Finite encodings: recovering a module from finite data Mathematical lesson — How can finite data recover a module over an infinite parameter domain?
- Indicator presentations: building a module from regions and a matrix Mathematical lesson — How can regions and a matrix define spaces and their maps?
- Inspect spaces and maps Mathematical lesson — How does the computed encoding recover the square and its spaces and maps?
- Tameness and scope: when finite descriptions exist Mathematical lesson — When do constant subdivisions, finite encodings and finite fringe presentations exist?
- Why finite computations stay tame Mathematical lesson — Why do finite constructions and compatible maps preserve tame descriptions?
- Why two parameters change the problem Mathematical lesson — Why do two parameters require spaces and maps beyond a barcode?
- Choosing and inspecting resolutions Library guide — Which resolution or Betti computation answers my question without computing unnecessary terms?
- Choosing views and inspecting intervals Library guide — Which view lets me investigate the mathematical object I have computed?
- Computing Ext, Tor and their products Library guide — How can I request the derived information I need in the right category and degree range?
- Constructing modules without a filtration Library guide — How do I choose and validate a finite diagram, lattice presentation or geometric-region presentation?
- Exact coverage-depth windows Library guide — How can I restrict coverage depth while preserving the required module?
- Exact matching distance in a finite window Library guide — Which finite-window matching question can I compute, and what does the result establish?
- Exploring radius, depth and the finite model Library guide — How do radius, depth and geometric construction choices relate to the finite model and its invariants?
- Exploring slices, intervals and signed contributions Library guide — How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- Exploring spaces and maps Library guide — How do I investigate a constructed object and request deeper information when needed?
- Following vectors and constructing generated submodules Library guide — How can I propagate selected vectors or subspaces and recover the module they generate?
- From inputs to computed objects Library guide — Which construction route should I choose, and what object will it return?
- Ingestion options and their mathematical effects Library guide — Which input and construction choices change the represented module?
- Inspection and explicit computation Library guide — What is already retained, what does a query compute, and what can I reuse across repeated queries or a batch?
- Keeping a selected mathematical view Library guide — How do I create, query and close a linked session without losing the meaning of a selection?
- Querying regions and building GRIL features Library guide — When should I query finite-label generalized rank, a signed interval family, or continuous-worm GRIL, and how do I inspect the answer?
- Refining and transporting encoded modules Library guide — How do restriction, refinement and pushforward change a description or its parameter base?
- Build and validate a small module from spaces and maps Task recipe — How do I enter a commuting diagram directly and obtain a checked module?
- Measure what persists through a branching region Task recipe — How do I compute and check generalized rank on a chosen connected convex domain?
- Change-of-poset reference API reference — What do restriction, pushforward and common-refinement operations guarantee?
- Finite modules, selected vectors and submodules API reference — What are the exact contracts for finite posets, modules, morphisms and presentations?
- Options must affect the requested computation API reference — Which options change mathematical meaning, computation, or storage?
- Axis-aligned box encoding Implementation account — Which representations and algorithms underlie axis-aligned box encoding, and why?
- Change of poset, refinement and Kan extensions Implementation account — Which representations and algorithms underlie change of poset, refinement and Kan extensions, and why?
- From selected images to submodules and quotients Implementation account — Which representations and algorithms underlie kernels, quotients and universal constructions, and why?
- Serialization, interchange and mathematical provenance Implementation account — Which representations and algorithms underlie serialization, interchange and mathematical provenance, and why?
Modules, maps and derived algebra
- Categories, encodings, and derived computations Mathematical lesson — In which category does a computation take place, and when can its result be transported?
- Indicator presentations: building a module from regions and a matrix Mathematical lesson — How can regions and a matrix define spaces and their maps?
- Inspect spaces and maps Mathematical lesson — How does the computed encoding recover the square and its spaces and maps?
- Persistence modules over posets Mathematical lesson — How do vector spaces and compatible maps describe persistence?
- Tameness and scope: when finite descriptions exist Mathematical lesson — When do constant subdivisions, finite encodings and finite fringe presentations exist?
- When does a module split into intervals? Mathematical lesson — When does a collection of pieces describe the module itself, and when does it only summarize or approximate it?
- Why finite computations stay tame Mathematical lesson — Why do finite constructions and compatible maps preserve tame descriptions?
- Choosing and inspecting resolutions Library guide — Which resolution or Betti computation answers my question without computing unnecessary terms?
- Comparing results through declared correspondences Library guide — Which views can share selections or scales when fields, degrees, constructions or samples differ?
- Computing Ext, Tor and their products Library guide — How can I request the derived information I need in the right category and degree range?
- Computing interval multiplicities and splittings Library guide — Which decomposition question can I ask of my module, and what evidence comes back with the answer?
- Constructing modules without a filtration Library guide — How do I choose and validate a finite diagram, lattice presentation or geometric-region presentation?
- Exploring spaces and maps Library guide — How do I investigate a constructed object and request deeper information when needed?
- Following vectors and constructing generated submodules Library guide — How can I propagate selected vectors or subspaces and recover the module they generate?
- From inputs to computed objects Library guide — Which construction route should I choose, and what object will it return?
- From source cells to representative classes Library guide — Which source cells explain a selected class, and how is that correspondence checked?
- Inspection and explicit computation Library guide — What is already retained, what does a query compute, and what can I reuse across repeated queries or a batch?
- Numerical derived algebra Library guide — How do tolerances affect derived algebra, and how should I assess the answer?
- Refining and transporting encoded modules Library guide — How do restriction, refinement and pushforward change a description or its parameter base?
- Working with complexes and spectral pages Library guide — How do I build a compatible complex and inspect its homology, connecting maps or successive pages?
- Build and validate a small module from spaces and maps Task recipe — How do I enter a commuting diagram directly and obtain a checked module?
- Compute persistence relative to a boundary Task recipe — How do I construct a checked filtered pair and read its relative interval?
- Measure what persists through a branching region Task recipe — How do I compute and check generalized rank on a chosen connected convex domain?
- Change-of-poset reference API reference — What do restriction, pushforward and common-refinement operations guarantee?
- Derived algebra reference API reference — What are the contracts of Hom, Ext, Tor, products and spectral computations?
- Filtered pairs and relative persistence API reference — What input, basis and map conventions define relative persistence?
- Finite modules, selected vectors and submodules API reference — What are the exact contracts for finite posets, modules, morphisms and presentations?
- Interval decomposition contracts API reference — Which multiplicities, summands, subquotients and witnesses are certified by a result?
- Options must affect the requested computation API reference — Which options change mathematical meaning, computation, or storage?
- Source representatives API reference — What is retained and verified when a chain or cocycle is traced to source cells?
- Change of poset, refinement and Kan extensions Implementation account — Which representations and algorithms underlie change of poset, refinement and Kan extensions, and why?
- Computing generalized rank and GRIL Implementation account — How do selected finite diagrams and continuous grid worms reduce to exact limit-to-colimit ranks?
- Exact rational coordinates Implementation account — Which representations and algorithms underlie exact rational coordinates, and why?
- From selected images to submodules and quotients Implementation account — Which representations and algorithms underlie kernels, quotients and universal constructions, and why?
- How a mathematical view becomes a figure Implementation account — How does a prepared mathematical view retain its coefficients, coordinates and meaning while it is drawn or exported?
- Interval multiplicities and certified decomposition Implementation account — Which representations and algorithms underlie interval multiplicities and certified decomposition, and why?
- Relative persistence of filtered pairs Implementation account — How are quotient persistence and its connecting maps computed for a filtered pair?
- Retaining representatives and tracing them to source cells Implementation account — Which representations and algorithms underlie retaining representatives and tracing them to source cells, and why?
- Yoneda products and validated Tor algebra Implementation account — Which representations and algorithms underlie yoneda products and validated Tor algebra, and why?
- QPA: finite module algebra Benchmark report — What does the scoped comparison with QPA establish?
Geometric inputs and filtrations
- Constructing modules without a filtration Library guide — How do I choose and validate a finite diagram, lattice presentation or geometric-region presentation?
- Exact coverage-depth windows Library guide — How can I restrict coverage depth while preserving the required module?
- Exact rhomboid grades Library guide — Which filtration coordinates remain exact through queries, plots and saving?
- Exploring radius, depth and the finite model Library guide — How do radius, depth and geometric construction choices relate to the finite model and its invariants?
- From inputs to computed objects Library guide — Which construction route should I choose, and what object will it return?
- From source cells to representative classes Library guide — Which source cells explain a selected class, and how is that correspondence checked?
- Ingestion options and their mathematical effects Library guide — Which input and construction choices change the represented module?
- Ordinary persistent homology Library guide — Which ordinary persistence construction and retained output answer my question?
- Concurrent polyhedral computations Task recipe — How can I safely run polyhedral computations concurrently?
- Source representatives API reference — What is retained and verified when a chain or cocycle is traced to source cells?
- Axis-aligned box encoding Implementation account — Which representations and algorithms underlie axis-aligned box encoding, and why?
- Exact rhomboid multicover construction Implementation account — Which representations and algorithms underlie exact rhomboid multicover construction, and why?
- Retaining representatives and tracing them to source cells Implementation account — Which representations and algorithms underlie retaining representatives and tracing them to source cells, and why?
Invariants, slices and distances
- When does a module split into intervals? Mathematical lesson — When does a collection of pieces describe the module itself, and when does it only summarize or approximate it?
- Analyzing ensembles of persistence results Library guide — How do I align repeated outputs and distinguish descriptive variation from a supported inference?
- Comparing results through declared correspondences Library guide — Which views can share selections or scales when fields, degrees, constructions or samples differ?
- Computing interval multiplicities and splittings Library guide — Which decomposition question can I ask of my module, and what evidence comes back with the answer?
- Exact matching distance in a finite window Library guide — Which finite-window matching question can I compute, and what does the result establish?
- Exploring slices, intervals and signed contributions Library guide — How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- Querying regions and building GRIL features Library guide — When should I query finite-label generalized rank, a signed interval family, or continuous-worm GRIL, and how do I inspect the answer?
- Reading scalar fields in their original coordinates Library guide — How do I interpret sampled features in original coordinates and compare their sections?
- Refining and transporting encoded modules Library guide — How do restriction, refinement and pushforward change a description or its parameter base?
- Compose a scalar background and signed changes Task recipe — How do I combine a scalar background, mathematical overlay and explanatory annotation without changing their meaning?
- Explain a distance through its matching Task recipe — Which matched and unmatched intervals account for a computed diagram distance?
- Measure what persists through a branching region Task recipe — How do I compute and check generalized rank on a chosen connected convex domain?
- Ensembles of persistence results API reference — What alignment and statistical contracts do ensemble computations accept and guarantee?
- Interval decomposition contracts API reference — Which multiplicities, summands, subquotients and witnesses are certified by a result?
- Aligned ensembles and statistical uncertainty computations Implementation account — How are repeated outputs aligned and which computations support the reported uncertainty?
- Computing generalized rank and GRIL Implementation account — How do selected finite diagrams and continuous grid worms reduce to exact limit-to-colimit ranks?
- From sampled landscapes to ambient queries Implementation account — How are retained line landscapes placed on an ambient grid, with their sampling and error contracts intact?
- Interval multiplicities and certified decomposition Implementation account — Which representations and algorithms underlie interval multiplicities and certified decomposition, and why?
Features and data analysis
- Analyzing ensembles of persistence results Library guide — How do I align repeated outputs and distinguish descriptive variation from a supported inference?
- Inspection and explicit computation Library guide — What is already retained, what does a query compute, and what can I reuse across repeated queries or a batch?
- Ordinary persistent homology Library guide — Which ordinary persistence construction and retained output answer my question?
- Querying regions and building GRIL features Library guide — When should I query finite-label generalized rank, a signed interval family, or continuous-worm GRIL, and how do I inspect the answer?
- Reading scalar fields in their original coordinates Library guide — How do I interpret sampled features in original coordinates and compare their sections?
- From a point cloud to comparisons and features Task recipe — How do I compare two ordinary diagrams, make finite features and save the result with retained data?
- Ensembles of persistence results API reference — What alignment and statistical contracts do ensemble computations accept and guarantee?
- Aligned ensembles and statistical uncertainty computations Implementation account — How are repeated outputs aligned and which computations support the reported uncertainty?
- Computing generalized rank and GRIL Implementation account — How do selected finite diagrams and continuous grid worms reduce to exact limit-to-colimit ranks?
- From sampled landscapes to ambient queries Implementation account — How are retained line landscapes placed on an ambient grid, with their sampling and error contracts intact?
Visualization and interaction
- A hole appears and disappears Mathematical lesson — When does a hole appear and disappear, and how can I read its interval?
- Inspect spaces and maps Mathematical lesson — How does the computed encoding recover the square and its spaces and maps?
- When does a module split into intervals? Mathematical lesson — When does a collection of pieces describe the module itself, and when does it only summarize or approximate it?
- Analyzing ensembles of persistence results Library guide — How do I align repeated outputs and distinguish descriptive variation from a supported inference?
- Choosing and inspecting resolutions Library guide — Which resolution or Betti computation answers my question without computing unnecessary terms?
- Choosing views and inspecting intervals Library guide — Which view lets me investigate the mathematical object I have computed?
- Comparing results through declared correspondences Library guide — Which views can share selections or scales when fields, degrees, constructions or samples differ?
- Composing and sharing mathematical figures Library guide — How do I preserve the meaning of a selected result when I combine views or share it?
- Computing interval multiplicities and splittings Library guide — Which decomposition question can I ask of my module, and what evidence comes back with the answer?
- Exploring slices, intervals and signed contributions Library guide — How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- Exploring spaces and maps Library guide — How do I investigate a constructed object and request deeper information when needed?
- Following vectors and constructing generated submodules Library guide — How can I propagate selected vectors or subspaces and recover the module they generate?
- From source cells to representative classes Library guide — Which source cells explain a selected class, and how is that correspondence checked?
- Keeping a selected mathematical view Library guide — How do I create, query and close a linked session without losing the meaning of a selection?
- Ordinary persistent homology Library guide — Which ordinary persistence construction and retained output answer my question?
- Refining and transporting encoded modules Library guide — How do restriction, refinement and pushforward change a description or its parameter base?
- Working with complexes and spectral pages Library guide — How do I build a compatible complex and inspect its homology, connecting maps or successive pages?
- Compose a scalar background and signed changes Task recipe — How do I combine a scalar background, mathematical overlay and explanatory annotation without changing their meaning?
- Explain a distance through its matching Task recipe — Which matched and unmatched intervals account for a computed diagram distance?
- Optional integrations Task recipe — Which dependency activates the optional capability I need?
- Save and reopen an interval view Task recipe — How do I preserve the mathematical selection and available interactions after Julia exits?
- Change-of-poset reference API reference — What do restriction, pushforward and common-refinement operations guarantee?
- Ensembles of persistence results API reference — What alignment and statistical contracts do ensemble computations accept and guarantee?
- Live and saved inspection sessions API reference — What state and computation does a session retain, and which actions work in each execution environment?
- Source representatives API reference — What is retained and verified when a chain or cocycle is traced to source cells?
- Visualization reference API reference — Which visual specifications, sessions, renderers and exports are supported?
- Aligned ensembles and statistical uncertainty computations Implementation account — How are repeated outputs aligned and which computations support the reported uncertainty?
- How a mathematical view becomes a figure Implementation account — How does a prepared mathematical view retain its coefficients, coordinates and meaning while it is drawn or exported?
- Linked inspection sessions and browser execution Implementation account — Which representations and algorithms underlie linked inspection sessions and browser execution, and why?
- Retaining representatives and tracing them to source cells Implementation account — Which representations and algorithms underlie retaining representatives and tracing them to source cells, and why?
- Continuous inspection: time from input to picture Benchmark report — How long does a continuous control take to commit and draw its mathematical result on the declared browser fixtures?
Data, saving and interchange
- Composing and sharing mathematical figures Library guide — How do I preserve the meaning of a selected result when I combine views or share it?
- Exact rhomboid grades Library guide — Which filtration coordinates remain exact through queries, plots and saving?
- Keeping a selected mathematical view Library guide — How do I create, query and close a linked session without losing the meaning of a selection?
- Ordinary persistent homology Library guide — Which ordinary persistence construction and retained output answer my question?
- Reading scalar fields in their original coordinates Library guide — How do I interpret sampled features in original coordinates and compare their sections?
- From a point cloud to comparisons and features Task recipe — How do I compare two ordinary diagrams, make finite features and save the result with retained data?
- Optional integrations Task recipe — Which dependency activates the optional capability I need?
- Save and reopen an interval view Task recipe — How do I preserve the mathematical selection and available interactions after Julia exits?
- Live and saved inspection sessions API reference — What state and computation does a session retain, and which actions work in each execution environment?
- Serialization, interchange and mathematical provenance Implementation account — Which representations and algorithms underlie serialization, interchange and mathematical provenance, and why?
Fields, grades and numerical arithmetic
- Exact rhomboid grades Library guide — Which filtration coordinates remain exact through queries, plots and saving?
- Numerical derived algebra Library guide — How do tolerances affect derived algebra, and how should I assess the answer?
- Exact rational coordinates Implementation account — Which representations and algorithms underlie exact rational coordinates, and why?
Performance and comparisons
- Inspection and explicit computation Library guide — What is already retained, what does a query compute, and what can I reuse across repeated queries or a batch?
- Keeping a selected mathematical view Library guide — How do I create, query and close a linked session without losing the meaning of a selection?
- Concurrent polyhedral computations Task recipe — How can I safely run polyhedral computations concurrently?
- Reproduce a benchmark report Task recipe — How do I verify the published evidence, rerun a comparison and redraw its figures?
- Linked inspection sessions and browser execution Implementation account — Which representations and algorithms underlie linked inspection sessions and browser execution, and why?
- C++ Ripser: ordinary Rips barcodes Benchmark report — How does TamerOp compare with original C++ Ripser on larger complete-barcode requests?
- Continuous inspection: time from input to picture Benchmark report — How long does a continuous control take to commit and draw its mathematical result on the declared browser fixtures?
- CubicalRipser: cubical barcodes Benchmark report — How do TamerOp and CubicalRipser compare on large image and volume barcodes?
- PHAT: ordinary persistence Benchmark report — What does the scoped comparison with PHAT establish?
- QPA: finite module algebra Benchmark report — What does the scoped comparison with QPA establish?
- Ripser.py: Vietoris–Rips persistence Benchmark report — What does the fixed comparison with Ripser.py establish for ordinary Rips barcodes, cocycles and landmark workflows?
- How the benchmarks were measured Contributor guide — How do I measure a meaningful computation and report what the evidence supports?
Development and maintenance
- How the benchmarks were measured Contributor guide — How do I measure a meaningful computation and report what the evidence supports?