Reference. An axiomatics and a combinatorial model of creation/annihilation operators

A categorical axiomatic theory of creation/annihilation operators on symmetric Fock space is introduced, and the combinatorial model that motivated it is presented. Commutation relations and coherent states are considered in both frameworks.

Cite

Cite as @fiore-2025-an (helia, typst) · \cite{fiore-2025-an} (LaTeX)
BibTeX
bibtex · 1 line
@article{fiore-2025-an, title={An axiomatics and a combinatorial model of creation/annihilation operators}, volume={35}, ISSN={1469-8072}, url={http://dx.doi.org/10.1017/s0960129524000379}, DOI={10.1017/s0960129524000379}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press (CUP)}, author={Fiore, Marcelo}, year={2025} }
hayagriva YAML (typst)
yaml · 14 lines
fiore-2025-an:
  type: article
  title: An axiomatics and a combinatorial model of creation/annihilation operators
  author: Fiore, Marcelo
  date: 2025
  url: http://dx.doi.org/10.1017/s0960129524000379
  serial-number:
    doi: 10.1017/s0960129524000379
    issn: 1469-8072
  parent:
    type: periodical
    title: Mathematical Structures in Computer Science
    publisher: Cambridge University Press (CUP)
    volume: 35
Cited by (1)

Free Commutative Monoids in Homotopy Type Theory choudhury-2023-free

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the categorical universal property of two, necessarily equivalent, algebraic presentations of free commutative monoids using 1-HITs. These presentations correspond to two different equational theories invariably including commutation axioms. In this setting, we prove important structural combinatorial properties of finite multisets. These properties are established in full generality without assuming decidable equality on the carrier set. As an application, we present a constructive formalisation of the relational model of classical linear logic and its differential structure. This leads to constructively establishing that free commutative monoids are conical refinement monoids. Thereon we obtain a characterisation of the equality type of finite multisets and a new presentation of the free commutative-monoid construction as a set-quotient of the list construction. These developments crucially rely on the commutation relation of creation/annihilation operators associated with the free commutative-monoid construction seen as a combinatorial Fock space.
DOI · arXiv
Cites 39 works (3 here)
With notes (3)

Two-dimensional monad theory blackwell_kelly_power_1989

Web

Linear logic girard_linear_1987

The familiar connective of negation is broken into two operations: linear negation which is the purely negative part of negation and the modality “of course” which has the meaning of a reaffirmation. Following this basic discovery, a completely new approach to the whole area between constructive logics and programmation is initiated.
DOI

Categories for the Working Mathematician maclane_1971

Web
External (36)
fiore-2025-an reference entries/refs/fiore-2025-an/fiore-2025-an.hel