Location of Repository

PAVING SMALL MATRICES AND THE KADISON-SINGER EXTENSION PROBLEM II- COMPUTATIONAL RESULTS

By Dieter Schmidt, Gary Weiss and Vrej Zarikian

Abstract

Abstract. This article is part exposition of a recent rather technical paper of the last two authors on matrix pavings related to the 1959 Kadison-Singer Extension Problem and part a report on further computational results providing new bounds for the paving parameters for classes of small matrices investigated there and subsequently. (Website address with file to be created) provides to all interested the matrices experimentally discovered that yield these bounds along with the propietary Matlab software with simple operational directions to load them, pave them, and to perform paving searches. The convergence to 1 or not of the infinite sequence of these parameters in most cases is equivalent to the Kadison-Singer Extension Problem and in all cases, convergence to 1 negates the problem. The last two sections describe the search process and an interpretation of the data integrated with the result

Topics: Contents
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.6491
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://math.uc.edu/%7Eweiss/Pa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.