Combinatorics: Chris Cox (CMU) "Nearly orthogonal vectors"

Speaker: Chris Cox, CMU Title -- Nearly orthogonal vectors Abstract -- How can $d+k$ vectors in $\mathbb{R}^d$ be arranged so that they are as close to orthogonal as possible? In particular, define $\theta(d,k):=\min_X\max_{x eq y\in X}|\langle x,y\rangle|$ where the minimum is taken over all collections of $d+k$ unit vectors $X\subseteq\mathbb{R}^d$. In this talk, we focus on the case where $k$ is fixed and $d\to\infty$. In establishing bounds on $\theta(d,k)$, we find an intimate connection to the existence of systems of ${k+1\choose 2}$ equiangular lines in $\mathbb{R}^k$. Using this connection, we are able to pin down $\theta(d,k)$ whenever $k\in\{1,2,3,7,23\}$ and establish asymptotics for general $k$. The main tool is an upper bound on $\mathbb{E}_{x,y\sim\mu}|\langle x,y\rangle|$ whenever $\mu$ is an isotropic probability mass on $\mathbb{R}^k$, which may be of independent interest. (Joint work with Boris Bukh)

Date:

Mon, 11/06/2018 - 11:00 to 12:30

Location:

IIAS, Eilat hall, Feldman bldg, Givat Ram
{"ft_lang_label":"__label__en","ft_lang_prob":0.7541563,"math_prob":0.9995547,"size":1022,"snap":"2019-43-2019-47","text_gpt3_token_len":319,"char_repetition_ratio":0.100196466,"word_repetition_ratio":0.0,"special_character_ratio":0.30234835,"punctuation_ratio":0.14159292,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9998209,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-20T20:00:45Z\",\"WARC-Record-ID\":\"<urn:uuid:e749ab3d-5bab-40b6-bd31-44dc33d88fa2>\",\"Content-Length\":\"57934\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:742019f4-c7a4-4535-a28b-1e8e84add7bd>\",\"WARC-Concurrent-To\":\"<urn:uuid:82d07b92-6933-431f-82be-6254137ea126>\",\"WARC-IP-Address\":\"128.139.7.33\",\"WARC-Target-URI\":\"https://mathematics.huji.ac.il/event/combinatorics-chris-cox-cmu-tba?ref_tid=3830\",\"WARC-Payload-Digest\":\"sha1:4J463BCBNN3EVJ4DC2ZOEPSXDHZK2MLB\",\"WARC-Block-Digest\":\"sha1:E35VAELAATPN7OTHVW6EBACEM3CLBVQ6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986718918.77_warc_CC-MAIN-20191020183709-20191020211209-00048.warc.gz\"}"}