Related papers: Notes on Cardinal's Matrices

In quant-ph/0205017 v1 Chen, Wu and Yang formulated a necessary separability criterion based on a realignment method for matrices. This note is to point out that this criterion is identical to the necessary cross norm criterion previously…

This paper present an overview of some of the applications of the martingale inequalities of D.L. Burkholder to $L^p$-bounds for singular integral operators, concentrating on the Hilbert transform, first and second order Riesz transforms,…

We give a new normalization condition for connections on sub-Riemannian manifolds with constant symbols. The condition is formulated in terms of Cartan connections and depends only on the first degree of homogeneity of the curvature. The…

In this paper we study some determinant inequalities and matrix inequalities which have a geometrical flavour. We first examine some inequalities which place work of Macbeath [13] in a more general setting and also relate to recent work of…

We give a simple proof of why there is a Matrix theory approximation for a membrane shaped like an arbitrary Riemann surface. As corollaries, we show that noncompact membranes cannot be approximated by matrices and that the Poisson algebra…

The Riemann Hypothesis is reformulated as statements about eigenvalues of some matrices entries of which are defined via Taylor coefficient of the zeta function. These eigenvalues demonstrate interesting visual patterns allowing one to…

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…

We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…

The article provides proofs for the regularity of Dirac eigenfunctions, subject to MIT boundary conditions employed on various types of open sets ranging from smooth ones to convex polygons in two dimensions, as well as on half-space and…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

Deformation theory of associative algebras and in particular of Poisson algebras is reviewed. The role of an almost contraction leading to a canonical solution of the corresponding Maurer-Cartan equation is noted. This role is reminiscent…

We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…

We introduce the notion of a random matrix-valued multiplicative function, generalizing Rademacher random multiplicative functions to matrices. We provide an asymptotic for the second moment based on a linear recurrence property for…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

Assuming the Riemann hypothesis, we obtain upper and lower bounds for moments of the Riemann zeta-function averaged over the extreme values between its zeros on the critical line. Our bounds are very nearly the same order of magnitude. The…

We define a new numerical range of an n\timesn complex matrix in terms of correlation matrices and develop some of its properties. We also define a related numerical range that arises from Alain Connes' famous embedding problem.

Orthogonally invariant functions of symmetric matrices often inherit properties from their diagonal restrictions: von Neumann's theorem on matrix norms is an early example. We discuss the example of "identifiability", a common property of…

A new class of sign-symmetric matrices is introduced in this paper. Such matrices are named J--sign-symmetric. The spectrum of a J--sign-symmetric irreducible matrix is studied under assumptions that its second compound matrix is also…

We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…