English
Related papers

Related papers: Weihrauch Degrees, Omniscience Principles and Weak…

200 papers

We systematize and generalize recent results of Gerlach and Gl\"uck on the strong convergence and spectral theory of bounded (positive) operator semigroups $(T_s)_{s\in S}$ on Banach spaces (lattices). (Here, $S$ can be an arbitrary…

Functional Analysis · Mathematics 2018-12-17 Jochen Glück , Markus Haase

The aim of this paper is to determine the logical and computational strength of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of it. We show that BW is instance-wise equivalent to the weak K\"onig's lemma for…

Logic · Mathematics 2012-05-08 Alexander P. Kreuzer

In this paper, we present some necessary and sufficient conditions for semi-compact operators being almost L-weakly compact (resp. almost M-weakly compact) and the converse. Mainly, we prove that if $X$ is a nonzero Banach space, then every…

Functional Analysis · Mathematics 2019-04-24 Hui Li , Zili Chen

It is well-known that any finite $\Pi^{0}_{1}$-class of $2^{\mathbb N}$ has a computable member. Then, how can we understand this in the context of reverse mathematics? In this note, we consider several very weak fragments of K\H{o}nig's…

Logic · Mathematics 2021-01-05 Stephen G. Simpson , Keita Yokoyama

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Piotr Hofman , Patrick Totzke

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

Logic · Mathematics 2015-03-19 Arno Pauly , Martin Ziegler

We investigate computability theoretic and descriptive set theoretic contents of various kinds of analytic choice principles by performing detailed analysis of the Medvedev lattice of $\Sigma^1_1$-closed sets. Among others, we solve an open…

Logic · Mathematics 2019-07-08 Paul-Elliot Anglès d'Auriac , Takayuki Kihara

We prove that if the Hardy-Littlewood maximal operator is bounded on a separable Banach function space $X(\mathbb{R}^n)$ and on its associate space $X'(\mathbb{R}^n)$ and a maximally modulated Calder\'on-Zygmund singular integral operator…

Functional Analysis · Mathematics 2014-08-20 Alexei Yu. Karlovich

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…

Logic · Mathematics 2024-01-24 Arno Pauly , Giovanni Soldà

In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas' lemma is also not exact (it…

Optimization and Control · Mathematics 2017-04-14 Minghui Liu , Gabor Pataki

Since the introduction of the CDC 6600 in 1965 and its `scoreboarding' technique processors have not (necessarily) executed instructions in program order. Programmers of high-level code may sequence independent instructions in arbitrary…

Logic in Computer Science · Computer Science 2021-05-07 Robert J. Colvin

We study when low coordinate degree functions (LCDF) -- linear combinations of functions depending on small subsets of entries of a vector -- can hypothesis test between high-dimensional probability measures. These functions are a…

Statistics Theory · Mathematics 2024-03-13 Dmitriy Kunisky

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…

Logic in Computer Science · Computer Science 2023-06-22 Eike Neumann , Martin Pape , Thomas Streicher

The configuration of latent representations plays a critical role in determining the performance of deep neural network classifiers. In particular, the emergence of well-separated class embeddings in the latent space has been shown to…

Machine Learning · Computer Science 2025-02-11 Luigi Sbailò , Luca Ghiringhelli

We initiate the study of nonsmooth optimization problems under bounded local subgradient variation, which postulates bounded difference between (sub)gradients in small local regions around points, in either average or maximum sense. The…

Optimization and Control · Mathematics 2024-11-05 Jelena Diakonikolas , Cristóbal Guzmán

The Weak Gravity Conjecture has recently been re-formulated in terms of a particle with non-negative self-binding energy. Because of the dual conformal field theory (CFT) formulation in the anti-de Sitter space the conformal dimension…

High Energy Physics - Theory · Physics 2022-01-19 Oleg Antipin , Jahmall Bersini , Francesco Sannino , Zhi-Wei Wang , Chen Zhang

Let $V$ be a vertex operator algebra and $A^{\infty}(V)$ and $A^{N}(V)$ for $N\in \mathbb{N}$ the associative algebras introduced by the author in [H5]. For a lower-bounded generalized $V$-module $W$, we give $W$ a structure of graded…

Quantum Algebra · Mathematics 2022-11-09 Yi-Zhi Huang

This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit…

Computational Complexity · Computer Science 2019-03-14 Florian Steinberg

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Data Structures and Algorithms · Computer Science 2025-12-23 Robert Streit , Vijay K. Garg

Taking matrix as a synonym for a numerical function on the Cartesian product of two (in general, infinite) sets, a simple purely algebraic "reciprocity property" says that the set of rows spans a finite-dim space iff the set of columns does…

Functional Analysis · Mathematics 2008-08-29 Eliahu Levy