Related papers: Weihrauch Degrees, Omniscience Principles and Weak…
Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…
The concurrent refinement algebra has been developed to support rely/guarantee reasoning about concurrent programs. The algebra supports atomic commands and defines parallel composition as a synchronous operation, as in Milner's SCCS. In…
Targeting at sparse multi-task learning, we consider regularization models with an $\ell^1$ penalty on the coefficients of kernel functions. In order to provide a kernel method for this model, we construct a class of vector-valued…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to…
It is well known that in the calculus of variations and in optimization there exist many formulations of the fundamental propositions on the attainment of the infima of sequentially weakly lower semicontinuous coercive functions on…
Let $V\subseteq A$ be a conformal inclusion of vertex operator algebras and let $\mathcal{C}$ be a category of grading-restricted generalized $V$-modules that admits the vertex algebraic braided tensor category structure of…
Using a nonlinear version of the well known Hardy-Littlewood inequalities, we derive new formulas for decreasing rearrangements of functions and sequences in the context of convex functions. We use these formulas for deducing several…
We introduce a new approach to the description of multi-sorted clones (sets of $k$-tuples of operations of the same arity, closed under coordinatewise composition and containing all projection tuples) on a two-element domain. Leveraging the…
Let $T:Y\to X$ be a bounded linear operator between two normed spaces. We characterize compactness of $T$ in terms of differentiability of the Lipschitz functions defined on $X$ with values in another normed space $Z$. Furthermore, using a…
By the sometimes so-called MAIN THEOREM of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS'2000), Brattka (MLQ'2005), and Ziegler (ToCS'2006) have considered different relaxed notions…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…
We show that there is a strong connection between Weihrauch reducibility on one hand, and provability in EL_0, the intuitionistic version of RCA_0, on the other hand. More precisely, we show that Weihrauch reducibility to the composition of…
This paper is devoted to establishing the full scaling limit theorems for multivariate Hawkes processes. Under some mild conditions on the exciting kernels, we develop a new way to prove that after a suitable time-spatial scaling, the…
In this survey we discuss work of Levin and V'yugin on collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. More precisely, Levin and V'yugin…
Given a fully symmetric Banach function space $E$ and a decreasing positive weight $w$ on $I = (0, a)$, $0 < a \le \infty $, the generalized Lorentz space ${\Lambda}_{E,w}$ is defined as the symmetrization of the canonical copy $E_w$ of $E$…
We develop a new parallel algorithm for minimizing Lipschitz, convex functions with a stochastic subgradient oracle. The total number of queries made and the query depth, i.e., the number of parallel rounds of queries, match the prior…
We obtain exhaustive results and treat in a unified way the question of boundedness, compactness, and weak compactness of composition operators from the Bloch space into any space from a large family of conformally invariant spaces that…
We begin by deriving an action of the 0-Hecke algebra on standard reverse composition tableaux and use it to discover 0-Hecke modules whose quasisymmetric characteristics are the natural refinements of Schur functions known as…