English
Related papers

Related papers: Multidimensional tilings and MSO logic

200 papers

Seese's conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be…

Logic in Computer Science · Computer Science 2023-08-04 Anuj Dawar , Abhisekh Sankaran

Recently holographic prescriptions are proposed to compute quantum complexity of a given state in the boundary theory. A specific proposal known as `holographic subregion complexity' is supposed to calculate the the complexity of a reduced…

High Energy Physics - Theory · Physics 2017-10-25 Elaheh Bakhshaei , Ali Mollabashi , Ahmad Shirzad

A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…

Category Theory · Mathematics 2020-06-22 Pau Enrique Moliner , Chris Heunen , Sean Tull

In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the…

cmp-lg · Computer Science 2008-02-03 Frank Morawietz , Tom Cornell

This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…

Discrete Mathematics · Computer Science 2021-05-04 Etienne Moutot , Coline Petit-Jean

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

Differential Geometry · Mathematics 2025-05-09 Jonathan Kress , Konrad Schöbel , Andreas Vollmer

Torsion pairs in the category of finitely presented modules over a noetherian ring can be parametrised by the class of cosilting modules. In this paper, we characterise such modules in terms of their indecomposable summands, providing a new…

Representation Theory · Mathematics 2019-11-07 Karin Baur , Rosanna Laking

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

Logic · Mathematics 2021-01-20 Christian Herrmann

We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order- invariance is undecidable in general and, thus, one strives for…

Logic in Computer Science · Computer Science 2016-03-31 Kord Eickmeyer , Michael Elberfeld , Frederik Harwath

Silting modules are abundant. Indeed, they parametrise the definable torsion classes over a noetherian ring, and the hereditary torsion pairs of finite type over a commutative ring. Also the universal localisations of a hereditary ring, or…

Representation Theory · Mathematics 2018-01-26 Lidia Angeleri Hügel

The monadic shallow linear (MSL) class is a decidable fragment of first-order Horn clauses that was discovered and rediscovered around the turn of the century, with applications in static analysis and verification. We propose a new class of…

Programming Languages · Computer Science 2022-10-27 Jerome Jochems , Eddie Jones , Steven Ramsay

In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows. The hierarchy collapses on the third level,…

Formal Languages and Automata Theory · Computer Science 2014-08-29 Ville Salo , Ilkka Törmä

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

Logic in Computer Science · Computer Science 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger

In this chapter we study modal logics of topological spaces in the combined language with the derivational modality and the difference modality. We give axiomatizations and prove completeness for the following classes: all spaces,…

Logic · Mathematics 2014-05-27 Andrey Kudinov , Valentin Shehtman

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

Logic in Computer Science · Computer Science 2015-07-01 Amélie Gheerbrant , Balder ten Cate

For a finite dimensional algebra $A$, we establish correspondences between torsion classes and wide subcategories in $mod(A)$. In case $A$ is representation finite, we obtain an explicit bijection between these two classes of subcategories.…

Representation Theory · Mathematics 2017-06-19 Frederik Marks , Jan Stovicek

We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of height linear in n. We prove this by counting types with respect…

Logic in Computer Science · Computer Science 2022-02-22 Lauri Hella , Miikka Vilander

Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the…

Logic in Computer Science · Computer Science 2025-07-23 Joris Nieuwveld , Joël Ouaknine

We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…

Rings and Algebras · Mathematics 2007-06-17 Claude Cibils

The scaling of the fundamental limits of the second hyperpolarizability is used to define the intrinsic second hyperpolarizability, which aids in identifying material classes with ultralarge nonlinear-optical response per unit of molecular…

Optics · Physics 2016-11-03 Javier Perez-Moreno , Shoresh Shafei , Mark G. Kuzyk