diff options
Diffstat (limited to 'CurrentCV.bbl')
| -rw-r--r-- | CurrentCV.bbl | 579 |
1 files changed, 0 insertions, 579 deletions
diff --git a/CurrentCV.bbl b/CurrentCV.bbl deleted file mode 100644 index 28ce95b..0000000 --- a/CurrentCV.bbl +++ /dev/null @@ -1,579 +0,0 @@ -% $ biblatex auxiliary file $
-% $ biblatex bbl format version 2.9 $
-% Do not modify the above lines!
-%
-% This is an auxiliary file used by the 'biblatex' package.
-% This file may safely be deleted. It will be recreated as
-% required.
-%
-\begingroup
-\makeatletter
-\@ifundefined{ver@biblatex.sty}
- {\@latex@error
- {Missing 'biblatex' package}
- {The bibliography requires the 'biblatex' package.}
- \aftergroup\endinput}
- {}
-\endgroup
-
-\datalist[entry]{ydnt/global//global/global}
- \entry{Bukh2018a}{article}{}
- \name{author}{2}{}{%
- {{hash=BB}{%
- family={Bukh},
- familyi={B\bibinitperiod},
- given={Boris},
- giveni={B\bibinitperiod},
- }}%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- }
- \keyw{sub}
- \strng{namehash}{BBCC1}
- \strng{fullhash}{BBCC1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{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.%
- }
- \verb{eprint}
- \verb 1803.02949v1
- \endverb
- \field{title}{Nearly orthogonal vectors and small antipodal spherical
- codes}
- \verb{file}
- \verb online:http\://arxiv.org/pdf/1803.02949v1:PDF
- \endverb
- \field{eprinttype}{arXiv}
- \field{eprintclass}{math.CO}
- \field{day}{08}
- \field{month}{03}
- \field{year}{2018}
- \endentry
-
- \entry{Bukh2018}{article}{}
- \name{author}{2}{}{%
- {{hash=BB}{%
- family={Bukh},
- familyi={B\bibinitperiod},
- given={Boris},
- giveni={B\bibinitperiod},
- }}%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- }
- \keyw{sub}
- \strng{namehash}{BBCC1}
- \strng{fullhash}{BBCC1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{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.%
- }
- \verb{eprint}
- \verb 1802.00476v1
- \endverb
- \field{title}{On a fractional version of {H}aemers' bound}
- \verb{file}
- \verb online:http\://arxiv.org/pdf/1802.00476v1:PDF
- \endverb
- \field{eprinttype}{arXiv}
- \field{eprintclass}{cs.IT}
- \field{day}{01}
- \field{month}{02}
- \field{year}{2018}
- \endentry
-
- \entry{Cox2018}{article}{}
- \name{author}{2}{}{%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=SD}{%
- family={Stolee},
- familyi={S\bibinitperiod},
- given={Derrick},
- giveni={D\bibinitperiod},
- }}%
- }
- \list{publisher}{1}{%
- {Springer Nature}%
- }
- \keyw{app}
- \strng{namehash}{CCSD1}
- \strng{fullhash}{CCSD1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{title}{Ramsey Numbers for Partially-Ordered Sets}
- \field{journaltitle}{Order}
- \field{year}{2018}
- \warn{\item Invalid format of field 'month'}
- \endentry
-
- \entry{BBCDLP15euler}{article}{}
- \name{author}{6}{}{%
- {{hash=BE}{%
- family={Banaian},
- familyi={B\bibinitperiod},
- given={Esther},
- giveni={E\bibinitperiod},
- }}%
- {{hash=BS}{%
- family={Butler},
- familyi={B\bibinitperiod},
- given={Steve},
- giveni={S\bibinitperiod},
- }}%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=DJ}{%
- family={Davis},
- familyi={D\bibinitperiod},
- given={Jeffrey},
- giveni={J\bibinitperiod},
- }}%
- {{hash=LJ}{%
- family={Landgraf},
- familyi={L\bibinitperiod},
- given={Jacob},
- giveni={J\bibinitperiod},
- }}%
- {{hash=PS}{%
- family={Ponce},
- familyi={P\bibinitperiod},
- given={Scarlitte},
- giveni={S\bibinitperiod},
- }}%
- }
- \keyw{pub}
- \strng{namehash}{BEBSCC+1}
- \strng{fullhash}{BEBSCCDJLJPS1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{number}{4}
- \field{pages}{691\bibrangedash 705}
- \field{title}{A generalization of {E}ulerian numbers via rook placements}
- \verb{url}
- \verb http://arxiv.org/abs/1508.03673
- \endverb
- \field{volume}{10}
- \field{journaltitle}{Involve}
- \field{month}{03}
- \field{year}{2017}
- \endentry
-
- \entry{BCDHKLMMNPS15choose}{article}{}
- \name{author}{11}{}{%
- {{hash=BZ}{%
- family={Berikkyzy},
- familyi={B\bibinitperiod},
- given={Zhanar},
- giveni={Z\bibinitperiod},
- }}%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=DM}{%
- family={Dairyko},
- familyi={D\bibinitperiod},
- given={Michael},
- giveni={M\bibinitperiod},
- }}%
- {{hash=HK}{%
- family={Hogenson},
- familyi={H\bibinitperiod},
- given={Kirsten},
- giveni={K\bibinitperiod},
- }}%
- {{hash=KM}{%
- family={Kumbhat},
- familyi={K\bibinitperiod},
- given={Mohit},
- giveni={M\bibinitperiod},
- }}%
- {{hash=LB}{%
- family={Lidick{\'y}},
- familyi={L\bibinitperiod},
- given={Bernard},
- giveni={B\bibinitperiod},
- }}%
- {{hash=MK}{%
- family={Messerschmidt},
- familyi={M\bibinitperiod},
- given={Kacy},
- giveni={K\bibinitperiod},
- }}%
- {{hash=MK}{%
- family={Moss},
- familyi={M\bibinitperiod},
- given={Kevin},
- giveni={K\bibinitperiod},
- }}%
- {{hash=NK}{%
- family={Nowak},
- familyi={N\bibinitperiod},
- given={Kathleen},
- giveni={K\bibinitperiod},
- }}%
- {{hash=PK}{%
- family={Palmowski},
- familyi={P\bibinitperiod},
- given={Kevin},
- giveni={K\bibinitperiod},
- }}%
- {{hash=SD}{%
- family={Stolee},
- familyi={S\bibinitperiod},
- given={Derrick},
- giveni={D\bibinitperiod},
- }}%
- }
- \keyw{pub}
- \strng{namehash}{BZCCDM+1}
- \strng{fullhash}{BZCCDMHKKMLBMKMKNKPKSD1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{number}{4}
- \field{pages}{751\bibrangedash 787}
- \field{title}{{$(4,2)$}-choosability of planar graphs with forbidden
- substructures}
- \verb{url}
- \verb http://arxiv.org/abs/1512.03787
- \endverb
- \field{volume}{33}
- \field{journaltitle}{Graphs and Combinatorics}
- \field{month}{07}
- \field{year}{2017}
- \endentry
-
- \entry{briggscox17}{article}{}
- \name{author}{2}{}{%
- {{hash=BJ}{%
- family={Briggs},
- familyi={B\bibinitperiod},
- given={Joseph},
- giveni={J\bibinitperiod},
- }}%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- }
- \keyw{sub}
- \strng{namehash}{BJCC1}
- \strng{fullhash}{BJCC1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{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.%
- }
- \verb{eprint}
- \verb 1711.02082v2
- \endverb
- \field{title}{Inverting the {T}ur{\' a}n problem}
- \verb{file}
- \verb online:http\://arxiv.org/pdf/1711.02082v2:PDF
- \endverb
- \field{eprinttype}{arXiv}
- \field{eprintclass}{math.CO}
- \field{day}{06}
- \field{month}{11}
- \field{year}{2017}
- \endentry
-
- \entry{BBCDLP15prime}{article}{}
- \name{author}{6}{}{%
- {{hash=BE}{%
- family={Banaian},
- familyi={B\bibinitperiod},
- given={Esther},
- giveni={E\bibinitperiod},
- }}%
- {{hash=BS}{%
- family={Butler},
- familyi={B\bibinitperiod},
- given={Steve},
- giveni={S\bibinitperiod},
- }}%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=DJ}{%
- family={Davis},
- familyi={D\bibinitperiod},
- given={Jeffrey},
- giveni={J\bibinitperiod},
- }}%
- {{hash=LJ}{%
- family={Landgraf},
- familyi={L\bibinitperiod},
- given={Jacob},
- giveni={J\bibinitperiod},
- }}%
- {{hash=PS}{%
- family={Ponce},
- familyi={P\bibinitperiod},
- given={Scarlitte},
- giveni={S\bibinitperiod},
- }}%
- }
- \keyw{pub}
- \strng{namehash}{BEBSCC+1}
- \strng{fullhash}{BEBSCCDJLJPS1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{number}{5}
- \field{pages}{1675\bibrangedash 1688}
- \field{title}{Counting prime juggling patterns}
- \verb{url}
- \verb http://arxiv.org/abs/1508.05296
- \endverb
- \field{volume}{32}
- \field{journaltitle}{Graphs and Combinatorics}
- \field{month}{09}
- \field{year}{2016}
- \endentry
-
- \entry{CS16orram}{article}{}
- \name{author}{2}{}{%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=SD}{%
- family={Stolee},
- familyi={S\bibinitperiod},
- given={Derrick},
- giveni={D\bibinitperiod},
- }}%
- }
- \keyw{pub}
- \strng{namehash}{CCSD1}
- \strng{fullhash}{CCSD1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{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.%
- }
- \field{number}{2}
- \field{pages}{499\bibrangedash 505}
- \field{title}{Ordered {R}amsey numbers of loose paths and matchings}
- \verb{url}
- \verb http://www.sciencedirect.com/science/article/pii/S0012365X15003477
- \endverb
- \field{volume}{339}
- \field{journaltitle}{Discrete Mathematics}
- \field{month}{02}
- \field{year}{2016}
- \endentry
-
- \entry{CDDKRT15hanabi}{article}{}
- \name{author}{6}{}{%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=DSJ}{%
- family={De\bibnamedelima Silva},
- familyi={D\bibinitperiod\bibinitdelim S\bibinitperiod},
- given={Jessica},
- giveni={J\bibinitperiod},
- }}%
- {{hash=DP}{%
- family={DeOrsey},
- familyi={D\bibinitperiod},
- given={Philip},
- giveni={P\bibinitperiod},
- }}%
- {{hash=KF}{%
- family={Kenter},
- familyi={K\bibinitperiod},
- given={Franklin},
- giveni={F\bibinitperiod},
- }}%
- {{hash=RT}{%
- family={Retter},
- familyi={R\bibinitperiod},
- given={Troy},
- giveni={T\bibinitperiod},
- }}%
- {{hash=TRJ}{%
- family={Tobin},
- familyi={T\bibinitperiod},
- given={R.\bibnamedelima Joshua},
- giveni={R\bibinitperiod\bibinitdelim J\bibinitperiod},
- }}%
- }
- \keyw{pub}
- \strng{namehash}{CCDSJDP+1}
- \strng{fullhash}{CCDSJDPKFRTTRJ1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{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.%
- }
- \field{number}{5}
- \field{pages}{323\bibrangedash 336}
- \field{title}{How to make the perfect fireworks display: {T}wo strategies
- for {H}anabi}
- \field{volume}{88}
- \field{journaltitle}{Mathematics Magazine}
- \field{month}{12}
- \field{year}{2015}
- \endentry
-
- \entry{CFMR15potram}{article}{}
- \name{author}{4}{}{%
- {{hash=CC}{%
- family={Cox},
- familyi={C\bibinitperiod},
- given={Christopher},
- giveni={C\bibinitperiod},
- }}%
- {{hash=FM}{%
- family={Ferrara},
- familyi={F\bibinitperiod},
- given={Michael},
- giveni={M\bibinitperiod},
- }}%
- {{hash=MRR}{%
- family={Martin},
- familyi={M\bibinitperiod},
- given={Ryan\bibnamedelima R.},
- giveni={R\bibinitperiod\bibinitdelim R\bibinitperiod},
- }}%
- {{hash=RB}{%
- family={Reineger},
- familyi={R\bibinitperiod},
- given={Benjamin},
- giveni={B\bibinitperiod},
- }}%
- }
- \strng{namehash}{CCFMMRR+1}
- \strng{fullhash}{CCFMMRRRB1}
- \field{labelnamesource}{author}
- \field{labeltitlesource}{title}
- \field{sortinit}{7}
- \field{sortinithash}{7}
- \field{abstract}{%
- A sequence of nonnegative integers $\pi =(d_1,d_2,...,d_n)$ is {\it
- graphic} if there is a (simple) graph $G$ of order $n$ having degree sequence
- $\pi$. In this case, $G$ is said to {\it realize} or be a {\it realization
- of} $\pi$. Given a graph $H$, a graphic sequence $\pi$ is \textit{potentially
- $H$-graphic} if there is some realization of $\pi$ that contains $H$ as a
- subgraph. In this paper, we consider a degree sequence analogue to classical
- graph Ramsey numbers. For graphs $H_1$ and $H_2$, the
- \textit{potential-Ramsey number} $\rpot(H_1,H_2)$ is the minimum integer $N$
- such that for any $N$-term graphic sequence $\pi$, either $\pi$ is
- potentially $H_1$-graphic or the complementary sequence
- $\overline{\pi}=(N-1-d_N,\dots, N-1-d_1)$ is potentially $H_2$ graphic. We
- prove that if $s\ge 2$ is an integer and $T_t$ is a tree of order $t\ge
- 9(s-2)$ and then $$\rpot(T_t, K_s) = t+s-2.$$ This result, which is best
- possible up to the constant on $s-2$, is a degree sequence analogue to a
- classical 1977 result of Chv\'{a}tal on the graph Ramsey number of trees vs.\
- cliques. To obtain this theorem, we prove a sharp condition that ensures an
- arbitrary graph packs with a forest, which is likely to be of independent
- interest.%
- }
- \field{title}{Chv{\'a}tal-type results for degree sequence {R}amsey
- numbers}
- \verb{url}
- \verb http://arxiv.org/abs/1510.04843
- \endverb
- \field{journaltitle}{Preprint available as arXiv:1510.04843}
- \field{month}{05}
- \field{year}{2015}
- \endentry
-\enddatalist
-\endinput
|