English
Related papers

Related papers: Decomposition Theorems and Model-Checking for the …

200 papers

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

High Energy Physics - Theory · Physics 2008-11-26 Pierre Mathieu , David Ridout

We review work on `decomposition,' a property of two-dimensional theories with 1-form symmetries and, more generally, d-dimensional theories with (d-1)-form symmetries. Decomposition is the observation that such quantum field theories are…

High Energy Physics - Theory · Physics 2022-04-21 Eric Sharpe

We introduce the notion of set-decomposition of a normal G-flat chain. We show that any normal rectifiable $G$-flat chain admits a decomposition in set-indecomposable sub-chains. This generalizes the decomposition of sets of finite…

Analysis of PDEs · Mathematics 2024-11-05 Michael Goldman , Benoît Merlet

One of the main open problems of mathematical physics is to consistently quantize Yang-Mills gauge theory. If such a consistent quantization were to exist, it is reasonable to expect a ``Wightman reconstruction theorem,'' by which a Hilbert…

Mathematical Physics · Physics 2007-05-23 William Gordon Ritter

While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the…

Logic in Computer Science · Computer Science 2014-06-09 Daniel Gorín , Lutz Schröder

We develop the deformation-obstruction calculus for morphisms of complexes with a fixed lift of the codomain, to derived categories of flat nilpotent deformations of abelian categories. As an application, we give an alternative proof that…

Algebraic Geometry · Mathematics 2025-11-14 Pieter Belmans , Wendy Lowen , Shinnosuke Okawa , Andrea T. Ricolfi

We investigate the relationship between measurable differentiable structures on doubling metric measure spaces and derivations. We prove: [1] a decomposition theorem for the module of derivations into free modules; [2] the existence of a…

Metric Geometry · Mathematics 2012-05-16 Andrea Schioppa

We study the decidability and expressiveness issues of $\mu$-calculus on data words and data $\omega$-words. It is shown that the full logic as well as the fragment which uses only the least fixpoints are undecidable, while the fragment…

Logic in Computer Science · Computer Science 2014-04-21 Thomas Colcolmbet , Amaldev Manuel

In this paper, a decomposition theorem for (covariant) unitary group representations on Kaplansky-Hilbert modules over Stone algebras is established, which generalizes the well-known Hilbert space case (where it coincides with the…

Dynamical Systems · Mathematics 2024-02-14 Nikolai Edeko , Markus Haase , Henrik Kreidler

Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…

Let $G = (V,E)$ be a connected graph. A probability measure $\mu$ on $V$ is called "balanced" if it has the following property: if $T_\mu(v)$ denotes the "earth mover's" cost of transporting all the mass of $\mu$ from all over the graph to…

Combinatorics · Mathematics 2025-01-10 Gregory Baimetov , Ryan Bushling , Ansel Goh , Raymond Guo , Owen Jacobs , Sean Lee

The main purpose of this article is to develop an explicit derived deformation theory of algebraic structures at a high level of generality, encompassing in a common framework various kinds of algebras (associative, commutative, Poisson...)…

Algebraic Topology · Mathematics 2025-03-11 Gregory Ginot , Sinan Yalin

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

Logic · Mathematics 2026-05-13 Tenyo Takahashi

This paper describes a generalization of decomposition in orbifolds. In general terms, decomposition states that two-dimensional orbifolds and gauge theories whose gauge groups have trivially-acting subgroups decompose into disjoint unions…

High Energy Physics - Theory · Physics 2021-10-28 Daniel Robbins , Eric Sharpe , Thomas Vandermeulen

This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…

Commutative Algebra · Mathematics 2024-09-20 Henri Lombardi , Claude Quitté

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

Representation Theory · Mathematics 2018-09-25 Calin Chindris , Ryan Kinser

A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive…

Logic in Computer Science · Computer Science 2021-09-20 Clemens Kupke , Johannes Marti , Yde Venema

Let $\mu$ be a Borel measure on $R^d$ which may be non doubling. The only condition that $\mu$ must satisfy is $\mu(B(x,r))\leq C r^n$ for all $x\in R^d$, $r>0$, and for some fixed $0<n\leq d$. In this paper, we develop Littlewood-Paley…

Classical Analysis and ODEs · Mathematics 2007-05-23 Xavier Tolsa

As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible…

Logic in Computer Science · Computer Science 2019-08-13 Tsong-Ming Liaw , Simon C. Lin

We identify a subproblem of the model-checking problem for the epistemic \mu-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that…

Computer Science and Game Theory · Computer Science 2013-10-28 Rodica Bozianu , Catalin Dima , Constantin Enea