English
Related papers

Related papers: Limit-case admissibility for positive infinite-dim…

200 papers

Inspired by Schwartz, Jang-Lewis and Victory, who study in particular generalizations of triangularizations of matrices to operators, we shall give for positive operators on Lebesgue spaces equivalent definitions of atoms (maximal…

Spectral Theory · Mathematics 2025-06-04 Jean-François Delmas , Kacem Lefki , Pierre-André Zitt

A natural criticism of the optimal protocol of the irreversible work found for weakly driven processes is its experimental difficulty in being implementable due to its singular part. In this work, I explore the possibility of taking its…

Statistical Mechanics · Physics 2024-07-30 Pierre Nazé

The objective of the paper is to investigate the approximate controllability property of a linear stochastic control system with values in a separable real Hilbert space. In a first step we prove the existence and uniqueness for the…

Optimization and Control · Mathematics 2009-05-12 D. Goreac

In a recent paper \cite{Redei-Jing2026} the notion of conditional $p$-inaccessibility of a decision based on utility maximization was defined and examples of conditionally $p$-inaccessible decisions were given. The conditional…

Statistics Theory · Mathematics 2026-05-05 Zalán Gyenis , Miklós Rédei , Leszek Wroński

The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…

Operator Algebras · Mathematics 2016-02-22 Martín Argerami , Samuel Coskey , Mehrdad Kalantar , Matthew Kennedy , Martino Lupini , Marcin Sabok

The limiting absorption principle in two-dimensional space is justified for a second-order elliptic operators. Necessary and sufficient conditions for the right-hand side are given for this principle to be valid.

Mathematical Physics · Physics 2007-05-23 A. G. Ramm

This paper investigates acceptance conditions for finite automata recognizing omega-regular languages. As a first result, we show that, under any acceptance condition that can be defined in the MSO logic, a finite automaton can recognize at…

Formal Languages and Automata Theory · Computer Science 2013-10-21 Julien Cervelle , Alberto Dennunzio , Enrico Formenti , Julien Provillard

Elliptic and parabolic integro-differential model problems are considered in the whole space. By verifying H\"ormander condition, the existence and uniqueness is proved in L_{p}-spaces of functions whose regularity is defined by a scalable,…

Analysis of PDEs · Mathematics 2016-05-24 R. Mikulevicius , C. Phonsom

We propose a framework for sensitivity analysis of linear programs (LPs) in minimization form, allowing for simultaneous perturbations in the objective coefficients and right-hand sides, where the perturbations are modeled in a compact,…

Optimization and Control · Mathematics 2015-11-10 Guanglin Xu , Samuel Burer

Suppose $X$ is a real or complexified Banach space containing a complemented copy of $\ell_p$, $p\in(1,2)$, and a copy (not necessarily complemented) of either $\ell_q$, $q\in(p,\infty)$, or $c_0$. Then $\mathcal{L}(X)$ and…

Functional Analysis · Mathematics 2015-07-14 Ben Wallis

A sequence $\{f_n\}$ of strongly-measurable functions taking values in a Banach space $\X$ is scalarly null a\.e\. (resp. scalarly null in measure) if $x^*f_n \rightarrow0$ a\.e\. (resp. $x^*f_n \rightarrow 0$ in measure) for every $x^*\in…

Functional Analysis · Mathematics 2016-09-06 Stephen J. Dilworth , Maria Girardi

Learning-rate steps are usually treated as hyperparameters. This paper isolates a local beliefspace calculation: when an update is modeled as a projected forward step on the probability simplex, admissibility means contractivity in the…

Machine Learning · Computer Science 2026-05-11 Zixi Li , Youzhen Li

Let $L(-{1/2}(l+1),0)$ be the simple vertex operator algebra associated to an affine Lie algebra of type $A_{l}^{(1)}$ with the lowest admissible half-integer level $-{1/2}(l+1)$, for even l. We study the category of weak modules for that…

Quantum Algebra · Mathematics 2010-06-10 Ozren Perse

Learning complex programs through inductive logic programming (ILP) remains a formidable challenge. Existing higher-order enabled ILP systems show improved accuracy and learning performance, though remain hampered by the limitations of the…

Artificial Intelligence · Computer Science 2022-08-02 Stanisław J. Purgał , David M. Cerna , Cezary Kaliszyk

We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics the meaning of a program is, as in the classical case, the unique minimum model in a…

Logic in Computer Science · Computer Science 2011-06-20 Panos Rondogiannis , William W. Wadge

We provide an introduction to infinite-dimensional port-Hamiltonian systems. As this research field is quite rich, we restrict ourselves to the class of infinite-dimensional linear port-Hamiltonian systems on a one-dimensional spatial…

Analysis of PDEs · Mathematics 2023-08-04 Birgit Jacob , Hans Zwart

Many environmental processes exhibit weakening spatial dependence as events become more extreme. Well-known limiting models, such as max-stable or generalized Pareto processes, cannot capture this, which can lead to a preference for models…

Methodology · Statistics 2017-09-06 Raphaël G. Huser , Jennifer L. Wadsworth

Linear systems often involve, as a basic building block, solutions of equations of the form \begin{align*} A_Sx_S&+A_Px_P =0\\ A'_Sx_S & =0, \end{align*} where our primary interest might be in the vector variable $x_P.$ Usually, neither…

General Mathematics · Mathematics 2016-09-27 H. Narayanan

In this note, we show that a natural optimal control problem for the $\infty$-obstacle problem admits an optimal control which is also an optimal state. Moreover, we show the convergence of the minimal value of an optimal control problem…

Analysis of PDEs · Mathematics 2020-07-07 H. Mawi , C. B. Ndiaye

We study the problem of zeroth-order (black-box) optimization of a Lipschitz function $f$ defined on a compact subset $\mathcal X$ of $\mathbb R^d$, with the additional constraint that algorithms must certify the accuracy of their…

Statistics Theory · Mathematics 2023-03-23 François Bachoc , Tommaso R Cesari , Sébastien Gerchinovitz