Related papers: On Pisier's Construction

We reexamine different examples of reduction chains $\mathfrak{g} \supset \mathfrak{g}'$ of Lie algebras in order to show how the polynomials determining the commutant with respect to the subalgebra $\mathfrak{g}'$ leads to polynomial…

This article presents two constructions motivated by a conjecture of L. van den Dries and C. Miller concerning the restricted analytic field with exponentiation. The first construction provides an example of two o-minimal expansions of a…

We discuss various theorems about bounded analytic functions on the bidisk that were proved using operator theory.

We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.

We give conditions that ensure that an operator satisfying a Piestch domination in a given setting also satisfies a Piestch domination in a different setting. From this we derive that a bounded mutlilinear operator $T$ is Lipschitz…

We study the boundedness of composition operators on the weighted Bergman spaces and the Hardy space over the polydisc. For arbitrary polydisc we prove the rank sufficiency theorem which, in particular, provides us with a simple criterion…

A new class of bivariate poly-analytic Hermite polynomials is considered. We show that they are realizable as the Fourier-Wigner transform of the univariate complex Hermite functions and form a nontrivial orthogonal basis of the classical…

In this note we show that a special case of a recent result by Obus-Wewers (used as a black box) together with a deformation argument in characteristic $p$ leads to a proof of the Oort Conjecture in the general case. A boundedness result is…

We prove an explicit Chinese Remainder Theorem for one variable polynomials with complex coefficients, and derive some consequences.

We complete the construction of raising and lowering operators, given in a previous work, for the orthogonal polynomials of hypergeometric type on non-homogeneous lattice, and extend these operators to the generalized orthogonal…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

An technically interesting proof of a known theorem.

We show that a non-associative structure applied to the algebra of Fermi operators with su(3) colour degrees of freedom leads to a consistent Fermi statistic for the tensor operators of the colour algebra. A consequence of this construction…

We show that the Hermitian analogue of a famous result of Pfister fails. To do so we provide a Hermitian symmetric polynomial $r$ of total degree 2d such that any non-zero multiple of it cannot be written as a Hermitian sum of squares with…

We construct a linear basis for the polynomial eigenfunctions of a family of deformed Calogero-Moser-Sutherland operators naturally associated with hypergeometric polynomials. In our construction the eigenfunctions are obtained as linear…

The classical Pieri formula gives a combinatorial rule for decomposing the product of a Schur function and a complete homogeneous symmetric polynomial as a linear combination of Schur functions with integer coefficients. We give a Pieri…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

Let $D\subset \mathbb{R}^d$ be a bounded Lipschitz domain, $\omega$ be a high order modulus of continuity and let $T$ be a convolution Calder\'{o}n-Zygmund operator. We characterize the bounded restricted operators $T_D$ on the Zygmund…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…