English
Related papers

Related papers: Types, Codes and TFTs

200 papers

We construct 3-dimensional once-Extended Topological Quantum Field Theories (ETQFTs for short) out of (possibly non-semisimple) modular categories, and we explicitly identify linear categories and functors in their image. The circle…

Geometric Topology · Mathematics 2022-09-20 Marco De Renzi

We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by…

Logic in Computer Science · Computer Science 2007-05-23 Pascal Weil

Mostly self-contained script on functorial topological quantum field theories. These notes give a slow introduction to the basic notions of category theory which serve a closer investigation of cobordisms and (commutative) Frobenius…

Quantum Algebra · Mathematics 2023-10-05 Leon Menger

We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…

Rings and Algebras · Mathematics 2018-11-12 Tim Boykett

We construct a two-level weighted TQFT whose structure coefficents are equivariant intersection numbers on moduli spaces of admissible covers. Such a structure is parallel (and strictly related) to the local Gromov-Witten theory of curves…

Algebraic Geometry · Mathematics 2007-05-23 Renzo Cavalieri

Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…

Formal Languages and Automata Theory · Computer Science 2026-01-15 Peter Kostolányi , Andrej Ravinger

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

A classical result in quantum topology is that oriented 2-dimensional topological quantum field theories (2-TQFTs) are fully classified by commutative Frobenius algebras. In 2006, Turaev and Turner introduced additional structure on…

Quantum Algebra · Mathematics 2025-11-04 Agustina Czenky , Jacob Kesten , Abiel Quinonez , Chelsea Walton

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Logic · Mathematics 2020-05-28 Tomasz Witczak

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

Computational Complexity · Computer Science 2019-08-29 Hans Raj Tiwary

We construct extended TQFTs associated to Rozansky--Witten models with target manifolds $T^*\mathbb{C}^n$. The starting point of the construction is the 3-category whose objects are such Rozansky--Witten models, and whose morphisms are…

Mathematical Physics · Physics 2025-04-15 Ilka Brunner , Nils Carqueville , Daniel Roggenkamp

A complete classification and character formulas for finite-dimensional irreducible representations of the rational Cherednik algebra of type A is given. Less complete results for other types are obtained. Links to the geometry of affine…

Representation Theory · Mathematics 2007-05-23 Yuri Berest , Pavel Etingof , Victor Ginzburg

A faithful $(1+1)$ TQFT has recently been constructed, but the existence of a faithful $(2+1)$ TQFT remains an open question, that subsumes the hard problem of linearity of mapping class groups of surfaces. To circumvent the latter problem…

Geometric Topology · Mathematics 2025-05-28 Dušan Đorđević , Danica Kosanović , Jovana Nikolić , Zoran Petrić

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

Formal Languages and Automata Theory · Computer Science 2018-02-22 Georg Zetzsche

We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier…

Logic in Computer Science · Computer Science 2018-01-03 Manfred Kufleitner , Pascal Weil

We give a brief exposition of the 2d TQFT that captures the structure of the GL Verlinde numbers, following Witten.

Algebraic Geometry · Mathematics 2010-02-16 Alina Marian , Dragos Oprea

This is a tutorial on finite automata. We present the standard material on determinization and minimization, as well as an account of the equivalence of finite automata and monadic second-order logic. We conclude with an introduction to the…

Formal Languages and Automata Theory · Computer Science 2012-02-16 Howard Straubing , Pascal Weil

This is an invited contribution to the 2nd edition of the Encyclopedia of Mathematical Physics. We give an overview of 3-dimensional topological quantum field theories (TQFTs) and the corresponding quantum invariants of 3-manifolds. We…

Geometric Topology · Mathematics 2024-01-22 Kursat Sozer , Alexis Virelizier

We find explicit bases for naturally defined lattices over a ring of algebraic integers in the SO(3) TQFT-modules of surfaces at roots of unity of odd prime order. Some applications relating quantum invariants to classical 3-manifold…

Quantum Algebra · Mathematics 2015-12-22 Patrick M. Gilmer , Gregor Masbaum

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior