diff options
| -rw-r--r-- | build/cv.fdb_latexmk | 13 | ||||
| -rw-r--r-- | build/cv.fls | 2 | ||||
| -rw-r--r-- | build/cv.log | 64 | ||||
| -rw-r--r-- | build/cv.pdf | bin | 125048 -> 125047 bytes | |||
| -rw-r--r-- | build/cv.synctex.gz | bin | 25514 -> 25435 bytes | |||
| -rw-r--r-- | content/contact.tex | 2 | ||||
| -rw-r--r-- | content/papers.bib | 132 | ||||
| -rw-r--r-- | content/publications.bib | 113 | ||||
| -rw-r--r-- | content/submitted.bib | 11 | ||||
| -rw-r--r-- | cv.tex | 4 |
10 files changed, 178 insertions, 163 deletions
diff --git a/build/cv.fdb_latexmk b/build/cv.fdb_latexmk index fb7d6f7..5c29180 100644 --- a/build/cv.fdb_latexmk +++ b/build/cv.fdb_latexmk @@ -1,5 +1,5 @@ # Fdb version 3 -["pdflatex"] 1560370644 "cv.tex" "build/cv.pdf" "cv" 1560370645 +["pdflatex"] 1560374637 "cv.tex" "build/cv.pdf" "cv" 1560374637 "/etc/texmf/web2c/texmf.cnf" 1525335339 34486 a42f5630e6d0571c3d9c9d8f8de29fc1 "" "/usr/share/texmf/fonts/map/fontname/texfonts.map" 1511824771 3332 103109f5612ad95229751940c61aada0 "" "/usr/share/texmf/fonts/map/pdftex/updmap/pdftex.map" 1520645099 2704162 7a0bfe1b6869e6081137f3dece8a4231 "" @@ -110,6 +110,7 @@ "/usr/share/texmf/tex/latex/latexconfig/epstopdf-sys.cfg" 1480098833 678 4792914a8f45be57bb98413425e4c7af "" "/usr/share/texmf/tex/latex/latexconfig/hyperref.cfg" 1480098833 235 6031e5765137be07eed51a510b2b8fb7 "" "/usr/share/texmf/tex/latex/ms/everyshi.sty" 1480098835 3878 6aa7c08ff2621006e0603349e40a30a8 "" + "/usr/share/texmf/tex/latex/natbib/bibentry.sty" 1480098835 3400 e000bb2fc43fc077e107f62f8c25613e "" "/usr/share/texmf/tex/latex/oberdiek/auxhook.sty" 1480098836 3834 4363110eb0ef1eb2b71c8fcbcdb6c357 "" "/usr/share/texmf/tex/latex/oberdiek/epstopdf-base.sty" 1480098836 12095 5337833c991d80788a43d3ce26bd1c46 "" "/usr/share/texmf/tex/latex/oberdiek/grfext.sty" 1480098836 7075 2fe3d848bba95f139de11ded085e74aa "" @@ -129,19 +130,19 @@ "/usr/share/texmf/tex/latex/xcolor/xcolor.sty" 1480098843 55589 34128738f682d033422ca125f82e5d62 "" "/usr/share/texmf/web2c/texmf.cnf" 1525335339 34486 a42f5630e6d0571c3d9c9d8f8de29fc1 "" "/var/lib/texmf/web2c/pdftex/pdflatex.fmt" 1559422358 3678045 a19cf46623b5a6aeed38e613a215a19c "" - "build/cv.aux" 1560370645 662 b2b94621371df8d9296b8bf5bec1b851 "" - "build/cv.out" 1560370645 0 d41d8cd98f00b204e9800998ecf8427e "" + "build/cv.aux" 1560374637 662 b2b94621371df8d9296b8bf5bec1b851 "" + "build/cv.out" 1560374637 0 d41d8cd98f00b204e9800998ecf8427e "" "content/awards-grants.tex" 1560370435 548 17237644e13090c25097cc41acc775e5 "" - "content/contact.tex" 1560370435 128 365a35906273e5ff369718f4fc25b71a "" + "content/contact.tex" 1560372359 171 21b00524dfce1886c14e3a8375cddb60 "" "content/contributed.tex" 1560370435 956 7760ee69d224669c0a61f41c3829e6b1 "" "content/education.tex" 1560370435 756 addf0797cfaa773729a81bb6c018d111 "" "content/invited.tex" 1560370435 1717 565fcd2432eb79cf932cb067ee225dfd "" "content/positions.tex" 1560370643 1027 71280eb3ba614bbab260f12b6690db63 "" "content/publications.tex" 1560370576 1545 ad378e3e9abe68f075eb849b5f493caf "" "content/submitted.tex" 1560370435 259 0834513bee6a8671270a35de6f4dfa6b "" - "cv.tex" 1560370593 2222 b480c1b43109f68ffa2ff8c9367d13d9 "" + "cv.tex" 1560374631 2303 15640367dd26487afb4699cb786a827a "" (generated) + "build/cv.aux" "build/cv.pdf" "build/cv.log" "build/cv.out" - "build/cv.aux" diff --git a/build/cv.fls b/build/cv.fls index 49a66ce..4ae4e6c 100644 --- a/build/cv.fls +++ b/build/cv.fls @@ -152,6 +152,8 @@ INPUT /usr/share/texmf/tex/generic/pgf/frontendlayer/tikz/libraries/tikzlibraryt INPUT /usr/share/texmf/tex/generic/pgf/frontendlayer/tikz/libraries/tikzlibrarytopaths.code.tex INPUT /usr/share/texmf/tex/latex/enumitem/enumitem.sty INPUT /usr/share/texmf/tex/latex/enumitem/enumitem.sty +INPUT /usr/share/texmf/tex/latex/natbib/bibentry.sty +INPUT /usr/share/texmf/tex/latex/natbib/bibentry.sty INPUT /usr/share/texmf/tex/latex/etoolbox/etoolbox.sty INPUT /usr/share/texmf/tex/latex/etoolbox/etoolbox.sty INPUT ./build/cv.aux diff --git a/build/cv.log b/build/cv.log index 2068ebf..d7cc780 100644 --- a/build/cv.log +++ b/build/cv.log @@ -1,4 +1,4 @@ -This is pdfTeX, Version 3.14159265-2.6-1.40.19 (TeX Live 2018/TeX Live for SUSE Linux) (preloaded format=pdflatex 2019.6.1) 12 JUN 2019 16:17 +This is pdfTeX, Version 3.14159265-2.6-1.40.19 (TeX Live 2018/TeX Live for SUSE Linux) (preloaded format=pdflatex 2019.6.1) 12 JUN 2019 17:23 entering extended mode restricted \write18 enabled. file:line:error style messages enabled. @@ -413,28 +413,30 @@ Package: enumitem 2011/09/28 v3.5.2 Customized lists \enit@toks=\toks39 \enit@inbox=\box39 \enitdp@description=\count129 +) (/usr/share/texmf/tex/latex/natbib/bibentry.sty +Package: bibentry 2007/10/30 1.5 (PWD) ) (/usr/share/texmf/tex/latex/etoolbox/etoolbox.sty Package: etoolbox 2018/02/11 v2.5e e-TeX tools for LaTeX (JAW) \etb@tempcnta=\count130 ) (./build/cv.aux) \openout1 = `cv.aux'. -LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 37. -LaTeX Font Info: ... okay on input line 37. -LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 37. -LaTeX Font Info: ... okay on input line 37. -LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 37. -LaTeX Font Info: ... okay on input line 37. -LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 37. -LaTeX Font Info: ... okay on input line 37. -LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 37. -LaTeX Font Info: ... okay on input line 37. -LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 37. -LaTeX Font Info: ... okay on input line 37. -LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 37. -LaTeX Font Info: ... okay on input line 37. +LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. \AtBeginShipoutBox=\box40 -Package hyperref Info: Link coloring ON on input line 37. +Package hyperref Info: Link coloring ON on input line 38. (/usr/share/texmf/tex/latex/hyperref/nameref.sty Package: nameref 2016/05/21 v2.44 Cross-referencing by name of section (/usr/share/texmf/tex/generic/oberdiek/gettitlestring.sty @@ -442,9 +444,9 @@ Package: gettitlestring 2016/05/16 v1.5 Cleanup title references (HO) ) \c@section@level=\count131 ) -LaTeX Info: Redefining \ref on input line 37. -LaTeX Info: Redefining \pageref on input line 37. -LaTeX Info: Redefining \nameref on input line 37. +LaTeX Info: Redefining \ref on input line 38. +LaTeX Info: Redefining \pageref on input line 38. +LaTeX Info: Redefining \nameref on input line 38. (./build/cv.out) (./build/cv.out) \@outlinefile=\write4 \openout4 = `cv.out'. @@ -474,11 +476,11 @@ Package grfext Info: Graphics extension search list: (/usr/share/texmf/tex/latex/latexconfig/epstopdf-sys.cfg File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Live )) -LaTeX Font Info: Try loading font information for U+msa on input line 49. +LaTeX Font Info: Try loading font information for U+msa on input line 52. (/usr/share/texmf/tex/latex/amsfonts/umsa.fd File: umsa.fd 2013/01/14 v3.01 AMS symbols A ) -LaTeX Font Info: Try loading font information for U+msb on input line 49. +LaTeX Font Info: Try loading font information for U+msb on input line 52. (/usr/share/texmf/tex/latex/amsfonts/umsb.fd File: umsb.fd 2013/01/14 v3.01 AMS symbols B ) (./content/contact.tex) (./content/education.tex @@ -496,25 +498,25 @@ Overfull \hbox (14.78561pt too wide) in paragraph at lines 2--3 [1 {/usr/share/texmf/fonts/map/pdftex/updmap/pdftex.map}]) (./content/publications.tex) (./content/invited.tex [2]) (./content/contributed.tex) (./content/awards-grants.tex) [3] -Package atveryend Info: Empty hook `BeforeClearDocument' on input line 90. -Package atveryend Info: Empty hook `AfterLastShipout' on input line 90. +Package atveryend Info: Empty hook `BeforeClearDocument' on input line 92. +Package atveryend Info: Empty hook `AfterLastShipout' on input line 92. (./build/cv.aux) -Package atveryend Info: Executing hook `AtVeryEndDocument' on input line 90. -Package atveryend Info: Executing hook `AtEndAfterFileList' on input line 90. +Package atveryend Info: Executing hook `AtVeryEndDocument' on input line 92. +Package atveryend Info: Executing hook `AtEndAfterFileList' on input line 92. Package rerunfilecheck Info: File `cv.out' has not changed. (rerunfilecheck) Checksum: D41D8CD98F00B204E9800998ECF8427E;0. -Package atveryend Info: Empty hook `AtVeryVeryEnd' on input line 90. +Package atveryend Info: Empty hook `AtVeryVeryEnd' on input line 92. ) Here is how much of TeX's memory you used: - 16339 strings out of 493685 - 300044 string characters out of 6155431 - 373346 words of memory out of 5000000 - 19756 multiletter control sequences out of 15000+600000 + 16360 strings out of 493685 + 300362 string characters out of 6155431 + 373799 words of memory out of 5000000 + 19773 multiletter control sequences out of 15000+600000 7670 words of font info for 30 fonts, out of 8000000 for 9000 475 hyphenation exceptions out of 8191 55i,5n,54p,1001b,436s stack positions out of 5000i,500n,10000p,200000b,80000s </usr/share/texmf/fonts/type1/public/amsfonts/cm/cmbx10.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmbx12.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmr12.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmr17.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/share/texmf/fonts/type1/public/amsfonts/cm/cmtt10.pfb></usr/share/texmf/fonts/type1/public/amsfonts/symbols/msbm10.pfb> -Output written on ./build/cv.pdf (3 pages, 125048 bytes). +Output written on ./build/cv.pdf (3 pages, 125047 bytes). PDF statistics: 78 PDF objects out of 1000 (max. 8388607) 62 compressed objects within 1 object stream diff --git a/build/cv.pdf b/build/cv.pdf Binary files differindex d86acd3..3227e11 100644 --- a/build/cv.pdf +++ b/build/cv.pdf diff --git a/build/cv.synctex.gz b/build/cv.synctex.gz Binary files differindex 1525a7a..e44bafb 100644 --- a/build/cv.synctex.gz +++ b/build/cv.synctex.gz diff --git a/content/contact.tex b/content/contact.tex index bc971f5..ac0f0d6 100644 --- a/content/contact.tex +++ b/content/contact.tex @@ -2,4 +2,4 @@ Carnegie Mellon University\\ Pittsburgh, PA 15213\\ \texttt{cocox@andrew.cmu.edu}\\ -\url{math.cmu.edu/~cocox}% +\href{http://math.cmu.edu/~cocox/}{\texttt{math.cmu.edu/\~{}cocox/}}% diff --git a/content/papers.bib b/content/papers.bib new file mode 100644 index 0000000..b182933 --- /dev/null +++ b/content/papers.bib @@ -0,0 +1,132 @@ +@article {jBC19, + AUTHOR = {Briggs, Joseph and Cox, Christopher}, + TITLE = {Inverting the {T}ur\'{a}n problem}, + JOURNAL = {Discrete Math.}, + FJOURNAL = {Discrete Mathematics}, + VOLUME = {342}, + YEAR = {2019}, + NUMBER = {7}, + PAGES = {1865--1884}, + ISSN = {0012-365X}, + MRCLASS = {05C35}, + MRNUMBER = {3937748}, + DOI = {10.1016/j.disc.2019.03.005}, + URL = {https://doi.org/10.1016/j.disc.2019.03.005}, +} + +@article {bBC19, + AUTHOR = {Bukh, Boris and Cox, Christopher}, + TITLE = {On a fractional version of {H}aemers’ bound}, + JOURNAL = {IEEE Transactions on Information Theory}, + VOLUME = {65}, + NUMBER = {6}, + PAGES = {3340--3348}, +} + +@article {CS18, + AUTHOR = {Cox, Christopher and Stolee, Derrick}, + TITLE = {Ramsey numbers for partially-ordered sets}, + JOURNAL = {Order}, + FJOURNAL = {Order. A Journal on the Theory of Ordered Sets and its + Applications}, + VOLUME = {35}, + YEAR = {2018}, + NUMBER = {3}, + PAGES = {557--579}, + ISSN = {0167-8094}, + MRCLASS = {05C55 (05C65 06A07)}, + MRNUMBER = {3861400}, +MRREVIEWER = {Zilin Jiang}, + DOI = {10.1007/s11083-017-9449-9}, + URL = {https://doi.org/10.1007/s11083-017-9449-9}, +} + +@article {BCDHKLMMNPS17, + AUTHOR = {Berikkyzy, Zhanar and Cox, Christopher and Dairyko, Michael + and Hogenson, Kirsten and Kumbhat, Mohit and Lidick\'{y}, Bernard + and Messerschmidt, Kacy and Moss, Kevin and Nowak, Kathleen + and Palmowski, Kevin F. and Stolee, Derrick}, + TITLE = {{$(4,2)$}-choosability of planar graphs with forbidden + structures}, + JOURNAL = {Graphs Combin.}, + FJOURNAL = {Graphs and Combinatorics}, + VOLUME = {33}, + YEAR = {2017}, + NUMBER = {4}, + PAGES = {751--787}, + ISSN = {0911-0119}, + MRCLASS = {05C15 (05C10)}, + MRNUMBER = {3665686}, + DOI = {10.1007/s00373-017-1812-5}, + URL = {https://doi.org/10.1007/s00373-017-1812-5}, +} + +@article {BBCDLP17, + AUTHOR = {Banaian, Esther and Butler, Steve and Cox, Christopher and + Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte}, + TITLE = {A generalization of {E}ulerian numbers via rook placements}, + JOURNAL = {Involve}, + FJOURNAL = {Involve. A Journal of Mathematics}, + VOLUME = {10}, + YEAR = {2017}, + NUMBER = {4}, + PAGES = {691--705}, + ISSN = {1944-4176}, + MRCLASS = {05A15 (05A05)}, + MRNUMBER = {3630311}, +MRREVIEWER = {Volker Strehl}, + DOI = {10.2140/involve.2017.10.691}, + URL = {https://doi.org/10.2140/involve.2017.10.691}, +} + +@article {BBCDLP16, + AUTHOR = {Banaian, Esther and Butler, Steve and Cox, Christopher and + Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte}, + TITLE = {Counting prime juggling patterns}, + JOURNAL = {Graphs Combin.}, + FJOURNAL = {Graphs and Combinatorics}, + VOLUME = {32}, + YEAR = {2016}, + NUMBER = {5}, + PAGES = {1675--1688}, + ISSN = {0911-0119}, + MRCLASS = {05A05 (05A15 05A30)}, + MRNUMBER = {3543189}, +MRREVIEWER = {Zhicong Lin}, + DOI = {10.1007/s00373-016-1711-1}, + URL = {https://doi.org/10.1007/s00373-016-1711-1}, +} + +@article {CD16, + AUTHOR = {Cox, Christopher and Stolee, Derrick}, + TITLE = {Ordered {R}amsey numbers of loose paths and matchings}, + JOURNAL = {Discrete Math.}, + FJOURNAL = {Discrete Mathematics}, + VOLUME = {339}, + YEAR = {2016}, + NUMBER = {2}, + PAGES = {499--505}, + ISSN = {0012-365X}, + MRCLASS = {05C55 (05C65)}, + MRNUMBER = {3431360}, + DOI = {10.1016/j.disc.2015.09.026}, + URL = {https://doi.org/10.1016/j.disc.2015.09.026}, +} + +@article {CDDKRT15, + AUTHOR = {Cox, Christopher and De Silva, Jessica and DeOrsey, Philip and + Kenter, Franklin H. J. and Retter, Troy and Tobin, Josh}, + TITLE = {How to make the perfect fireworks display: two strategies for + {\it {H}anabi}}, + JOURNAL = {Math. Mag.}, + FJOURNAL = {Mathematics Magazine}, + VOLUME = {88}, + YEAR = {2015}, + NUMBER = {5}, + PAGES = {323--336}, + ISSN = {0025-570X}, + MRCLASS = {91A46 (91A12)}, + MRNUMBER = {3470682}, + DOI = {10.4169/math.mag.88.5.323}, + URL = {https://doi.org/10.4169/math.mag.88.5.323}, +} diff --git a/content/publications.bib b/content/publications.bib deleted file mode 100644 index d6e8d63..0000000 --- a/content/publications.bib +++ /dev/null @@ -1,113 +0,0 @@ -@Article{briggscox17, - author = {Joseph Briggs and Christopher Cox}, - title = {Inverting the {T}ur{\' a}n problem}, - abstract = {Classical questions in extremal graph theory concern the asymptotics of $\operatorname{ex}(G, \mathcal{H})$ where $\mathcal{H}$ is a fixed family of graphs and $G=G_n$ is taken from a "standard" increasing sequence of host graphs $(G_1, G_2, \dots)$, most often $K_n$ or $K_{n,n}$. Inverting the question, we can instead ask how large $|E(G)|$ can be with respect to $\operatorname{ex}(G,\mathcal{H})$. We show that the standard sequences indeed maximize $|E(G)|$ for some choices of $\mathcal{H}$, but not for others. Many interesting questions and previous results arise very naturally in this context, which also, unusually, gives rise to sensible extremal questions concerning multigraphs and non-uniform hypergraphs.}, - - keywords = {pub}, - journal = {Discrete Mathematics}, - year = {2019}, - month = {Jul.}, - number = {7}, - volume = {342}, - pages = {1865-1884}, -} - -@Article{Bukh2018, - author = {Boris Bukh and Christopher Cox}, - title = {On a fractional version of {H}aemers' bound}, - abstract = {In this note, we present a fractional version of Haemers' bound on the Shannon capacity of a graph, which is originally due to Blasiak. This bound is a common strengthening of both Haemers' bound and the fractional chromatic number of a graph. We show that this fractional version outperforms any bound on the Shannon capacity that could be attained through Haemers' bound. We show also that this bound is multiplicative, unlike Haemers' bound.}, - journal = {IEEE Transactions on Information Theory}, - year = {2018}, - keywords = {pub}, -} - -@Article{Cox2018, - author = {Christopher Cox and Derrick Stolee}, - title = {Ramsey Numbers for Partially-Ordered Sets}, - journal = {Order}, - year = {2018}, - month = {Nov.}, - keywords = {pub}, - volume = {35}, - number = {3}, - pages = {557-579}, -} - -@Article{BCDHKLMMNPS15choose, - author = {Berikkyzy, Zhanar and Cox, Christopher and Dairyko, Michael and Hogenson, Kirsten and Kumbhat, Mohit and Lidick{\'y}, Bernard and Messerschmidt, Kacy and Moss, Kevin and Nowak, Kathleen and Palmowski, Kevin and Stolee, Derrick}, - title = {{$(4,2)$}-choosability of planar graphs with forbidden substructures}, - journal = {Graphs and Combinatorics}, - year = {2017}, - volume = {33}, - number = {4}, - pages = {751-787}, - month = {Jul.}, - keywords = {pub}, - owner = {Chris}, - timestamp = {2015.08.05}, - url = {http://arxiv.org/abs/1512.03787}, -} - -@Article{BBCDLP15euler, - author = {Banaian, Esther and Butler, Steve and Cox, Christopher and Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte}, - title = {A generalization of {E}ulerian numbers via rook placements}, - journal = {Involve}, - year = {2017}, - volume = {10}, - number = {4}, - pages = {691-705}, - month = {Mar.}, - keywords = {pub}, - owner = {Chris}, - url = {http://arxiv.org/abs/1508.03673}, -} - -@Article{BBCDLP15prime, - author = {Banaian, Esther and Butler, Steve and Cox, Christopher and Davis, Jeffrey and Landgraf, Jacob and Ponce, Scarlitte}, - title = {Counting prime juggling patterns}, - journal = {Graphs and Combinatorics}, - year = {2016}, - volume = {32}, - number = {5}, - pages = {1675-1688}, - month = {Sep.}, - keywords = {pub}, - owner = {Chris}, - url = {http://arxiv.org/abs/1508.05296} -} -@Article{CS16orram, - Title = {Ordered {R}amsey numbers of loose paths and matchings}, - Author = {Cox, Christopher and Stolee, Derrick}, - Journal = {Discrete Mathematics}, - Year = {2016}, - Month = {Feb.}, - Number = {2}, - Pages = {499-505}, - Volume = {339}, - - Abstract = {For a $k$-uniform hypergraph $G$ with vertex set $\{1,\ldots,n\}$, the ordered Ramsey number $\OR{t}{G}$ is the least integer $N$ such that every $t$-coloring of the edges of the complete $k$-uniform graph on vertex set $\{1,\ldots,N\}$ contains a monochromatic copy of $G$ whose vertices follow the prescribed order. -Due to this added order restriction, the ordered Ramsey numbers can be much larger than the usual graph Ramsey numbers. -We determine that the ordered Ramsey numbers of loose paths under a monotone order grows as a tower of height two less than the maximum degree in terms of the number of edges. -We also extend theorems of Conlon, Fox, Lee, and Sudakov [Ordered Ramsey numbers, arXiv:1410.5292] on the ordered Ramsey numbers of 2-uniform matchings to provide upper bounds on the ordered Ramsey number of $k$-uniform matchings under certain orderings.}, - Keywords = {pub}, - Owner = {Chris}, - Timestamp = {2015.05.05}, - Url = {http://www.sciencedirect.com/science/article/pii/S0012365X15003477} -} - -@Article{CDDKRT15hanabi, - author = {Cox, Christopher and De Silva, Jessica and DeOrsey, Philip and Kenter, Franklin and Retter, Troy and Tobin, R. Joshua}, - title = {How to make the perfect fireworks display: {T}wo strategies for {H}anabi}, - journal = {Mathematics Magazine}, - year = {2015}, - volume = {88}, - number = {5}, - pages = {323-336}, - month = {Dec.}, - abstract = {The game of \emph{Hanabi} is a multi-player cooperative card game which has many similarities to a mathematical `hat guessing game.' In \emph{Hanabi}, players do not know the cards in their own hand and must rely on the actions of the other players to communicate information. - -This paper presents two strategies for \emph{Hanabi}. Results from computer simulation demonstrate that both strategies perform well. In particular, one strategy achieves a perfect score of 25 points 75 percent of the time.}, - keywords = {pub}, - owner = {Chris}, - timestamp = {2015.05.05}, -} diff --git a/content/submitted.bib b/content/submitted.bib deleted file mode 100644 index 39b698d..0000000 --- a/content/submitted.bib +++ /dev/null @@ -1,11 +0,0 @@ -@Article{Bukh2018a, - author = {Boris Bukh and Christopher Cox}, - title = {Nearly orthogonal vectors and small antipodal spherical codes}, - 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\neq 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 paper, 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. Our results translate naturally to the analogous question in $\mathbb{C}^d$. In this case, the question relates to the existence of systems of $k^2$ equiangular lines in $\mathbb{C}^k$, also known as SIC-POVM in physics literature.}, - date = {2018-03-08}, - eprint = {1803.02949v1}, - eprintclass = {math.CO}, - eprinttype = {arXiv}, - file = {online:http\://arxiv.org/pdf/1803.02949v1:PDF}, - keywords = {sub}, -} @@ -5,6 +5,7 @@ \usepackage[colorlinks=true,citecolor=blue,urlcolor=blue,linkcolor=blue,bookmarksopen=true]{hyperref} \usepackage{tikz} \usepackage{enumitem} +\usepackage{bibentry} % The following hack from http://tex.stackexchange.com/a/103349 reduces spacing in the bibliography slightly. % The effect is that the paper is not so long @@ -35,6 +36,8 @@ \begin{document} +%\nobibliography{content/papers} +%\bibliographystyle{abbrv} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%% title+contact %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @@ -74,7 +77,6 @@ Extremal combinatorics, probablilistic methods, algebraic methods, graph theory, \section*{Publications} \subsection*{Submitted} \input{content/submitted.tex} - \subsection*{Published} \input{content/publications.tex} |