Related papers: Types, Codes and TFTs
We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
We construct and study a new family of TQFTs based on nilpotent highest weight representations of quantum sl(2) at a root of unity indexed by generic complex numbers. This extends to cobordisms the non-semi-simple invariants defined in…
We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…
Type-and-effect systems incorporate information about the computational effects, e.g., state mutation, probabilistic choice, or I/O, a program phrase may invoke alongside its return value. A semantics for type-and-effect systems involves a…
The decomposition of an arbitrary axiomatic topological quantum field theory or TQFT into indecomposable theories is given. In particular, unitary TQFT's in arbitrary dimensions are shown to decompose into a sum of theories in which the…
The purpose of this paper is to describe an analogue of a construction of Costello in the context of finite-dimensional differential graded Frobenius algebras which produces closed forms on the decorated moduli space of Riemann surfaces. We…
We construct higher categories of iterated spans, possibly equipped with extra structure in the form of "local systems", and classify their fully dualizable objects. By the Cobordism Hypothesis, these give rise to framed topological quantum…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…
A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…
Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Adopting this perspective, we generalise two existing program…
The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…
We show that reasonably well behaved 3d and 4D TQFts must contain certain algebraic structures. In 4D, we find both Hopf categories and trialgebras.
In this paper, we begin constructing a new finite-dimensional topological quantum field theory (TQFT) for three-manifolds, based on group PSL(2,C) and its action on a complex variable by fractional-linear transformations, by providing its…
We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient…
We construct families of TQFT's over the finite field Z/pZ starting from an integral TQFT obtained by Frohman and Nicas. These TQFT's are likely to describe the constant order contributions of the cyclotomic integer expansions of the…
We revisit the question of whether the Crane-Yetter topological quantum field theory (TQFT) associated to a modular tensor category admits a fully extended refinement. More specifically, we use tools from stable homotopy theory to classify…
For any symmetric monoidal category $\mathcal{D}$, Lauda and Pfeiffer showed the equivalence between the $\mathcal{D}$-valued open-closed 2-dimensional TQFTs and the so-called knowledgeable Frobenius algebras (KFAs) in $\mathcal{D}$. Each…
In this paper, we introduce Topological Quantum Field Theories (TQFTs) generalizing the arithmetic computations done by Hausel and Rodr\'iguez-Villegas and the geometric construction done by Logares, Mu\~noz, and Newstead to study…