English
Related papers

Related papers: Types, Codes and TFTs

200 papers

When can two strongly rational vertex operator algebras or 1+1d rational conformal field theories (RCFTs) be related by topological manipulations? For vertex operator algebras, the term "topological manipulations" refers to operations like…

High Energy Physics - Theory · Physics 2025-01-13 Sven Möller , Brandon C. Rayhaun

In this paper, we propose two-sorted modal logics for the representation and reasoning of concepts arising from rough set theory (RST) and formal concept analysis (FCA). These logics are interpreted in two-sorted bidirectional frames, which…

Logic · Mathematics 2023-09-11 Prosenjit Howlader , Churn-Jung Liau

In this article we give examples which show that the TQFT representations of the mapping class groups derived from quantum SU(N) for N>2 are generically decomposable. One general decomposition of the representations is induced by the…

Geometric Topology · Mathematics 2007-06-27 Qi Chen , Thomas Kerler

We consider the relation between affine Toda field theories (ATFT) and Landau-Ginzburg Lagrangians as alternative descriptions of deformed 2d CFT. First, we show that the two concrete implementations of the deformation are consistent once…

High Energy Physics - Theory · Physics 2007-05-23 Jose Gaite

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

We use the theory of q-characters to establish a number of short exact sequences in the category of finite-dimensional representations of the quantum affine groups of types A and B. That allows us to introduce a set of 3-term recurrence…

Quantum Algebra · Mathematics 2012-12-07 E. Mukhin , C. A. S. Young

We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs.

Logic in Computer Science · Computer Science 2010-06-30 Sandor vagvolgyi

Two and three-point functions of primary fields in four dimensional CFT have a simple space-time dependences factored out from the combinatoric structure which enumerates the fields and gives their couplings. This has led to the formulation…

High Energy Physics - Theory · Physics 2022-02-22 Robert de Mello Koch , Sanjaye Ramgoolam

Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent,…

Logic in Computer Science · Computer Science 2007-05-23 Robert Harper , Frank Pfenning

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…

Formal Languages and Automata Theory · Computer Science 2016-11-22 Dominique Perrin

The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…

Differential Geometry · Mathematics 2013-01-24 Katharina Neusser

Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Christof Löding , Sarah Winter

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

Logic in Computer Science · Computer Science 2019-05-14 Lê Thành Dũng Nguyên

Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…

Logic in Computer Science · Computer Science 2023-05-11 Zhibo Chen , Frank Pfenning

In this paper, we present a construction toward a new type of TQFTs at the crossroads of low-dimensional topology, algebraic geometry, physics, and homotopy theory. It assigns TMF-modules to closed 3-manifolds and maps of TMF-modules to…

Algebraic Topology · Mathematics 2025-09-17 Sergei Gukov , Vyacheslav Krushkal , Lennart Meier , Du Pei

We define the notions of unital/counital/biunital infinitesimal anti-symmetric bialgebras and coFrobenius bialgebras and discuss their algebraic properties. We also define the notion of a graded 2D open-closed TQFT. These structures arise…

Symplectic Geometry · Mathematics 2024-09-11 Kai Cieliebak , Alexandru Oancea

We consider commutative Frobenius pseudomonoids in the bicategory of spans, and we show that they are in correspondence with 2-Segal cosymmetric sets. Such a structure can be interpreted as a coherent 2-dimensional topological quantum field…

Algebraic Topology · Mathematics 2026-01-01 Sophia E Marx , Rajan Amit Mehta