相关论文: Complexity of weakly null sequences

An abstract characterization of weakly monotone $C^*$-algebras, namely the concrete $C^*$-algebras generated by creators and annihilators acting on the so-called weakly monotone Fock spaces, is given in terms of (quotient of) suitable…

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…

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

We use De Giorgi-Nash-Moser iteration scheme to establish that weak solutions to a coupled system of elliptic equations with critical growth on the boundary are in $L^\infty(\Omega)$. Moreover, we provide an explicit $L^\infty(\Omega)$-…

We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…

(English) This monograph aims at presenting the core weak convergence theory for sequences of random vectors with values in $\mathbb{R}^k$. In some places, a more general formulation in metric spaces is provided. It lays out the necessary…

We use Macaulay's inverse system to study the Hilbert series for almost complete intersections generated by uniform powers of general linear forms. This allows us to give a classification of the Weak Lefschetz property for these algebras,…

We offer a general Bayes theoretic framework to derive posterior contraction rates under a hierarchical prior design: the first-step prior serves to assess the model selection uncertainty, and the second-step prior quantifies the prior…

In this paper, we prove first that the iterates of a mean nonexpansive map defined on a weakly compact, convex set converge weakly to a fixed point in the presence of Opial's property and asymptotic regularity at a point. Next, we prove the…

Monotonicity with respect to all arguments is fundamental to the definition of aggregation functions. It is also a limiting property that results in many important non-monotonic averaging functions being excluded from the theoretical…

Weakly Schreier split extensions are a reasonably large, yet well-understood class of monoid extensions, which generalise some aspects of split extensions of groups. This short note provides a way to define and study similar classes of…

Assume that for some $\alpha<1$ and for all nutural $n$ a set $F_n$ of at most $2^{\alpha n}$ "forbidden" binary strings of length $n$ is fixed. Then there exists an infinite binary sequence $\omega$ that does not have (long) forbidden…

Based on a Whitehead-type characterization of the sectional category we develop the notion of weak sectional category. This is a new lower bound of the sectional category, which is inspired by the notion of weak category in the sense of…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

In this paper, we consider recurrence sequences $x_n=\xi_1 \alpha_1^n+\xi_2 \alpha_2^n$ ($n=0,1,\ldots$) with companion polynomial $P(X)$. For example, the sequence $x_n=\xi_1(4+\sqrt{2})^n+\xi_2(4-\sqrt{2})^n$ satisfies the recurrence…

We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a…

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 [1], and their validity…

Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…