Related papers: Complexity of weakly null sequences

We obtain a weak type $(1,1)$ estimate for a maximal operator associated with the classical rough homogeneous singular integrals $T_{\Omega}$. In particular, this provides a different approach to a sparse domination for $T_{\Omega}$…

A multi-objective optimization problem is $C^r$ weakly simplicial if there exists a $C^r$ surjection from a simplex onto the Pareto set/front such that the image of each subsimplex is the Pareto set/front of a subproblem, where $0\leq r\leq…

In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…

Let $(x_n)$ be a normalized weakly null sequence in a Banach space and let $\varep>0$. We show that there exists a subsequence $(y_n)$ with the following property: $$\hbox{ if }\ (a_i)\subseteq \IR\ \hbox{ and }\ F\subseteq \nat$$ satisfies…

We study the order theoretic properties of relative weak injectivity, w.r.i., in short, in the category of C*-algebras. We prove that Arveson's extension theorem, with additional order assumption on the morphisms, is tightly connected with…

We show that every Banach space in which weakly compact sets are super weakly compact in automatically weakly sequentially complete answering a question by Silber (2024). In the proof we show how to build a weakly compact set which is not…

In a general measure space $(X,\mathcal L,\lambda)$, a characterization of weakly null sequences in $L_\infty (X,\mathcal L,\lambda)$ ($u_k \rightharpoonup 0$) in terms of their pointwise behaviour almost everywhere is derived from the…

We introduce the concept of weak average-case analysis as an attempt to achieve theoretical complexity results that are closer to practical experience than those resulting from traditional approaches. This concept is accepted in other areas…

Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…

In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…

In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system $OT$ is introduced based on $\psi$-functions. Provable $\Sigma_{1}$-sentences on $L_{\omega_{1}^{CK}}$ are bounded through…

We offer an umbrella type result which extends weak convergence of the classical empirical process on the line to that of more general processes indexed by functions of bounded variation. This extension is not contingent on the type of…

Based on the concept of unbounded absolutely weakly convergence, we give new characterizations of L-weakly compact sets. As applications, we find some properties of order weakly compact operators. Also, a new characterizations of order…

Let ${\mathscr M}(p)$ $(p=2,3,\ldots)$ be the singlet vertex operator algebra and $\omega$ its conformal vector. We classify the simple weak ${\mathscr M}(p)$-modules with a non-zero element $u$ such that for some integer $s\geq 2$,…

Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…

We introduce a weak version of the classical length function, termed the weak length function, defined on subsets of $R$-modules over a unital ring $R$, and further consider the concept of mean weak length for $R\Gamma$-modules associated…

Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

In this paper, we develop the notions of weak/directional monotonicity (developed by Sesma-Sara et al. in terms of the \emph{Kulisch-Miranker order}) and the notion of $ G $-monotonicity (introduced by Santiago et al. for $ [0,\!1]$) for…

Summability methods for ultraholomorphic classes in sectors, defined in terms of a strongly regular sequence $\mathbb{M}=(M_p)_{p\in\mathbb{N}_0}$, have been put forward by A. Lastra, S. Malek and the second author (Summability in general…