English
Related papers

Related papers: Weihrauch Degrees, Omniscience Principles and Weak…

200 papers

We deal with isomorphic Banach-Stone type theorems for closed subspaces of vector-valued continuous functions. Let $\mathbb{F}=\mathbb{R}$ or $\mathbb{C}$. For $i=1,2$, let $E_i$ be a reflexive Banach space over $\mathbb{F}$ with a certain…

Functional Analysis · Mathematics 2019-08-27 Jakub Rondoš , Jiří Spurný

We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…

Logic in Computer Science · Computer Science 2015-07-29 Bas Luttik

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Logic · Mathematics 2019-09-27 Nikolay Bazhenov , Manat Mustafa , Luca San Mauro , Mars Yamaleev

We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…

Logic · Mathematics 2019-03-14 Takayuki Kihara

We study finite energy classes of quasiplurisubharmonic (qpsh) functions in the setting of toric compact K{\"a}hler manifolds. We characterize toric qpsh functions and give necessary and sufficient conditions for them to have finite…

Complex Variables · Mathematics 2018-04-11 Vincent Guedj , Ahmed Zeriahi , Dan Coman , Sibel Sahin

We investigate whether there are inherent limits of parallelization in the (randomized) massively parallel computation (MPC) model by comparing it with the (sequential) RAM model. As our main result, we show the existence of hard functions…

Data Structures and Algorithms · Computer Science 2020-08-18 Kai-Min Chung , Kuan-Yi Ho , Xiaorui Sun

With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…

Data Structures and Algorithms · Computer Science 2014-11-14 Jincheng Mei , Kang Zhao , Bao-Liang Lu

We study properties of continuous semi-homogeneous operators of degree $k$ via various functions (e.g. measures of noncompactness) on all bounded subsets of a Banach space. We prove necessary and sufficient conditions for these functions to…

Functional Analysis · Mathematics 2015-08-19 Nina A. Erzakova

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…

Category Theory · Mathematics 2025-01-28 Antonio Bucciarelli , Pierre-Louis Curien , Antonino Salibra

Given a Banach lattice $L,$ the space of lattice Lipschitz operators on $L$ has been introduced as a natural Lipschitz generalization of the linear notions of diagonal operator and multiplication operator on Banach function lattices. It is…

Functional Analysis · Mathematics 2024-11-19 Roger Arnau , Jose M. Calabuig , Enrique A. Sánchez-Pérez

This paper shows that the basic logic induced by the parallel recurrence of Computability Logic is a proper superset of the basic logic induced by the branching recurrence. The latter is known to be precisely captured by the cirquent…

Logic in Computer Science · Computer Science 2016-02-10 Wenyan Xu , Sanyang Liu

Let $(W,H,\mu)$ be the classical Wiener space where $H$ is the Cameron-Martin space which consists of the primitives of the elements of $L^2([0,1],\,dt)\otimes \R^d$, we denote by $L^2_a(\mu,H)$ the equivalence classes w.r.t. $dt\times…

Probability · Mathematics 2014-02-27 Ali Suleyman Ustunel

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

Logic · Mathematics 2023-07-26 Mark Carney

Randomized parallel algorithms for many fundamental problems achieve optimal linear work in expectation, but upgrading this guarantee to hold with high probability (whp) remains a recurring theoretical challenge. In this paper, we address…

Data Structures and Algorithms · Computer Science 2026-03-03 Chase Hutton , Adam Melrod

This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…

Optimization and Control · Mathematics 2025-01-28 Huaqing Zhang , Lesi Chen , Jing Xu , Jingzhao Zhang

We consider operators T : M_0 -> Z and T : M -> Z, where Z is a Banach space and (M_0, M) is a pair of Banach spaces belonging to a general construction in which M is defined by a "big-O" condition and M_0 is given by the corresponding…

Functional Analysis · Mathematics 2016-11-14 Karl-Mikael Perfekt

The main contribution of this paper is that every convex function with non-empty relative algebraic interior of its domain is Lipschitz and subdifferentiable in some algebraic sense without any additional topological constraints. The…

Optimization and Control · Mathematics 2016-11-09 Dmytro Voloshyn

The question is addressed of when a Sobolev type space, built upon a general rearrangement-invariant norm, on an $n$-dimensional domain, is a Banach algebra under pointwise multiplication of functions. A sharp balance condition among the…

Functional Analysis · Mathematics 2015-12-11 Andrea Cianchi , Luboš Pick , Lenka Slavíková

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

Computational Complexity · Computer Science 2025-09-05 Lunjia Hu , Salil Vadhan

We study numerical integration of functions $f: \mathbb{R}^{s} \to \mathbb{R}$ with respect to a probability measure. By applying the corresponding inverse cumulative distribution function, the problem is transformed into integrating an…

Numerical Analysis · Mathematics 2025-10-01 Tiangang Cui , Josef Dick , Friedrich Pillichshammer
‹ Prev 1 4 5 6 7 8 10 Next ›