English
Related papers

Related papers: An Example of Pi^0_3-complete Infinitary Rational …

200 papers

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

Logic in Computer Science · Computer Science 2019-06-28 Jiri Adamek

We introduce a novel technique to analyse unambiguous B\"uchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant…

Formal Languages and Automata Theory · Computer Science 2024-09-17 Stefan Kiefer , Cas Widdershoven

In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…

Combinatorics · Mathematics 2018-11-07 A. Saki , D. Kiani

In this paper we introduce a notion of rational singularities associated to pairs $(X, \ba^t)$ where $X$ is a variety, $\ba$ is an ideal sheaf and $t$ is a nonnegative real number. We prove that most standard results about rational…

Algebraic Geometry · Mathematics 2009-04-28 Karl Schwede , Shunsuke Takagi

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Aehlig

A finite family of $R_I$ polynomials is introduced and studied. It consists in a set of polynomials of $_{3}F_{2}$ form whose biorthogonality to an ensemble of rational functions is spelled out. These polynomials are shown to satisfy two…

Classical Analysis and ODEs · Mathematics 2022-09-16 Luc Vinet , Meri Zaimi , Alexei Zhedanov

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…

Logic in Computer Science · Computer Science 2010-01-14 Dietrich Kuske , Jiamou Liu , Markus Lohrey

In this paper, we prove the rationality of the gluing relation of edge replacement systems, which were introduced for studying rearrangement groups of fractals. More precisely, we describe an algorithmic procedure for building a finite…

Group Theory · Mathematics 2025-03-24 Davide Perego , Matteo Tarocchi

Suppose $Y$ is a compact, connected, oriented 3-manifold possibly with boundary, such that $\pi_1(Y)$ is infinite. Let $\operatorname{Diff}_\partial(I\times Y)$ denote the group of self-diffeomorphisms of $I\times Y$ that are equal to the…

Geometric Topology · Mathematics 2026-02-11 Jianfeng Lin , Yi Xie , Boyu Zhang

We show that the $n$'th digit of the base-$b$ representation of the golden ratio is a finite-state function of the Zeckendorf representation of $b^n$, and hence can be computed by a finite automaton. Similar results can be proven for any…

Formal Languages and Automata Theory · Computer Science 2024-09-10 Aaron Barnoff , Curtis Bright , Jeffrey Shallit

Much work has been done to study groups with few rational conjugacy classes or few rational irreducible characters. In this paper we look at the opposite extreme. Let $G$ be a finite group. Given a conjugacy class $K$ of $G$, we say it is…

Group Theory · Mathematics 2025-02-05 Gabriel A. L. Souza

We study aleph_0-stable theories, and prove that if T either has eni-DOP or is eni-deep, then its class of countable models is Borel complete. We introduce the notion of lambda-Borel completeness and prove that such theories are…

Logic · Mathematics 2014-06-05 Michael C. Laskowski , Saharon Shelah

If $G$ is a finite group, an irreducible complex-valued character $\chi$ is called rational if $\chi(g)$ is rational for all $g\in G$. Also, a conjugacy class $x^G$ is called rational, if for all irreducible complex-valued character $\chi$,…

Group Theory · Mathematics 2025-03-27 Dilpreet Kaur , Saikat Panja

Every indefinite binary form occurs as the Picard lattice of some K3-surface. The group of its isometries, or automorphs, coincides with the automorphism group of the K3-surface, but only up to finite groups. The classical theory of…

Algebraic Geometry · Mathematics 2008-04-07 Federica Galluzzi , Giuseppe Lombardo , Chris Peters

We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic B\"uchi automata and prove it to be tight up to an $O(n)$ factor, where $n$ is the…

Formal Languages and Automata Theory · Computer Science 2014-09-12 Sven Schewe , Thomas Varghese

We introduce partially ordered two-way B\"uchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way B\"uchi automata are B\"uchi automata which can change the direction…

Formal Languages and Automata Theory · Computer Science 2015-05-19 Manfred Kufleitner , Alexander Lauser

We compare crystal combinatorics of the level $2$ Fock space with the classification of unitary representations of type $B$ rational Cherednik algebras to show that any finite-dimensional unitary irreducible representation of such an…

Representation Theory · Mathematics 2019-08-27 Emily Norton

It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism…

Functional Analysis · Mathematics 2014-02-26 Valentin Ferenczi , Alain Louveau , Christian Rosendal

Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…

Computational Complexity · Computer Science 2009-08-04 Olivier Finkel

We prove that the category $\mathsf{SBor}$ of standard Borel spaces is the (bi-)initial object in the 2-category of countably complete Boolean (countably) extensive categories. This means that $\mathsf{SBor}$ is the universal category…

Logic · Mathematics 2024-03-18 Ruiyuan Chen