Related papers: Types, Codes and TFTs
Studies of modular linear differential equations (MLDE) for the classification of rational CFT characters have been limited to the case where the coefficient functions (in monic form) have no poles, or poles at special points of moduli…
Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations,…
We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the…
We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…
The correlators of two-dimensional rational conformal field theories that are obtained in the TFT construction of [FRSI,FRSII,FRSIV] are shown to be invariant under the action of the relative modular group and to obey bulk and boundary…
We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued…
Nearly Frobenius structures and 2-dimensional Almost TQFTs were introduced and shown to be in categorical equivalence in arXiv:1907.05470 in the attempt to extend the Atiyah-Segal's definition to the category of infinite dimensional vector…
The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a…
A concise review of the notions of elliptic functions, modular forms, and theta-functions is provided, devoting most of the paper to applications to Conformal Field Theory (CFT), introduced within the axiomatic framework of quantum field…
The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…
We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…
We formulate two-dimensional rational conformal field theory as a natural generalization of two-dimensional lattice topological field theory. To this end we lift various structures from complex vector spaces to modular tensor categories.…
The class of regular transformations has several equivalent characterizations such as functional MSO transductions, deterministic two-way transducers, streaming string transducers, as well as regular transducer expressions (RTE). For…
We prove a family of 3-term relations in the Grothendieck ring of the category of finite-dimensional modules over the affine quantum algebra of type $G_2$ extending the celebrated $T$-system relations of type $G_2$. We show that these…
We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is closed under maximal bifix decoding.
We classify the simple infinite dimensional integrable modules with finite dimensional weight spaces over the quantized enveloping algebra of an untwisted affine algebra. We prove that these are either highest (lowest) weight integrable…
It is well-known that classical two-dimensional topological field theories are in one-to-one correspondence with commutative Frobenius algebras. An important extension of classical two-dimensional topological field theories is provided by…
A finite formulation of quantum field theory based on a system of differential equations reminiscent of the Callan-Symanzik equations is discussed. This system of equations was previously formulated in the bare language. We rederive it in a…
We construct certain tensor categories that are dominated by finitely many simple objects. Objects in these categories are modules over rings of algebra integers. We show how to obtain TQFTs defined over algebra integers from these…
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata)…