2,052 research outputs found
Spherical sets avoiding a prescribed set of angles
Let be any subset of the interval . A subset of the unit
sphere in will be called \emph{-avoiding} if for any
. The problem of determining the maximum surface measure of a -avoiding set was first stated in a 1974 note by Witsenhausen; there the
upper bound of times the surface measure of the sphere is derived from a
simple averaging argument. A consequence of the Frankl-Wilson theorem is that
this fraction decreases exponentially, but until now the upper bound for
the case has not moved. We improve this bound to using an
approach inspired by Delsarte's linear programming bounds for codes, combined
with some combinatorial reasoning. In the second part of the paper, we use
harmonic analysis to show that for there always exists an
-avoiding set of maximum measure. We also show with an example that a
maximiser need not exist when .Comment: 21 pages, 3 figure
On the sum of k largest singular values of graphs and matrices
In the recent years, the trace norm of graphs has been extensively studied
under the name of graph energy. The trace norm is just one of the Ky Fan
k-norms, given by the sum of the k largest singular values, which are studied
more generally in the present paper. Several relations to chromatic number,
spectral radius, spread, and to other fundamental parameters are outlined. Some
results are extended to more general matrices.Comment: Some corrections applied in v
On the density of sets avoiding parallelohedron distance 1
The maximal density of a measurable subset of R^n avoiding Euclidean
distance1 is unknown except in the trivial case of dimension 1. In this paper,
we consider thecase of a distance associated to a polytope that tiles space,
where it is likely that the setsavoiding distance 1 are of maximal density
2^-n, as conjectured by Bachoc and Robins. We prove that this is true for n =
2, and for the Vorono\"i regions of the lattices An, n >= 2
Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
We investigate the completely positive semidefinite cone ,
a new matrix cone consisting of all matrices that admit a Gram
representation by positive semidefinite matrices (of any size). In particular
we study relationships between this cone and the completely positive and doubly
nonnegative cones, and between its dual cone and trace positive non-commutative
polynomials.
We use this new cone to model quantum analogues of the classical independence
and chromatic graph parameters and , which are roughly
obtained by allowing variables to be positive semidefinite matrices instead of
scalars in the programs defining the classical parameters. We can
formulate these quantum parameters as conic linear programs over the cone
. Using this conic approach we can recover the bounds in
terms of the theta number and define further approximations by exploiting the
link to trace positive polynomials.Comment: Fixed some typo
- …