Related papers: Boolean TQFTs with accumulating defects, sofic sys…
This work continues the author's article in Rus. J. Nonlinear Dynamics (2010, v.6, No.4) and contains applications of the Boolean functions method to investigation of the admissible regions and the phase topology of three algebraically…
We study when a map between two subsets of a Boolean domain W can be extended to an automorphism of W. Under many hypotheses, if the underlying Boolean algebra is complete or if the sets are finite or Boolean domains, the necessary and…
Topological orders are a prominent paradigm for describing quantum many-body systems without symmetry-breaking orders. We present a topological quantum field theoretical (TQFT) study on topological orders in five-dimensional spacetime…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
Quantum field theories can exhibit various generalized symmetry structures, among which higher-group symmetries and non-invertible symmetry defects are particularly prominent. In this work, we explore a new general scenario in which these…
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…
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…
We study a special sort of 2-dimensional extended Topological Quantum Field Theories (TQFTs) which we call open-closed TQFTs. These are defined on open-closed cobordisms by which we mean smooth compact oriented 2-manifolds with corners that…
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…
We adapt the notion of a (relatively) definable subset of Aut(M) when M is a saturated model to the case Aut(M/A) when M is atomic and strongly omega-homogeneous over A. We discuss the existence and uniqueness of invariant measures on the…
Hyperproperties lift conventional trace properties from a set of execution traces to a set of sets of execution traces. Hyperproperties have been shown to be a powerful formalism for expressing and reasoning about information-flow security…
The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…
In the framework of the Closed-Time-Path formalism, we show how topological defects may arise in Quantum Field Theory as result of a localized (inhomogeneous) condensation of particles. We demonstrate our approach on two examples; kinks in…
We construct the moduli spaces associated to the solutions of equations of motion (modulo gauge transformations) of the Poisson sigma model with target being an integrable Poisson manifold. The construction can be easily extended to a case…
A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory in response to sequential input strings. We define the language of a QFA as the set of strings that lead…
We study gauging operations (or group extensions) in (smeared) boundary conformal field theories (BCFTs) and bulk conformal field theories, and their applications to various phenomena in topologically ordered systems. We apply the resultant…
We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…
We provide a description of adequate categorical data to give a Turaev-Viro type state-sum construct of invariants of 3-manifolds with a system of defects, generalizing the Dijkgraaf-Witten type invariants of our earlier work. We term the…
We extend the TFT construction of CFT correlators of [arXiv:hep-th/0204148] to so-called finite logarithmic CFTs for which the algebraic input data is no longer semisimple but still finite. More specifically, starting from the data of a…
Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages over finite words. In symbolic automata (or automata modulo…