English
Related papers

Related papers: Characterising SJT reducibility

200 papers

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

Representation Theory · Mathematics 2018-10-08 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

Existing definitions of the relativizations of \NCOne, \L\ and \NL\ do not preserve the inclusions $\NCOne \subseteq \L$, $\NL\subseteq \ACOne$. We start by giving the first definitions that preserve them. Here for \L\ and \NL\ we define…

Computational Complexity · Computer Science 2012-04-26 Klaus Aehlig , Stephen Cook , Phuong Nguyen

The Thirring model with random couplings is a translationally invariant generalisation of the SYK model to 1+1 dimensions, which is tractable in the large N limit. We compute its two point function, at large distances, for any strength of…

High Energy Physics - Theory · Physics 2017-10-25 Micha Berkooz , Prithvi Narayan , Moshe Rozali , Joan Simón

The betweenness function $bet(n)$ is the minimum number of total orderings of $n$ objects such that for any three distinct objects $a$, $b$ and $c$, there is an ordering in which $b$ is between $a$ and $c$. The nonbetweenness function…

Combinatorics · Mathematics 2016-02-19 Ross Atkins

Claims about recursive self-improvement in AI often slide from repeated internal revision to the possibility of qualitatively stronger capability without clearly distinguishing the underlying computational regimes. This paper gives a formal…

Computational Complexity · Computer Science 2026-05-28 Chien-Ping Lu

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…

Computational Complexity · Computer Science 2011-06-24 Hector Zenil , Fernando Soler-Toscano , Joost J. Joosten

This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…

Logic · Mathematics 2026-05-19 Merlin Carl

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

Logic · Mathematics 2024-11-20 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

For $s \geq 0$ and a parameter $0 < \beta < 1$, the weak pair correlation function $f_{N,\beta}(s)$ for the first $N \in \mathbb{N}$ elements of a sequence $(x_n)_{n \in \mathbb{N}} \subset[0,1]$ is evidently non-decreasing in $s$.…

Number Theory · Mathematics 2026-04-28 Christian Weiß

Let H be a reductive subgroup of a reductive group G over an algebraically closed field k. We consider the action of H on G^n, the n-fold Cartesian product of G with itself, by simultaneous conjugation. We give a purely algebraic…

Group Theory · Mathematics 2010-06-30 M. Bate , B. Martin , G. Roehrle , R. Tange

We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…

Logic in Computer Science · Computer Science 2023-07-31 Yannick Forster , Dominik Kirst , Niklas Mück

We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…

Dynamical Systems · Mathematics 2014-09-23 Michael Hochman , Tom Meyerovitch

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

Computational Complexity · Computer Science 2024-06-04 Riccardo Gozzi , Olivier Bournez

We apply the techniques of computable model theory to the distance function of a graph. This task leads us to adapt the definitions of several truth-table reducibilities so that they apply to functions as well as to sets, and we prove…

Logic · Mathematics 2018-02-12 Wesley Calvert , Russell Miller , Jennifer Chubb Reimann

We study $A$-hypergeometric systems $H_A(\beta)$ in the sense of Gelfand, Kapranov and Zelevinsky under two aspects: the structure of their holonomically dual system, and reducibility of their rank module. We prove first that rank-jumping…

Algebraic Geometry · Mathematics 2007-05-23 Uli Walther

Let $\mathfrak g$ be a semisimple Lie algebra and $\mathfrak k\subset\mathfrak g$ be a reductive in $\mathfrak g$ subalgebra. A $(\mathfrak g, \mathfrak k)$-module is a $\mathfrak g$-module which after restriction to $\mathfrak k$ becomes a…

Representation Theory · Mathematics 2011-03-16 Alexey Petukhov

Let $T$ be a bounded quaternionic normal operator on a right quaternionic Hilbert space $\mathcal{H}$. We show that $T$ can be factorized in a strongly irreducible sense, that is, for any $\delta >0$ there exist a compact operator $K$ with…

Functional Analysis · Mathematics 2020-10-15 P. Santhosh Kumar

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p. We study J.-P. Serre's notion of G-complete reducibility for subgroups of G. In particular, for a subgroup H and a normal subgroup N of H,…

Group Theory · Mathematics 2008-02-29 M. Bate , B. M. S. Martin , G. E. Roehrle

Let $k$ be a nonperfect separably closed field. Let $G$ be a connected reductive algebraic group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In particular, we present the…

Group Theory · Mathematics 2021-11-09 Falk Bannuscher , Alastair Litterick , Tomohiro Uchiyama

Let $k$ be a nonperfect separably closed field. Let $G$ be a (possibly non-connected) reductive group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In our previous work, we…

Group Theory · Mathematics 2019-03-15 Tomohiro Uchiyama