English
Related papers

Related papers: Extensions and Limits of the Specker-Blatter Theor…

200 papers

We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…

Logic · Mathematics 2023-06-16 Anupam Das , Lukas Melgaard

We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends the previously claimed result by the first and third authors…

Logic in Computer Science · Computer Science 2025-11-05 Bahareh Afshari , Giacomo Barlucchi , Graham E. Leigh

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

Formal Languages and Automata Theory · Computer Science 2026-04-28 Marius Bozga , Radu Iosif , Florian Zuleger

In a paper from 1960, Felix Browder established a theorem concerning the continuation of the fixed points of a family of continuous functions $f_t:X\to X$ depending continuously on a parameter $t\in [0,1]$, where $X$ is a convex and compact…

Functional Analysis · Mathematics 2023-03-06 Pablo Amster

The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics. It has only been exactly solved for the special case of dimer coverings in two dimensions. In earlier work, Stanley proved a…

Combinatorics · Mathematics 2007-05-23 N. Anzalone , J. Baldwin , I. Bronshtein , T. K. Petersen

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

Discrete Mathematics · Computer Science 2022-06-30 Jan Dreier , Nikolas Mählmann , Amer E. Mouawad , Sebastian Siebertz , Alexandre Vigny

For the cyclic group $C_2$ we give a complete description of the derived category of perfect complexes of modules over the constant Mackey ring $\underline{\mathbb{Z}/\ell}$, for $\ell$ a prime. This is fairly simple for $\ell$ odd, but for…

Algebraic Topology · Mathematics 2023-07-03 Daniel Dugger , Christy Hazel , Clover May

We prove the following two results. \begin{enumerate} \item Let $\mathcal{A}$ be a unital commutative C*-algebra and $\mathcal{A}^d$ be the standard Hilbert C*-module over $\mathcal{A}$. Let $n\geq d$. If $\{\tau_j\}_{j=1}^n$ is any…

Operator Algebras · Mathematics 2022-01-04 K. Mahesh Krishna

Slattery has generalized Brauer's theory of p-blocks of finite groups to pi-blocks of pi-separable groups where pi is a set of primes. In this setting we show that the order of a defect group of a pi-block B is bounded in terms of the…

Representation Theory · Mathematics 2018-10-16 Benjamin Sambale

Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…

Logic in Computer Science · Computer Science 2016-09-15 Gaëlle Fontaine , Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Loredana Sorrentino

We introduce a new data structure for answering connectivity queries in undirected graphs subject to batched vertex failures. Precisely, given any graph G and integer k, we can in fixed-parameter time construct a data structure that can…

Data Structures and Algorithms · Computer Science 2021-11-09 Michał Pilipczuk , Nicole Schirrmacher , Sebastian Siebertz , Szymon Toruńczyk , Alexandre Vigny

We consider meson scattering in the framework of the lattice strong coupling expansion. In particular we derive an expression for the 4-point function of meson operators in the planar limit of scalar Chromodynamics. Interestingly, in the…

High Energy Physics - Lattice · Physics 2018-03-14 Adi Armoni , Edwin Ireson , Davide Vadacchino

An element $e$ of a $3$-connected matroid $M$ is elastic if ${\rm si}(M/e)$, the simplification of $M/e$, and ${\rm co}(M\backslash e)$, the cosimplification of $M\backslash e$, are both $3$-connected. It was recently shown that if…

Combinatorics · Mathematics 2022-07-20 George Drummond , Charles Semple

This essay contains three parts. The first part of essay focuses on the hypothesis of the functional semantic constructions (FSC-Hypothesis). This hypothesis explains that a language, a number, a money are the functional semantic…

History and Overview · Mathematics 2007-05-23 Y. Semenov

In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…

Complex Variables · Mathematics 2021-06-15 Alexander Brudnyi

Given a class C of word languages, the C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the…

Formal Languages and Automata Theory · Computer Science 2017-09-29 Thomas Place , Marc Zeitoun

By a bounded backward sequence of the operator $T$ we mean a bounded sequence $\{x_n\}$ satisfying $Tx_{n+1}=x_n$. In \cite{Pa} we have characterized contractions with strongly stable nonunitary part in terms of bounded backward sequences.…

Functional Analysis · Mathematics 2012-06-05 Patryk Pagacz

In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…

Representation Theory · Mathematics 2024-06-19 Marino Romero , Nolan Wallach

We discuss the structure of the Motzkin algebra $M_k(D)$ by introducing a sequence of idempotents and the basic construction. We show that $\cup_{k\geq 1}M_k(D)$ admits a factor trace if and only if $D\in \{2\cos(\pi/n)+1|n\geq 3\}\cup…

Representation Theory · Mathematics 2022-12-27 Vaughan F. R. Jones , Jun Yang

Let $G$ be a finite group, $N$ a normal subgroup of $G$, and $k$ a field of characteristic $p>0$. In this paper, we formulate the brick version of Clifford's theorem under suitable assumptions and prove it by using the theory of wide…

Representation Theory · Mathematics 2023-12-13 Yuta Kozakai , Arashi Sakai
‹ Prev 1 8 9 10 Next ›