Related papers: The Marcinkiewicz multiplier theorem revisited

A generalization of the law of total covariance is presented and proved.

We will prove the Brannan conjecture for particular values of the parameter. The basic tool of the study is an integral representation published in a recent work [3].

The document contains an outline of a modular proof for Ramanujan-Chudnovsky identity.

We study a generalization of the classical Marcinkiewicz-Zygmund inequalities. We relate this problem to the sampling sequences in the Paley-Wiener space and by using this analogy we give sharp necessary and sufficient computable conditions…

In this note we give a detailed proof of a theorem of Aubin.

We present new sharp assertions concerning multipliers in various spaces of harmonic functions in the unit ball of $R^n$

For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…

In this paper, Mikhlin and Marcinkiewicz--Lizorkin type operator-valued multiplier theorems in weighted Lebesgue-Bochner spaces are studied. By using this results embedding theorems in Sobolev-Lions type spaces is obtained. Moreover,…

The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…

We analyse the theory of consistent approximations given by Polak and we use it in an impulsive optimal control problem. We reparametrize the original system and build consistent approximations for this new reparametrized problem. So, we…

We show that a twisted variant of Linnik's conjecture on sums of Kloosterman sums leads to an optimal covering exponent for $S^3$.

We give the simple proof of Bobkov's inequality using the arguments of dynamical programming principle. As a byproduct of the method we obtain a characterization of optimizers.

We provide a generalization of first-order necessary conditions of optimality for infinite-dimensional optimization problems with a finite number of inequality constraints and with a finite number of inequality and equality constraints. Our…

We prove a generalization of Istvan F\'ary's celebrated theorem to higher dimension.

As the title suggests, this is the third paper in a series addressing bilevel optimization problems that are governed by the Kantorovich problem of optimal transport. These tasks can be reformulated as mathematical problems with…

We improve an isoperimetric inequality due to Panos Papasoglu. We also generalize this inequality to the Finsler case by proving an optimal Finsler version of the Besicovitch's lemma which holds for any notion of Finsler volume.

We present a triangle of connections between the Sierpinski triangle, the sum-of-digits function, and the Binomial Theorem via a one-parameter family of Sierpinski matrices, which encodes a digital version of the Binomial Theorem.

The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…

Based on a characterization of the optimality of a feasible solution of a convex entropy minimization problem, one shows that the feasible solutions obtained using formally the Lagrange multipliers method are optimal.

Under appropriate spectral assumptions we prove two existence results for positive solutions of Lichnerowicz-type equations on complete manifolds. We also give a priori bounds and a comparison result that immediately yields uniqueness for…