English
Related papers

Related papers: There is No Composition in the Computable Reducibi…

200 papers

Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…

Logic · Mathematics 2016-08-09 Peter Cholak

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

We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve with computable length that does not belong to any computable…

Logic · Mathematics 2011-06-17 Timothy H. McNicholl

We show that there is no way to define degrees of 0-cycles on Artin stacks with proper good moduli spaces so that (i) the degree of an ordinary point is non-zero, and (ii) degrees are compatible with closed immersions.

Algebraic Geometry · Mathematics 2014-08-07 Dan Edidin , Anton Geraschenko , Matthew Satriano

We study the degree of irreducible morphisms in any Auslander-Reiten component of a finite dimensional algebra over an algebraically closed field. We give a characterization for an irreducible morphism to have finite left (or right) degree.…

Representation Theory · Mathematics 2016-05-11 Patrick Le Meur , Claudia Chaio , Sonia Trepode

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Logic · Mathematics 2026-01-19 Joey Lakerdas-Gayle

Le Roux and Ziegler asked whether every simply connected compact nonempty planar co-c.e. closed set always contains a computable point. In this paper, we solve the problem of le Roux and Ziegler by showing that there exists a contractible…

Logic · Mathematics 2011-10-28 Takayuki Kihara

We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…

Logic · Mathematics 2015-12-29 Peter Cholak , Rachel Epstein

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

Representation Theory · Mathematics 2016-11-29 Volodymyr Mazorchuk , Kaiming Zhao

We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…

Logic · Mathematics 2021-02-24 Vasco Brattka , Guido Gherardi

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…

Logic · Mathematics 2024-02-14 Ang Li

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes…

Quantum Physics · Physics 2023-12-18 Arthur J. Parzygnat , Benjamin P. Russo

It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial $\Pi^0_1$ subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise…

Logic · Mathematics 2013-09-10 Kojiro Higuchi , Takayuki Kihara

This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…

Logic · Mathematics 2025-02-19 Davide Trotta , Manlio Valenti , Valeria de Paiva

Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…

Computational Complexity · Computer Science 2026-04-08 Joseph M. Hellerstein

We prove that there is no 1-complemented subspace of finite codimension in separable rearrangament-invariant function spaces.

Functional Analysis · Mathematics 2009-09-25 Beata Randrianantoanina

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Rings and Algebras · Mathematics 2011-02-23 Tamás Waldhauser

The contraction is applied to obtaining of integrable systems associated with nonsemisimple algebras. The effect of contraction is splitting off some components from initial system without loss of integrability.

solv-int · Physics 2009-10-30 N. A. Gromov , I. V. Kostyakov , V. V. Kuratov

In this paper, we study a class of infinite simple Lie conformal algebras associated to a class of generalized Block type Lie algebras. The central extensions, conformal derivations and free intermediate series modules of this class of Lie…

Representation Theory · Mathematics 2019-07-01 Yanyong Hong , Yang Pan , Haibo Chen