diff options
Diffstat (limited to 'data/papers.bib')
| -rw-r--r-- | data/papers.bib | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/data/papers.bib b/data/papers.bib index b4dc17b..8d2ecc1 100644 --- a/data/papers.bib +++ b/data/papers.bib @@ -151,7 +151,7 @@ doi = {10.1214/21-AAP1709}, urldate = {2019-12-17T16:26:03.191683Z}, extra = {Code}, - extraurl = {http://www.borisbukh.org/code/lcsfrogs19.html}, + extralink = {http://borisbukh.org/code/lcsfrogs19.html}, keywords = {published}, abstract = {Let $W^{(n)}$ be the $n$-letter word obtained by repeating a fixed word $W$, and let $R_n$ be a random $n$-letter word over the same alphabet. We show several results on the length of longest common subsequence (LCS) between $W^{(n)}$ and $R_n$; in particular, we show that its expectation is $\gamma_W n-O(\sqrt{n})$ for an efficiently-computable constant $\gamma_W$. @@ -219,8 +219,9 @@ url = {https://link.springer.com/article/10.1007%2Fs11856-020-2027-7}, eprint = {1803.02949}, eprinttype = {arxiv}, - eprintclass = {math.CO}, + eprintclass = {math.CO}, keywords = {published}, + extralink = {http://borisbukh.org/nearly_orthogonal_erratum.pdf}, 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$. |