English
Related papers

Related papers: Complexity of weakly null sequences

200 papers

Functionally constrained stochastic optimization problems, where neither the objective function nor the constraint functions are analytically available, arise frequently in machine learning applications. In this work, assuming we only have…

Optimization and Control · Mathematics 2022-10-11 Anthony Nguyen , Krishnakumar Balasubramanian

We study $\omega$-weak equivalences between weak $\omega$-categories in the sense of Batanin-Leinster. Our $\omega$-weak equivalences are strict $\omega$-functors satisfying essential surjectivity in every dimension, and when restricted to…

Category Theory · Mathematics 2025-08-22 Soichiro Fujii , Keisuke Hoshino , Yuki Maehara

We show the pointwise convergence of the averages \[ \mathcal{A}_N f(x) = \frac{1}{\# \mathbf{B}_N} \sum_{n \in \mathbf{B}_N} f(x + n) \] for $f \in \ell^1(\mathbb{Z})$ where $\mathbf{B}_N = \mathbf{B} \cap [1, N]$, and $\mathbf{B}$ is a…

Number Theory · Mathematics 2020-12-21 Bartosz Trojan

There are a dozen definitions of weak higher categories, all of which loosen the notion of composition of arrows. A new approach is presented here, where instead the notion of identity arrow is weakened -- these are tentatively called fair…

Category Theory · Mathematics 2010-03-09 Joachim Kock

The basic sequence of a homogeneous ideal $I\sset R=k[\seq{x}{1}{r}]$ defining an Artinian graded ring $A=R/I$ not having the weak Lefschetz property has the property that the first term of the last part is less than the last term of the…

Commutative Algebra · Mathematics 2011-09-13 Mutsumi Amasaki

Let $\Omega_1,\Omega_2$ be functions of homogeneous of degree $0$ and $\vec\Omega=(\Omega_1,\Omega_2)\in L\log L(\mathbb{S}^{n-1})\times L\log L(\mathbb{S}^{n-1})$. In this paper, we investigate the limiting weak-type behavior for bilinear…

Classical Analysis and ODEs · Mathematics 2020-12-17 Moyan Qin , Huoxiong Wu , Qingying Xue

We study density requirements on a given Banach space that guarantee the existence of subsymmetric basic sequences by extending Tsirelson's well-known space to larger index sets. We prove that for every cardinal $\kappa$ smaller than the…

Functional Analysis · Mathematics 2017-03-27 Christina Brech , Jordi Lopez-Abad , Stevo Todorcevic

We establish that for every function $u \in L^1_\mathrm{loc}(\Omega)$ whose distributional Laplacian $\Delta u$ is a signed Borel measure in an open set $\Omega$ in $\mathbb{R}^{N}$, the distributional gradient $\nabla u$ is differentiable…

Functional Analysis · Mathematics 2025-02-05 Luigi Ambrosio , Augusto C. Ponce , Rémy Rodiac

We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small…

Number Theory · Mathematics 2017-03-28 Leyla Işık , Arne Winterhof

In the present paper, a class of new simple modules over the $N=1$ Ramond algebra are constructed, which are induced from simple modules over some finite dimensional solvable Lie superalgebras. These new modules are simple restricted…

Quantum Algebra · Mathematics 2023-02-08 Haibo Chen

We show weak* in measures on $\bar\O$/ weak-$L^1$ sequential continuity of $u\mapsto f(x,\nabla u):W^{1,p}(\O;\R^m)\to L^1(\O)$, where $f(x,\cdot)$ is a null Lagrangian for $x\in\O$, it is a null Lagrangian at the boundary for…

Analysis of PDEs · Mathematics 2012-10-05 Agnieszka Kalamajska , Stefan Kroemer , Martin Kruzik

This article is about 1-forms on complex analytic varieties and it is particularly relevant when the variety has non-isolated singularities. We first show how the radial extension technique of M.-H. Schwartz can be adapted to 1-forms,…

Algebraic Geometry · Mathematics 2007-05-23 J. -P. Brasselet , J. Seade , T. Suwa

We study the oracle complexity of producing $(\delta,\epsilon)$-stationary points of Lipschitz functions, in the sense proposed by Zhang et al. [2020]. While there exist dimension-free randomized algorithms for producing such points within…

Optimization and Control · Mathematics 2025-05-01 Guy Kornowski , Ohad Shamir

The Euler quotient modulo an odd-prime power $p^r~(r>1)$ can be uniquely decomposed as a $p$-adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+a_{r-1}(u)p^{r-1} \pmod {p^r},~ \gcd(u,p)=1, $$ where $0\le…

Number Theory · Mathematics 2016-03-15 Zhihua Niu , Zhixiong Chen , Xiaoni Du

In this paper, we study Heisenberg vertex algebras over fields of prime characteristic. The new feature is that the Heisenberg vertex algebras are no longer simple unlike in the case of characteristic zero. We then study a family of simple…

Quantum Algebra · Mathematics 2015-01-20 Haisheng Li , Qiang Mu

We prove that if A and B are bounded self-adjoint operators such that A-B belongs to the trace class, then |A| -|B| belongs to the principal ideal L_{1,\infty} in the algebra L(H) of all bounded operators on an infinite-dimensional Hilbert…

Functional Analysis · Mathematics 2014-06-19 M. Caspers , D. Potapov , F. Sukochev , D. Zanin

Let $H$ be a Hilbert space. Using Ball's solution of the "complex plank problem" we prove that the following properties of a sequence $a_n>0$ are equivalent: (1) There is a sequence $x_n \in H$ with $\|x_n\|=a_n$, having 0 as a weak cluster…

Functional Analysis · Mathematics 2007-05-23 Vladimir Kadets

We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…

Discrete Mathematics · Computer Science 2016-02-10 Robert Lukoťka , Ján Mazák

We propose a new framework combining weak measurement and second-order correlated technique. The theoretical analysis shows that WVA experiment can also be implemented by a second-order correlated system. We then build two-dimensional…

Optics · Physics 2015-10-28 Ting Cui , Jing-Zheng Huang , Xiang Liu , Gui-Hua Zeng

In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…

Formal Languages and Automata Theory · Computer Science 2024-04-23 J. -P. Allouche , J. -Y. Yao