English
Related papers

Related papers: Boolean TQFTs with accumulating defects, sofic sys…

200 papers

We formulate a family of spin Topological Quantum Filed Theories (spin-TQFTs) as fermionic generalization of bosonic Dijkgraaf-Witten TQFTs. They are obtained by gauging $G$-equivariant invertible spin-TQFTs, or, in physics language,…

High Energy Physics - Theory · Physics 2020-06-01 Meng Guo , Kantaro Ohmori , Pavel Putrov , Zheyan Wan , Juven Wang

In general quantum field theories (QFTs), ordinary (0-form) global symmetries and 1-form symmetries can combine into 2-group global symmetries. We describe this phenomenon in detail using the language of symmetry defects. We exhibit a…

High Energy Physics - Theory · Physics 2019-03-28 Francesco Benini , Clay Cordova , Po-Shen Hsin

Entanglement entropy~(EE) contains signatures of many universal properties of conformal field theories~(CFTs), especially in the presence of boundaries or defects. In particular, {\it topological} defects are interesting since they reflect…

High Energy Physics - Theory · Physics 2022-06-06 Ananda Roy , Hubert Saleur

In this note we survey recent results on automorphisms of affine algebraic varieties, infinitely transitive group actions and flexibility. We present related constructions and examples, and discuss geometric applications and open problems.

Algebraic Geometry · Mathematics 2013-07-18 I. Arzhantsev , H. Flenner , S. Kaliman , F. Kutzschebauch , M. Zaidenberg

The ground states of topological orders condense extended objects and support topological excitations. This nontrivial property leads to nonzero topological entanglement entropy $S_{topo}$ for conventional topological orders. Fracton…

Strongly Correlated Electrons · Physics 2018-04-18 Bowen Shi , Yuan-Ming Lu

Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…

Formal Languages and Automata Theory · Computer Science 2019-10-18 Andreas Stahlbauer

We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…

Group Theory · Mathematics 2023-05-29 Pierre-Emmanuel Caprace , Martin Kassabov

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

The purpose of this work is to bound sofic topological entropy of Toeplitz systems over residually finite groups and to prove the Krieger Theorem about attaining arbitrary entropy by the Toeplitz systems. To achieve these results, we…

Dynamical Systems · Mathematics 2020-12-03 Przemysław Kucharski

We propose a class of field theories featuring solitonic solutions in which topological defects can end when they intersect other defects of equal or higher dimensionality. Such configurations may be termed ``Dirichlet topological…

High Energy Physics - Theory · Physics 2009-10-30 Sean M. Carroll , Mark Trodden

In this paper we propose a naive construction of 2-dimensional extended topological quantum field theories (TQFTs), which can be further generalized to the higher-dimension extended TQFTs.

Quantum Algebra · Mathematics 2007-05-23 Vishvajit V. S. Gautam

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

Formal Languages and Automata Theory · Computer Science 2021-12-23 Gabriele Fici , Jeffrey Shallit

Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2018-09-06 Jean Néraud , Carla Selmi

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Group Theory · Mathematics 2018-04-24 Jorge Almeida , Alfredo Costa

This paper gives a concise introduction into the basic theory of {\omega}-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating…

Formal Languages and Automata Theory · Computer Science 2016-09-13 Thomas Wilke

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

The theory of cumulants is revisited in the "Rota way", that is, by following a combinatorial Hopf algebra approach. Monotone, free, and boolean cumulants are considered as infinitesimal characters over a particular combinatorial Hopf…

Combinatorics · Mathematics 2018-02-01 Kurusch Ebrahimi-Fard , Frederic Patras

We propose a unifying mathematical framework describing the higher categorical structures formed by topological defects in quantum field theory equipped with tangential structures, such as orientations, framings, or…

Mathematical Physics · Physics 2025-05-09 Lukas Müller

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…

Formal Languages and Automata Theory · Computer Science 2009-03-09 Mikolaj Bojanczyk

In this paper we establish an abstraction of on-the-fly determinization of finite-state automata using transition monoids and demonstrate how it can be applied to bound the asymptotics. We present algebraic and combinatorial properties that…

Formal Languages and Automata Theory · Computer Science 2023-08-29 Ivan Baburin , Ryan Cotterell
‹ Prev 1 3 4 5 6 7 10 Next ›