Topological ManifoldsMarzio De Corato
07 / Search

Search.

Find a course, publication or section. Search runs in your browser without sending your queries to an external service.

SectionHome
SectionTeaching
SectionLaboratories · galaxy map
SectionResearch
SectionBlog
SectionProfile & CV
SectionAtlas of forms
SectionVariations and measurements
SectionTravels
SectionContact
SectionResources
SectionWhy Topological Manifolds
SectionDescending Fields
SectionLicence and reuse
Teaching / laboratoryQuantum Lab

Through Quantum Lab’s simulations, you can accompany the seven course modules with an exploration of phenomena, circuits and protocols, observing how representations and results change as you adjust the available parameters and returning to the course materials to interpret what you have seen.

Teaching / laboratoryGeoStat Lab

GeoStat Lab lets you explore statistical methods used in Earth sciences by comparing samples, time series and spatial data as you change model assumptions and parameters. Visual representations, mathematical explanations and R code accompany each path, helping you interpret the results and reconstruct the analysis that produced them.

Graph theoryGraph theory and cyber-attacks

When devices, services and identities are described through their relationships, system security can be studied as a structural problem in which both a vulnerability and the paths through which it could expose other resources matter.

Interactive experimentQubit state on the Bloch sphere

Change the parameters and compare the mathematical predictions.

Interactive experimentWave superposition and phase

Change the parameters and compare the mathematical predictions.

Interactive experimentProbability and decision threshold

Change the parameters and compare the mathematical predictions.

CourseAdvanced Calculus and Stochastic Processes · 2026/2027

The Advanced Calculus and Stochastic Processes entry for 2026/2027 brings together the course references at Università Cattolica del Sacro Cuore, providing access to the institutional page and keeping the information for this academic year distinct from other editions.

CourseMathematics I and Information Technology · 2026/2027

This entry concerns the Computer Science component of Mathematics I and Information Technology for Geological Sciences in 2026/2027, with links to the University of Milan’s institutional information about the course.

CourseQuantum and Post-Quantum Computing · 2026/2027

The seven modules lead from physical foundations and mathematical tools to quantum circuits, algorithms and protocols, with slides available to read and download as PDFs and links in each module to related activities in Quantum Lab.

CourseAdvanced Calculus and Stochastic Processes · 2025/2026

The Advanced Calculus and Stochastic Processes entry for 2025/2026 brings together the course references at Università Cattolica del Sacro Cuore, providing access to the institutional page and keeping the information for this academic year distinct from other editions.

CourseMathematics I and Information Technology · 2025/2026

This entry concerns the Computer Science component of Mathematics I and Information Technology for Geological Sciences in 2025/2026, with links to the University of Milan’s institutional information about the course.

CourseAdvanced Calculus and Stochastic Processes · 2024/2025

The Advanced Calculus and Stochastic Processes entry for 2024/2025 brings together the course references at Università Cattolica del Sacro Cuore, providing access to the institutional page and keeping the information for this academic year distinct from other editions.

ModulePhysical foundations and simulation of quantum systems

From classical and statistical simulation to waves, interference, two-alternative states and composite systems. The module addresses the loss of interference, information and irreversibility, leading to the transition from quantum mechanics to computation.

ModuleMathematical foundations: linear algebra, probability and measurement

Complex numbers, vectors, matrices and tensor products establish the language of computation; probability, states and measurement connect mathematical transformations to observable outcomes.

ModuleQuantum circuits: gates, reversibility and the Deutsch and Deutsch–Jozsa algorithms

Reading and executing circuits, single- and multi-qubit gates, composition, phases and interference. Reversible logic leads to the Deutsch and Deutsch–Jozsa algorithms, developed through examples and checks.

ModuleQuantum algorithms: Bernstein–Vazirani and Simon

Two hidden-string reconstruction problems: the coefficients of a binary parity and the XOR relation between inputs with the same output. Oracles, interference and measurement are followed through to reconstruction of the answer.

ModuleShor’s algorithm: modular arithmetic, RSA and the Fourier transform

Divisors, congruences, inverses and modular powers prepare the construction of RSA. Quantum period finding and the Fourier transform lead to message recovery; a final discussion connects the period to factorisation.

ModuleGrover’s algorithm and amplitude amplification

The search for valid candidates is developed through oracles, reflections and rotations in state space. The examples introduce multiple solutions, an unknown number of solutions and amplitude amplification, keeping costs and limitations explicit.

ModuleQuantum protocols: BB84, QKD, superdense coding and error correction

Key distribution with BB84, QKD requirements and limitations, comparison with post-quantum cryptography, superdense coding and entropy. The final part describes quantum codes, syndromes and error recovery.

Slide topic · ItalianParte I – La simulazione classica

Module 1 · PDF p. 13

Slide topic · ItalianParte II – La simulazione statistica

Module 1 · PDF p. 54

Slide topic · ItalianParte III – Onde e interferenza

Module 1 · PDF p. 96

Slide topic · ItalianParte IV – L'interferenza di particelle singole

Module 1 · PDF p. 129

Slide topic · ItalianParte V – Stati a due alternative

Module 1 · PDF p. 169

Slide topic · ItalianParte VI – Il calcolo quantistico

Module 1 · PDF p. 226

Slide topic · ItalianParte VII – Due qubit e stati congiunti

Module 1 · PDF p. 250

Slide topic · ItalianParte VIII – Ambiente e perdita di interferenza

Module 1 · PDF p. 281

Slide topic · ItalianParte IX – Informazione e irreversibilità

Module 1 · PDF p. 304

Slide topic · ItalianSintesi

Module 1 · PDF p. 312

Slide topic · ItalianParte X – Come si costruisce un computer quantistico

Module 1 · PDF p. 329

Slide topic · ItalianParte XI – Dalla meccanica quantistica al calcolo quantistico

Module 1 · PDF p. 495

Slide topic · ItalianNumeri complessi

Module 2 · PDF p. 11

Slide topic · ItalianVettori, basi e coordinate

Module 2 · PDF p. 33

Slide topic · ItalianProdotto interno e ortogonalità

Module 2 · PDF p. 45

Slide topic · ItalianMatrici e trasformazioni lineari

Module 2 · PDF p. 76

Slide topic · ItalianAggiunto, hermitiane e unitarie

Module 2 · PDF p. 89

Slide topic · ItalianAutovalori e autovettori

Module 2 · PDF p. 101

Slide topic · ItalianDiagonalizzazione e spettro

Module 2 · PDF p. 113

Slide topic · ItalianCambio di base e commutatori

Module 2 · PDF p. 138

Slide topic · ItalianNucleo, immagine e rango

Module 2 · PDF p. 160

Slide topic · ItalianProdotto tensoriale

Module 2 · PDF p. 167

Slide topic · ItalianFunzioni di matrici

Module 2 · PDF p. 180

Slide topic · ItalianUn problema di algebra completo

Module 2 · PDF p. 203

Slide topic · ItalianEsiti ed eventi

Module 2 · PDF p. 217

Slide topic · ItalianVariabili aleatorie discrete

Module 2 · PDF p. 223

Slide topic · ItalianValore atteso

Module 2 · PDF p. 229

Slide topic · ItalianVarianza e dispersione

Module 2 · PDF p. 235

Slide topic · ItalianProve ripetute e binomiale

Module 2 · PDF p. 242

Slide topic · ItalianFrequenze e precisione

Module 2 · PDF p. 253

Slide topic · ItalianCondizionamento e Bayes

Module 2 · PDF p. 264

Slide topic · ItalianDistribuzioni congiunte

Module 2 · PDF p. 271

Slide topic · ItalianDal vettore al ket

Module 2 · PDF p. 319

Slide topic · ItalianBra e prodotto interno

Module 2 · PDF p. 331

Slide topic · ItalianProdotto diadico e proiettori

Module 2 · PDF p. 345

Slide topic · ItalianOperatori e trasformazioni del qubit

Module 2 · PDF p. 354

Slide topic · ItalianAutostati e decomposizione spettrale

Module 2 · PDF p. 389

Slide topic · ItalianRegola di Born

Module 2 · PDF p. 396

Slide topic · ItalianMisura e aggiornamento dello stato

Module 2 · PDF p. 410

Slide topic · ItalianValori medi e dispersioni quantistiche

Module 2 · PDF p. 424

Slide topic · ItalianOsservabili incompatibili

Module 2 · PDF p. 433

Slide topic · ItalianSistemi composti

Module 2 · PDF p. 449

Slide topic · ItalianUn esperimento calcolato dall’inizio alla fine

Module 2 · PDF p. 488

Slide topic · Italian1. Lettura ed esecuzione

Module 3 · PDF p. 3

Slide topic · Italian2. Porte a un qubit

Module 3 · PDF p. 11

Slide topic · Italian3. Composizione e inversione

Module 3 · PDF p. 26

Slide topic · Italian4. Fasi e interferenza

Module 3 · PDF p. 36

Slide topic · Italian5. Registri di due qubit

Module 3 · PDF p. 47

Slide topic · Italian6. CNOT, Toffoli e ausiliari

Module 3 · PDF p. 59

Slide topic · Italian7. Deutsch: derivazione commentata

Module 3 · PDF p. 94

Slide topic · Italian8. Interpretazione e prosecuzione

Module 3 · PDF p. 115

Slide topic · Italian9. Deutsch–Jozsa su più bit

Module 3 · PDF p. 119

Slide topic · ItalianA. Verifiche e dimostrazioni

Module 3 · PDF p. 148

Slide topic · ItalianB. Preparazioni alternative

Module 3 · PDF p. 155

Slide topic · ItalianC. AND, fase e ripristino

Module 3 · PDF p. 171

Slide topic · ItalianReferences

Module 3 · PDF p. 177

Slide topic · ItalianBernstein–Vazirani

Module 4 · PDF p. 3

Slide topic · ItalianSimon

Module 4 · PDF p. 60

Slide topic · ItalianSimon: quante prove servono

Module 4 · PDF p. 134

Slide topic · ItalianSimon: confronto classico e risorse

Module 4 · PDF p. 147

Slide topic · ItalianConfronto dei procedimenti

Module 4 · PDF p. 156

Slide topic · ItalianAppendice

Module 4 · PDF p. 159

Slide topic · Italian01 Il problema di Shor

Module 5 · PDF p. 4

Slide topic · Italian02 Divisori e coprimalità

Module 5 · PDF p. 15

Slide topic · Italian03 Congruenze e inversi

Module 5 · PDF p. 34

Slide topic · Italian04 Potenze e ordine

Module 5 · PDF p. 57

Slide topic · Italian05 La costruzione di RSA

Module 5 · PDF p. 82

Slide topic · Italian06 Il periodo del cifrato

Module 5 · PDF p. 115

Slide topic · Italian07 La difficoltà della ricerca

Module 5 · PDF p. 128

Slide topic · Italian08 La rappresentazione di Fourier

Module 5 · PDF p. 137

Slide topic · Italian09 La ricerca quantistica del periodo

Module 5 · PDF p. 152

Slide topic · Italian10 Dalla misura al messaggio

Module 5 · PDF p. 169

Slide topic · Italian11 La realizzazione del circuito

Module 5 · PDF p. 185

Slide topic · ItalianA Il periodo e i fattori (facoltativo)

Module 5 · PDF p. 201

Slide topic · ItalianRiferimenti bibliografici

Module 5 · PDF p. 207

Slide topic · ItalianIl problema della ricerca

Module 6 · PDF p. 4

Slide topic · ItalianStati e probabilità

Module 6 · PDF p. 21

Slide topic · ItalianOracoli reversibili

Module 6 · PDF p. 42

Slide topic · ItalianQuattro candidati

Module 6 · PDF p. 61

Slide topic · ItalianOtto candidati

Module 6 · PDF p. 78

Slide topic · ItalianRiflessioni e sottospazi

Module 6 · PDF p. 97

Slide topic · ItalianLa rotazione di Grover

Module 6 · PDF p. 123

Slide topic · ItalianCircuiti e ausiliari

Module 6 · PDF p. 146

Slide topic · ItalianPiù soluzioni

Module 6 · PDF p. 175

Slide topic · ItalianIl numero di soluzioni ignoto

Module 6 · PDF p. 192

Slide topic · ItalianAmplificazione di ampiezza

Module 6 · PDF p. 210

Slide topic · ItalianCosto e uso dell’algoritmo

Module 6 · PDF p. 230

Slide topic · ItalianBB84 e distribuzione delle chiavi

Module 7 · PDF p. 10

Slide topic · ItalianLa QKD nelle comunicazioni protette

Module 7 · PDF p. 29

Slide topic · ItalianCodifica superdensa

Module 7 · PDF p. 46

Slide topic · ItalianCorrezione degli errori quantistici

Module 7 · PDF p. 57

GeometryGyroid

Passages and openings connect the surface in all three spatial directions. This form evokes the study of periodic structures and materials whose internal geometry influences their properties.

GeometrySchwarz P surface

The surface separates space into two regions connected through periodic openings. Its symmetry and curvature offer a useful reference for understanding three-dimensional networks and porous structures.

GeometrySchwarz D surface

The spatial network has connections and openings distinct from those of Schwarz P. Rotating it helps trace the passages and distinguish the regions separated by the surface.

GeometryP688 schwarzite

The carbon lattice's hexagons remain visible as the framework curves around its openings. Octagons connect the saddle regions, where the bonds reveal the narrowing and subsequent widening of the structure.

GeometryOut-of-plane deformation

The ideal lattice is displaced out of its plane according to a regular field. One can observe how deformation changes the ribbon’s shape while leaving lattice connectivity recognisable.

GeometryNegatively curved connections

Longitudinal curves and circular sections describe three families of necks. The model highlights transitions between regions and the role of curvature in spatial connections.

GeometryProbabilistic graph

Variables occupy three lattice-like communities whose amber bridges make the connections between groups visible, while rotation helps distinguish those links from the dependencies within each community.

GeometryExecution paths

Program blocks form an architecture of directed paths in which a branch opens three alternatives that later merge. An amber route highlights one permitted sequence, with arrowheads indicating the direction of execution.

GeometryDecision surface

The mesh follows a function that maps two variables to a value between zero and one. Three level curves reveal its shape, while the amber line marks the classification threshold, whose curvature depends on the interaction term xy.

GeometryRegularity of a trace

A continuous curve combines three values of the same time series at a fixed delay, giving recurring and irregular patterns a spatial form. Denser sampling and a tubular cross-section make the trajectory easier to follow where distinct portions overlap in projection.

GeometryBloch sphere

A point on the sphere represents a pure state of a qubit, up to a global phase. The highlighted vector selects a state; meridians and parallels help read the two angular coordinates.

GeometryWave superposition

Peaks and troughs result from the sum of two periodic contributions. The figure introduces superposition visually, while the second relation shows the cross term responsible for interference between complex amplitudes.

GeometryCircuit for a Bell state

Two lines represent the qubits. A Hadamard transformation on the first, followed by a controlled-X gate, prepares a Bell state from |00⟩. The terminal shapes suggest the circuit’s readout points.

GeometryLattice and basis

Integer combinations of three vectors generate the lattice points. Highlighted segments distinguish the basis from the point network, providing an initial visual reference for lattice problems.

GeometryStochastic paths

The curves represent twelve synthetic realisations of geometric Brownian motion. Each path is generated from random increments; a shared component introduces dependence between realisations.

GeometryGaussian density

The surface describes a bivariate normal density. Correlation tilts the bell’s cross-sections: observing its shape helps distinguish dispersion from dependence between the two components.

GeometryCovariance ellipsoid

The ellipsoid translates a covariance matrix into spatial directions and magnitudes. The highlighted section and principal axes reveal anisotropy by showing how dispersion varies with direction.

GeometryJulia set

Iterating the same rule produces intricate boundaries between escaping points and points that remain bounded. Colour depends on escape time and reveals details at different scales.

GeometrySierpiński tetrahedron

Four scaled-down copies occupy a tetrahedron’s vertices. Repeating the construction produces a structure in which empty space is as recognisably organised as the solids.

GeometryMenger sponge

Dividing a cube into 27 parts and removing seven generates a structure of interconnected cavities. Recursion reproduces this arrangement at progressively smaller scales.

GeometryMöbius strip

A half-twist before joining the ends changes the relationship between boundary and surface. Following the strip explores a form in which a local distinction between two sides cannot be extended to a global choice.

GeometryHelicoid

A straight line rotates while advancing along an axis, generating a ruled surface. The relationship between rotation and translation reveals the continuity of the form from different viewpoints.

GeometryCatenoid

Rotating a catenary generates a surface with a central neck. The contrast between the two principal curvatures makes visible a geometry encountered in the study of minimal surfaces.

GeometryTorus

Two periodic coordinates traverse the surface in distinct directions. The central hole and the continuity of paths make it a useful form for considering periodicity and topology.

GeometryC₆₀ fullerene

Twelve pentagons allow a hexagonal carbon network to close into a cage, revealing how ring arrangement accompanies the curvature of a closed carbon surface.

GeometryGraphene nanoribbons

Cutting a graphene sheet leaves an atomic edge whose properties can be investigated through spectroscopy and calculations. The two views make armchair and zigzag terminations recognisable.

GeometryDeformed nanoribbon

Twisting moves the hexagons out of plane and changes the orientation of ribbon regions, providing a visual introduction to the relationship between structural distortion and electronic properties.

GeometryBilayer graphene nanoflakes

Two overlapping graphene fragments reveal how a relative shift changes ring alignment, introducing the role of interlayer interactions in the study of optical properties.

BlogThe War of False Perceptions

Alerts in European schools show how an unfounded threat can consume resources, change decisions and prolong its effects. This essay examines that pressure through cognitive overload, orientation and the OODA loop in John Boyd’s thinking.

BlogStriking the Nerves of the System

Starting from altered commands and false alarms, the essay follows the checks, decisions and shifts of resources that a signal can provoke, drawing on Liddell Hart and John Boyd to examine how disrupted information affects an organisation’s freedom of action and cohesion.

Conference contributions / 2027Estimating shortcut learning and inductive bias in multi-view behavioural trace classification · Stability of explanations in software-trace classification

Because models that correctly classify the same programs may rely on different cues, the work examines the stability of explanations in behavioural-trace classification, considering data representations and the regularities learned by classifiers.

Books / 2025L’Intelligenza Artificiale negli enti locali · Artificial intelligence and local-government services

Through a survey of 72 municipalities and a prototype for classifying municipal website pages, the volume examines uses of artificial intelligence in local government in relation to the skills and responsibilities accompanying its adoption.

Articles / 2025Ransomware detection using sample entropy and graphical models: A methodology for explainable artificial intelligence (XAI) in cybersecurity · Recognising ransomware from processor signals

Traces left by programs in processor activity are used to recognise suspicious behaviour through a methodology that connects ransomware detection with an examination of the relationships between variables underlying classification.

Books / 2024La Cybersecurity negli enti locali · Cybersecurity in Lombardy’s municipalities

The study examines how prepared Lombardy’s municipalities are to face cyber threats, identifying support and training needs that affect the conditions in which local administrations can address security problems.

Conference contributions / 2024Hazardous asteroids forecast via Markov random fields: A case study for explainable artificial intelligence (XAI) · Asteroids as a test case for interpretable AI

Asteroid classification provides a setting in which physical descriptions of the phenomenon make it possible to examine whether the relationships used by an algorithm to make predictions are consistent with the knowledge used to interpret the data.

Conference contributions / 2023Interpretability of machine learning algorithms: How these techniques can correctly guess the physical laws? · Algorithm interpretability on data derived from physical laws

By comparing what a model appears to learn from data with known physical laws, the work examines the relationship between prediction and explanation and the meaning that can be attributed to the relationships underlying an algorithm’s responses.

Articles / 2020Vibrational signature of the graphene nanoribbon edge structure from high-resolution electron energy-loss spectroscopy · Reading the shape of graphene edges through vibrations

The study examines atomic vibrations in graphene nanoribbons, through which a signature of edge structure can be obtained and the shape of the nanostructure related to its vibrational properties.

Articles / 2018Bandgap engineering of graphene nanoribbons by control over structural distortion · Changing graphene’s response by changing its shape

The work studies how controlled deformation of a graphene nanoribbon can change the energy required to excite its electrons, relating changes in shape to the resulting variations in optical properties.

Articles / 2016Raman fingerprints of atomically precise graphene nanoribbons · The Raman signature of graphene nanoribbons

Through light scattered by graphene nanoribbons, the work examines information about their width, edge structure and attached chemical groups, relating these features to the material’s Raman signature.

Articles / 2014Optical properties of bilayer graphene nanoflakes · Optical properties of bilayer graphene nanoflakes

The work compares the optical properties of small stacked graphene fragments with those of isolated fragments, examining how layer alignment and edge chemistry contribute to differences in light absorption.

Articles / 2013Topological study of schwarzitic junctions in 1D lattices · Describing carbon networks by counting connections

The arrangement of bonds between atoms is described through mathematical indices that summarise aspects of connectivity, allowing different carbon structures to be compared through quantities computed on the graph.

Book chapters / 2013Topological versus physical and chemical properties of negatively curved carbon surfaces · Topological models and properties of carbon surfaces

By representing atoms as nodes and bonds as connections, the work relates some physical properties of carbon surfaces to simpler topological descriptions through which differently organised structures can be compared.

Book chapters / 2013Two C28 clathrates · Computational design of new cage-like carbon structures

The chapter proposes two possible crystalline arrangements of carbon and studies their structure and properties theoretically, using computational design to examine new cage configurations.

Book chapters / 2013Topological invariants of Möbius-like graphenic nanostructures · The topology of carbon nanoribbons with a Möbius twist

Closing a nanoribbon into a Möbius form changes its structural connections, which the work describes through topological indices that quantify differences introduced by the twist and allow their organisation to be compared.

Book chapters / 2013Introducing “colored” molecular topology by reactivity indices of electronegativity and chemical hardness · Adding chemical information to a bond map

The study adds information about the reactivity of atoms and bonds to a molecular network’s description of atomic connections, allowing the representation of connectivity to include aspects of chemical characterisation.

Conference contributions / 2012Dynamics and spectral properties of free-standing negatively-curved carbon surfaces · Dynamics and spectral properties of carbon surfaces

Epioptics-11 · World Scientific, pp. 114–131

Book chapters / 2011The topological background of schwarzite physics · Schwarzite geometry and the properties of porous carbon

The chapter traces the relationship between negatively curved carbon networks, the conditions in which they can grow and their physical properties, examining how schwarzite geometry contributes to the description of porous carbon.

Research topicExplainable artificial intelligence and probabilistic models

How can we evaluate the evidence on which a classification is based?

Research topicCybersecurity and software behaviour analysis

Which execution traces can identify malicious behaviour?

Research topicComputational physics and the topology of nanostructures

Which properties of a nanostructure depend on its geometry and bond arrangement?

Research topicTime series, quantitative methods and financial modelling

How can a forecast be evaluated when data change over time?

Research topicEpistemology, models and scientific knowledge

What warrants treating a prediction as an explanation?

Research topicQuantum information, computing and machine learning

Which problems offer an advantage in the quantum model of computation?

Research topicSystems architecture and educational design

How can the operation of computing systems be explained in a verifiable way?

ProfileYoga, hiking and climbing
Education / 2022M.Sc. in Data Science and Economics
Education / 2016Ph.D. in Physics and Nanoscience
Education / 2012M.Sc. in Physics
Education / 2009B.Sc. in Physics

Explore Topological Manifolds

Complete search page ↗

Graph theory and cyber-attacks

Unaffected nodeCompromised node

When devices, services and identities are described through their relationships, system security can be studied as a structural problem in which both a vulnerability and the paths through which it could expose other resources matter.

From connections to attack paths

A graph G = (V, E) consists of vertices V and edges E. In an asset network, vertices may represent devices or services, while edges describe connections, dependencies or trust relationships. An attack graph instead represents conditions, actions or system states, depending on the model, to examine how several steps can combine into a compromise.

G = (V, E)

The analogy with an epidemic helps illustrate how a compromise can spread between nodes, provided that the conditions for each transition are considered. Credentials, permissions, vulnerabilities and configurations determine which paths are feasible; a connection alone describes a possibility of communication.

How this supports defence

Path analysis helps identify the resources reachable from an initial position and the connections that form critical passages. Comparing the graph before and after a change shows how network segmentation, reduced privileges or a vulnerability fix can interrupt particular sequences. A node’s importance depends on its role and context, so its number of connections gives only a partial account of risk.

Reading this figure

Red nodes marked with a cross represent compromised systems in the scenario; green nodes remain unaffected, while pale pulses follow the propagation paths. The map provides a conventional geographical layout for an illustrative network whose links and timing are constructed to clarify the phenomenon. It does not show observed attacks or estimate compromise probabilities.

Explore the model

The model loads when opened.

Drag or use the arrow keys to orient the model; + and − control zoom. Hold Ctrl or ⌘ to zoom with the wheel. Esc closes the dialog.

Topological Manifolds

Interface preferences

Sound remains optional and is controlled by the speaker in the header. Background music has its own player below.

Card entry, clicks and page changes use soft accents; scrolling stays silent.

Original soundtrack · 4:30

Descending Fields

0:00 / 4:30

Music starts when you press Play.

About the composition ↗
Topological Manifolds

Scientific formulas

Relations, assumptions and study references. These are not empirical results from the author’s research.

Research · Teaching · Exploration

Topological
Manifolds

Follow the code, explore the forms. Choose how to enter.

Music and effects have separate volume controls.

topological-manifolds / terminal
Visual transition

Opening the laboratory

Opening the laboratory…

0%

Destination