相关论文: Complexity of weakly null sequences

We discuss optimal constants of certain projections on subsequences of weakly null sequences. Positive results yield constants arbitrarily close to $1$ for Schreier type projections, and arbitrarily close to $1$ for Elton type projections…

We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…

We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove…

Given $n$ line segments in the plane, do they form the edge set of a \emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most $\varepsilon$, for any $\varepsilon>0$, to obtain a simple polygon? While the…

We prove a weak-type estimate for a class of operators extending some of the almost orthogonality issues involved in the study of the bilinear Hilbert transform by Lacey and Thiele.

Examples are constructed of sparse subsequences of the integers for which the associated maximal averages operator is of weak type (1,1). A consequence, by transference, is that an almost everywhere L^1 -- type ergodic theorem holds for…

Second-order methods are of great importance for composite convex optimization problems due to their local super-linear convergence rates (under appropriate assumptions). However, the presence of even a simple nonsmooth function in the…

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

We prove mixed weak estimates of Sawyer type for fractional operators. More precisely, let $\mathcal{T}$ be either the maximal fractional function $M_\gamma$ or the fractional integral operator $I_\gamma$, $0<\gamma<n$, $1\leq p<n/\gamma$…

Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…

In a previous paper we introduced a version of associativity for a partial infinitary operation. We prove here that if $\gamma$ is an infinite ordinal and some associative infinitary operation is defined for all sequences indexed by…

Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C: they are sequences that have infinitely many…

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

A weak deletion sequence is a sequence $(G_1,\ldots,G_n)$ of graphs so that for each $i\in[n-1]$ either $G_i$ is isomorphic to a subgraph of $G_{i+1}$, or vice versa: $G_{i+1}$ is isomorphic to a subgraph of $G_i$. We prove that determining…

Let G be a locally compact abelian group, $\omega:G\to (0,\infty)$ be a weight, and ($\Phi$,$\Psi$) be a complementary pair of strictly increasing continuous Young functions. We show that for the weighted Orlicz algebra $L^\Phi_\omega(G)$,…

We provide general formulation of weak identification in semiparametric models and an efficiency concept. Weak identification occurs when a parameter is weakly regular, i.e., when it is locally homogeneous of degree zero. When this happens,…

We study the oracle complexity of finding $\varepsilon$-Pareto stationary points in smooth multiobjective optimization with $m$ objectives. Progress is measured by the Pareto stationarity gap $\mathcal{G}(x)$, the norm of the best convex…

Motivated by the concept of clean index of rings, we introduce the concept of weak clean index of rings. For any element $a$ of a ring $R$ with unity, we define $ \chi(a)=\{e\in R\mid e^2=e\text{ and }a-e \mbox{ or } a+e \mbox{ is a…

In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…

Let $\Omega \subset \mathbb{R}^{n}$ be bounded a domain. We prove under certain structural assumptions that the fractional maximal operator relative to $\Omega$ maps $L^{p}(\Omega) \to W^{1,p}(\Omega)$ for all $p > 1$, when the smoothness…