Related papers: Multiplier theorems via martingale transforms

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

In this paper we present two different problems within the framework of shift-invariant theory. First, we develop a triangular form for shift-preserving operators acting on finitely generated shift-invariant spaces. In case of the normal…

In this paper we present methods for the synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariants in the form of polynomials over program variables, which…

In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

We prove a global uniform Artin-Rees lemma type theorem for sections of ample line bundles over smooth projective varieties. This result is used to prove an Artin-Rees lemma for the polynomial ring with uniform degree bounds. The proof is…

We argue for more widespread use of manifold-like polyfolds (M-polyfolds) as differential geometric objects. M-polyfolds possess a distinct advantage over differentiable manifolds, enabling a smooth and local change of dimension. To…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

We revisit Kellerer's Theorem, that is, we show that for a family of real probability distributions $(\mu_t)_{t\in [0,1]}$ which increases in convex order there exists a Markov martingale $(S_t)_{t\in[0,1]}$ s.t.\ $S_t\sim \mu_t$. To…

We use the theory of trianguline $(\varphi,\Gamma)$-modules over pseudorigid spaces to prove a modularity lifting theorem for certain Galois representations which are trianguline at $p$, including those with characteristic $p$ coefficients.…

We use multiplication maps to give a characteristic-free approach to vanishing theorems on toric varieties. Our approach is very elementary but is enough powerful to prove vanishing theorems.

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We present a geometric interpretation of the integration-by-parts formula on an arbitrary vector bundle. As an application we give a new geometric formulation of higher-order variational calculus.

We prove that the space of pointwise multipliers between two distinct Musielak--Orlicz spaces is another Musielak-Orlicz space and the function defining it is given by an appropriately generalized Legendre transform. In particular, we…

We survey the concept of multiplicativity from its initial appearance in the theory of Poisson-Lie groups to the far-reaching generalizations, for multivectors and differential forms in the geometry and the generalized geometry of Lie…

We provide a complete proof of an optimal version of the Marcinkiewicz multiplier theorem.

We introduce a bulging triangle like the generalization of the Reuleaux triangle. We may be able to propose various ways to bulge a triangle, but this paper presents the way so that its vertices are the same as them of the original…

We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…

We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm that describes Monk's Rule. Our result is different from…

We establish sharp (H^1, L^{1,q}) and local (L \log^r L, L^{1,q}) mapping properties for rough one-dimensional multipliers. In particular, we show that the multipliers in the Marcinkiewicz multiplier theorem map H^1 to L^{1,\infty} and L…