Related papers: Counting results for thin Butson matrices
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
The mass spectrum of the lowest lying octet baryons is calculated to next-to-next-to-leading order in heavy baryon chiral perturbation theory and partially quenched heavy baryon chiral perturbation theory. We work in the isospin limit and…
The quantum de Finetti theorem asserts that the k-body density matrices of a N-body bosonic state approach a convex combination of Hartree states (pure tensor powers) when N is large and k fixed. In this note we review a construction due to…
We study Helson matrices (also known as multiplicative Hankel matrices), i.e. infinite matrices of the form $M(\alpha) = \{\alpha(nm)\}_{n,m=1}^\infty$, where $\alpha$ is a sequence of complex numbers. Helson matrices are considered as…
In this paper we investigate some convergence and divergence of some specific subsequences of partial sums with respect to Walsh system on the martingale Hardy spaces. By using these results we obtain relationship of the ratio of…
We prove that a matrix from the split orthogonal group over a polynomial ring with coefficients in a small-dimensional ring can be reduced to a smaller matrix by a bounded number of elementary orthogonal transformations. The bound is given…
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 method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partial derivatives of a polynomial. In this paper, we consider…
The masses of the spin-3/2 baryons are calculated to next-to-next-to-leading order in heavy baryon chiral perturbation theory and partially quenched heavy baryon chiral perturbation theory. The calculation is performed for three light…
This is a second paper in a series devoted to the minimal unitary representation of O(p,q). By explicit methods from conformal geometry of pseudo-Riemannian manifolds, we find the branching law corresponding to restricting the minimal…
We count with a smooth weight the number of $2 \times 2$ integer matrices with a fixed characteristic polynomial with a main term and an error term using bounds for sums of Weyl sums for quadratic roots.
Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…
The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…
(NxN)-matrix is called additive when its elements are pair-wise sums of N real numbers. For a quadratic binary functional with an additive connection matrix we succeeded in finding the global minimum expressing it through external…
We introduce Hadamard matrices whose entries are quaternionic. We then go on to provide classification of quaternionic Hadamard matrices of circulant core of orders 2 through 5. We also introduce quaternionic Hadamard matrices of Butson…
Let $A$ be a positive semidefinite matrix, block partitioned as $$ A=\twomat{B}{C}{C^*}{D}, $$ where $B$ and $D$ are square blocks. We prove the following inequalities for the Schatten $q$-norm $||.||_q$, which are sharp when the blocks are…
Resonance counting is an intuitive and widely used tool in Random Matrix Theory and Anderson Localization. Its undoubted advantage is its simplicity: in principle, it is easily applicable to any random matrix ensemble. On the downside, the…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…