Related papers: Approximating parametric suprema for constructible…
Let M be a II_1 factor, A a masa in M and E the unique conditional expectation on A. Under some technical assumptions on the inclusion of A in M, which hold true for any semiregular masa of a separable factor, we show that for every…
We establish critical and subcritical sharp Trudinger-Moser inequalities for fractional dimensions on the whole space. Moreover, we obtain asymptotic lower and upper bounds for the fractional subcritical Trudinger-Moser supremum from which…
A random ensemble of cusp forms for the full modular group is introduced. For a weight-$k$ cusp form, restricted to a compact subdomain of the modular surface, the true order of magnitude of its expected supremum is determined to be $\asymp…
We propose a unified framework for establishing existence of nonparametric M-estimators, computing the corresponding estimates, and proving their strong consistency when the class of functions is exceptionally rich. In particular, the…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
We study three possible definitions of the notion of CR functions at CR singular points, their extension to a fixed-neighborhood of the singular point, and analogues of the Baouendi--Tr\`eves approximation in a fixed neighborhood. In…
We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
We consider symmetric non-negative definite bilinear forms on algebras of bounded real valued functions and investigate closability with respect to the supremum norm. In particular, any Dirichlet form gives rise to a sup-norm closable…
We generalize and improve the original characterization given by Valadier [18, Theorem 1] of the subdifferential of the pointwise supremum of convex functions, involving the subdifferentials of the data functions at nearby points. We remove…
The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving a novel type of approximants. The derivation is based on the self-similar approximation theory, which presents…
In the work it is shown that the space of idempotent probability measures with compact supports is kappa-metrizable if the given Tychonoff space is kappa-metrizable. It is constructed a series of max-plus-convex subfunctors of the functor…
In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability…
Motivated by applications requiring sparse or nonnegative controls, we investigate reachability properties of linear infinite-dimensional control problems under conic constraints. Relaxing the problem to convex constraints if the initial…
We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…
Bisimulation relation has been successfully applied to computer science and control theory. In our previous work, simulation-based controllability and simulation-based observability are proposed, under which the existence of bisimilarity…
On a separable C*-algebra A every (completely) bounded map, which preserves closed two sided ideals, can be approximated uniformly by elementary operators if and only if A is a finite direct sum of C*-algebras of continuous sections…
In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inapproximability. Here we try to go further in this direction.…