diff options
| author | Yuchen Pei <me@ypei.me> | 2018-04-06 17:43:24 +0200 |
|---|---|---|
| committer | Yuchen Pei <me@ypei.me> | 2018-04-06 17:43:24 +0200 |
| commit | 2a2c61de0e44adad26c0034dfda6594c34f0d834 (patch) | |
| tree | 75d8d3960b552cf3b8b56e0abf11e78ca28f8776 | |
| parent | 76ab6c66b3c65f16c8d19a6d16c100cf45ec9e57 (diff) | |
second commit
53 files changed, 2208 insertions, 0 deletions
@@ -1 +1,105 @@ .swp +# Byte-compiled / optimized / DLL files +__pycache__/ +*.py[cod] +*$py.class + +# C extensions +*.so + +# Distribution / packaging +.Python +build/ +develop-eggs/ +dist/ +downloads/ +eggs/ +.eggs/ +lib/ +lib64/ +parts/ +sdist/ +var/ +wheels/ +*.egg-info/ +.installed.cfg +*.egg +MANIFEST + +# PyInstaller +# Usually these files are written by a python script from a template +# before PyInstaller builds the exe, so as to inject date/other infos into it. +*.manifest +*.spec + +# Installer logs +pip-log.txt +pip-delete-this-directory.txt + +# Unit test / coverage reports +htmlcov/ +.tox/ +.coverage +.coverage.* +.cache +nosetests.xml +coverage.xml +*.cover +.hypothesis/ +.pytest_cache/ + +# Translations +*.mo +*.pot + +# Django stuff: +*.log +local_settings.py +db.sqlite3 + +# Flask stuff: +instance/ +.webassets-cache + +# Scrapy stuff: +.scrapy + +# Sphinx documentation +docs/_build/ + +# PyBuilder +target/ + +# Jupyter Notebook +.ipynb_checkpoints + +# pyenv +.python-version + +# celery beat schedule file +celerybeat-schedule + +# SageMath parsed files +*.sage.py + +# Environments +.env +.venv +env/ +venv/ +ENV/ +env.bak/ +venv.bak/ + +# Spyder project settings +.spyderproject +.spyproject + +# Rope project settings +.ropeproject + +# mkdocs documentation +/site + +# mypy +.mypy_cache/ diff --git a/README.md b/README.md new file mode 100644 index 0000000..777fa01 --- /dev/null +++ b/README.md @@ -0,0 +1,8 @@ +This repository hosts all that is necessary to build [my personal webpage](https://ypei.me). + +It roughly consists of two parts, the contents and the code. The contents are the markdown files, and the code are the python code, css code and templates. + +The python code (`engine/engine.py`) is a tiny static site generator depending on [pypandoc](https://pypi.python.org/pypi/pypandoc), [PyYAML](http://pyyaml.org/) and [pyatom](https://pypi.python.org/pypi/pyatom). + +The contents are licensed under CC-BY-ND unless otherwise specified. +The code is licensed under GPLv3+. diff --git a/assets/css/default.css b/assets/css/default.css new file mode 100644 index 0000000..28b25df --- /dev/null +++ b/assets/css/default.css @@ -0,0 +1,57 @@ +*{ + background-color: #faebbc; +} +nav { + display: inline; + float: right; +} + +span.logo { + float: left; +} + +header { + width: 40rem; + margin: auto; + overflow: auto; + background-color: #f3f3f3; +} + +div.main { + width: 40rem; + margin: auto; +} + +div.bodyitem { + margin: 1rem; + margin-bottom: 3rem; + line-height: 1.6; +} + +a { + text-decoration: none; +} + +header a { + padding: 1rem; + display: inline-block; + background-color: #f3f3f3; +} + +blockquote { + border-left: .3rem solid #ccc; + padding-left: 1rem; +} + +a:hover{ + background-color: #ddd; +} + +li.postlistitem{ + margin-bottom: .5rem; +} + +ul.postlist{ + list-style-type: none; + padding: 0; +} diff --git a/assets/resources/1423graph.jpg b/assets/resources/1423graph.jpg Binary files differnew file mode 100644 index 0000000..1a6e739 --- /dev/null +++ b/assets/resources/1423graph.jpg diff --git a/assets/resources/juggling.png b/assets/resources/juggling.png Binary files differnew file mode 100644 index 0000000..18ec08b --- /dev/null +++ b/assets/resources/juggling.png diff --git a/assets/resources/qrsklatest.pdf b/assets/resources/qrsklatest.pdf Binary files differnew file mode 100644 index 0000000..01a042b --- /dev/null +++ b/assets/resources/qrsklatest.pdf diff --git a/assets/resources/realdis.pdf b/assets/resources/realdis.pdf Binary files differnew file mode 100644 index 0000000..92d9302 --- /dev/null +++ b/assets/resources/realdis.pdf diff --git a/assets/resources/wangana.png b/assets/resources/wangana.png Binary files differnew file mode 100644 index 0000000..b8457dc --- /dev/null +++ b/assets/resources/wangana.png diff --git a/assets/resources/wangana_screenshot_index.png b/assets/resources/wangana_screenshot_index.png Binary files differnew file mode 100644 index 0000000..ecaa8ac --- /dev/null +++ b/assets/resources/wangana_screenshot_index.png diff --git a/engine/engine.py b/engine/engine.py new file mode 100644 index 0000000..3373f7a --- /dev/null +++ b/engine/engine.py @@ -0,0 +1,144 @@ +import os +import re +import yaml +import pypandoc +import logging +from pyatom import AtomFeed + +def item_from_path(path): + with open(path) as f: + text = f.read() + p = re.compile(r'---\n(.*?)\n---(.*)', re.DOTALL) + matchres = p.search(text) + res = yaml.load(matchres.group(1)) + x, ext = os.path.splitext(path) + res.setdefault('name', os.path.basename(x)) + if ext in ['.md', '.markdown']: + logging.info('Converting {}...'.format(path)) + res['body'] = pypandoc.convert_text(matchres.group(2), 'html', format='md') + elif ext == '.wiki': + logging.info('Converting {}...'.format(path)) + res['body'] = pypandoc.convert_text(matchres.group(2), 'html', format='vimwiki') + elif ext == '.html': + res['body'] = matchres.group(2) + return res + +def combine(item, template): + resbody = template + for k, v in item.items(): + resbody = resbody.replace('${}$'.format(k), str(v)) + res = dict(item) + res['body'] = resbody + return res + + +def main(): + basedir = '../' + pagesdir = basedir + 'pages/' + postsdir = basedir + 'posts/' + micropostsdir = basedir + 'microposts/' + sitedir = basedir + 'site/' + templatesdir = basedir + 'templates/' + homepostnum = 5 + + logging.basicConfig(level=logging.DEBUG, format='%(asctime)s - %(levelname)s - %(message)s') + + posts = get_all_items(postsdir) + posts.sort(key=lambda x: x['date'], reverse=True) + for post in posts: + post.setdefault('url', 'posts/{}.html'.format(post['name'])) + with open('{}{}.html'.format(templatesdir, post['template'])) as f: + template = f.read() + post = combine(post, template) + save_to_html(post, sitedir) + + with open(templatesdir + 'barepost.html') as f: + template = f.read() + #headposts is the list of the first few posts, to be displayed on blog.html + headposts = {'body': ''} + for post in posts[:homepostnum]: + headposts['body'] += combine(post, template)['body'] + with open(templatesdir + 'blog.html') as f: + template = f.read() + headposts = combine(headposts, template) + headposts['url'] = 'blog.html' + save_to_html(headposts, sitedir) + + with open(templatesdir + 'postlistitem.html') as f: + template = f.read() + postlist = {'body': ''} + for post in posts: + postlist['body'] += combine(post, template)['body'] + with open(templatesdir + 'postlist.html') as f: + template = f.read() + postlist = combine(postlist, template) + postlist['url'] = 'postlist.html' + save_to_html(postlist, sitedir) + + pages = get_all_items(pagesdir) + for page in pages: + page.setdefault('url', page['name'] + '.html') + with open('{}{}.html'.format(templatesdir, page['template'])) as f: + template = f.read() + page = combine(page, template) + save_to_html(page, sitedir) + + microposts = get_all_items(micropostsdir) + microposts.sort(key=lambda x: x['date'], reverse=True) + with open(templatesdir + 'micropost.html') as f: + template = f.read() + allmposts = {'body':''} + for micropost in microposts: + allmposts['body'] += combine(micropost, template)['body'] + with open(templatesdir + 'microblog.html') as f: + template = f.read() + allmposts = combine(allmposts, template) + allmposts['url'] = 'microblog.html' + save_to_html(allmposts, sitedir) + + blog_feed = AtomFeed(title="Yuchen Pei's Blog", + feed_url="https://ypei.me/blog-feed.xml", + url="https://ypei.me", + author="Yuchen Pei") + for post in posts: + blog_feed.add(title=post["title"], + content=post["body"], + content_type="html", + author="Yuchen Pei", + url=post["url"], + updated=post["date"]) + blog_feed_item = {'body':blog_feed.to_string(), 'url': 'blog-feed.xml'} + save_to_html(blog_feed_item, sitedir) + + microblog_feed = AtomFeed(title="Yuchen Pei's Microblog", + feed_url="https://ypei.me/microblog-feed.xml", + url="https://ypei.me", + author="Yuchen Pei") + for micropost in microposts: + microblog_feed.add(title=micropost["date"], + content=micropost["body"], + content_type="html", + author="Yuchen Pei", + url="microblog.html", + updated=micropost["date"]) + microblog_feed_item = {'body':microblog_feed.to_string(), 'url': 'microblog-feed.xml'} + save_to_html(microblog_feed_item, sitedir) + +def save_to_html(item, sitedir): + path = sitedir + item['url'] + os.makedirs(os.path.dirname(path), exist_ok=True) + logging.info('Saving to {}...'.format(path)) + with open(path, 'w') as f: + f.write(item['body']) + +def get_all_items(dir_): + items = [] + for filename in os.listdir(dir_): + ext = filename.split('.')[-1] + path = dir_ + filename + item = item_from_path(path) + items.append(item) + return items + +if __name__ == "__main__": + main() diff --git a/microposts/hacker-ethics.md b/microposts/hacker-ethics.md new file mode 100644 index 0000000..c8d77d4 --- /dev/null +++ b/microposts/hacker-ethics.md @@ -0,0 +1,11 @@ +--- +date: 2018-04-06 +--- +> - Access to computers—and anything that might teach you something about the way the world works—should be unlimited and total. Always yield to the Hands-On Imperative! +> - All information should be free. +> - Mistrust Authority—Promote Decentralization. +> - Hackers should be judged by their hacking, not bogus criteria such as degrees, age, race, or position. +> - You can create art and beauty on a computer. +> - Computers can change your life for the better. + +[The Hacker Ethic](https://en.wikipedia.org/wiki/Hacker_ethic), [Hackers: Heroes of Computer Revolution](https://en.wikipedia.org/wiki/Hackers:_Heroes_of_the_Computer_Revolution), by Steven Levy diff --git a/microposts/static-site-generator.md b/microposts/static-site-generator.md new file mode 100644 index 0000000..5804153 --- /dev/null +++ b/microposts/static-site-generator.md @@ -0,0 +1,8 @@ +--- +date: 2018-03-23 +--- +> "Static site generators seem like music databases, in that everyone eventually writes their own crappy one that just barely scratches the itch they had (and I'm no exception)." + +<a href="https://news.ycombinator.com/item?id=7747651">\_\_david\_\_\@hackernews</a> + +So did I. diff --git a/pages/about.md b/pages/about.md new file mode 100644 index 0000000..799178d --- /dev/null +++ b/pages/about.md @@ -0,0 +1,19 @@ +--- +template: default +title: Yuchen Pei +name: index +--- + +Yuchen is a postdoctoral researcher in the [KTH RMSMA group](https://www.math.kth.se/RMSMA/). +Before KTH he did PhD in the [MASDOC program at Warwick](https://warwick.ac.uk/fac/sci/masdoc), and spent two years in a postdoc position in [CMSA at Harvard](http://cmsa.fas.harvard.edu). + +He is interested in machine learning and functional programming. + +He is also interested in the idea of open research and open sourced his research in Robinson-Schensted algorithms as a [wiki](https://toywiki.xyz). + +He can be reached at: +hi@ypei.me | [Github](https://github.com/ycpei) | [LinkedIn](https://www.linkedin.com/in/ycpei/) | [Twitter](https://twitter.com/_ypei) + +This website is made using a handmade static site generator. + +Unless otherwise specified, all contents on this website are licensed under [Creative Commons Attribution-NoDerivatives 4.0 International License](https://creativecommons.org/licenses/by-nd/4.0/). diff --git a/pages/links.md b/pages/links.md new file mode 100644 index 0000000..8420587 --- /dev/null +++ b/pages/links.md @@ -0,0 +1,54 @@ +--- +template: default +permalink: /links +title: Links +--- +Here are some links I find interesting or helpful, or both. Listed in no particular order. + +- [HaskellForMaths](https://haskellformaths.blogspot.com/) +- [Open Problem Garden](http://www.openproblemgarden.org/) +- [AMS open notes](http://www.ams.org/open-math-notes) +- [Macdonald polynomials webpage](http://garsia.math.yorku.ca/MPWP/) +- [Hacker News](https://news.ycombinator.com/) +- [Armin Straub](http://arminstraub.com/) +- [Bill Cherowitzo](http://www-math.ucdenver.edu/~wcherowi/) +- [Richard Stallman](https://stallman.org/) +- [Aaron Swartz](http://www.aaronsw.com/) - The Internet's own boy +- [False, Misleading, Clickbait-y, and/or Satirical “News” Sources](https://docs.google.com/document/d/10eA5-mCZLSS4MQY5QGb5ewC3VAL6pLkT53V_81ZyitM/preview) +- [Differential Equations & Linear Algebra](http://www.math.utah.edu/~jasonu/deala/) - Lecture notes on the web +- [William Stein](http://wstein.org/) - William Stein, the creator of SageMath + - [The origins of SageMath](http://wstein.org/talks/2016-06-sage-bp/) Stein's BP centenary talk at Harvard +- [SageMath](http://www.sagemath.org/) - Open-source maths software system +- [Project Euler](https://projecteuler.net/) +- [Blockly games](https://blockly-games.appspot.com/about?lang=en) +- [Math ∩ Programming](https://jeremykun.com/) +- [Authorea](https://www.authorea.com/) +- [Big Data](http://bigdata.show) +- [Fermat's Library](http://fermatslibrary.com/) +- [Tricki](http://www.tricki.org/) +- [AMS Feature Column](http://www.ams.org/samplings/feature-column/fc-current.cgi) +- [arXiv](https://arxiv.org) +- [What's new](https://terrytao.wordpress.com/) - Terence Tao's blog +- [Gowers's weblog](https://gowers.wordpress.com/) - Timothy Gowers's blog +- [Polymath](http://michaelnielsen.org/polymath1/index.php?title=Main_Page) - MMO maths research +- [OEIS](https://oeis.org/) - The On-Line Encyclopedia of Integer Sequences® (OEIS®) +- [Vi IMproved](http://www.vim.org) - the one true text editor. + Plugins: + - [vim-latex](http://vim-latex.sourceforge.net/) - for latexing + - [vimwiki](https://code.google.com/p/vimwiki/) - a wiki tool with google wiki-like markup + - [neocomplete](https://github.com/Shougo/neocomplete.vim) - for auto-completion +- [vimperator](http://www.vimperator.org/vimperator) - turn your Firefox into Vim +- [muttator](http://www.vimperator.org/muttator) - turn your Thunderbird into Vim +- [zathura](http://pwmt.org/projects/zathura/) - turn your pdf reader into Vim +- [i3wm](https://i3wm.org/) - turn your window manager into Vim +- [VimGolf](http://www.vimgolf.com/) +- [Regex Golf](http://regex.alf.nu/) +- [Regex Crossword](http://regexcrossword.com/) +- [Arch Linux](http://archlinux.org) +- [Jupyter notebook](https://jupyter.org/) - An open-source notebook +- Stackexchange sites + - [Mathoverflow](https://mathoverflow.net/) + - [Mathematics](https://math.stackexchange.com/) + - [Codegolf](https://codegolf.stackexchange.com/) - The most fun corner of Stackexchange. +- [Danial Bump](http://math.stanford.edu/~bump/) +- [Bill Casselman](http://www.math.ubc.ca/~cass/) diff --git a/posts/2013-06-01-q-robinson-schensted-paper.md b/posts/2013-06-01-q-robinson-schensted-paper.md new file mode 100644 index 0000000..657412d --- /dev/null +++ b/posts/2013-06-01-q-robinson-schensted-paper.md @@ -0,0 +1,31 @@ +--- +template: oldpost +title: A \(q\)-weighted Robinson-Schensted algorithm +date: 2013-06-01 +comments: true +tags: RS, \(q\)-Whittaker_functions, Macdonald_polynomials +archive: false +--- +In [this paper](https://projecteuclid.org/euclid.ejp/1465064320) with [Neil](http://www.bristol.ac.uk/maths/people/neil-m-oconnell/) we construct a \\(q\\)-version of the Robinson-Schensted +algorithm with column insertion. Like the [usual RS +correspondence](http://en.wikipedia.org/wiki/Robinson–Schensted_correspondence) +with column insertion, this algorithm could take words as input. Unlike +the usual RS algorithm, the output is a set of weighted pairs of +semistandard and standard Young tableaux \\((P,Q)\\) with the same +shape. The weights are rational functions of indeterminant \\(q\\). + +If \\(q\\in\[0,1\]\\), the algorithm can be considered as a randomised +RS algorithm, with 0 and 1 being two interesting cases. When +\\(q\\to0\\), it is reduced to the latter usual RS algorithm; while +when \\(q\\to1\\) with proper scaling it should scale to directed random +polymer model in [(O'Connell 2012)](http://arxiv.org/abs/0910.0069). +When the input word \\(w\\) is a random walk: + +\\begin{align\*}\\mathbb +P(w=v)=\\prod\_{i=1}^na\_{v\_i},\\qquad\\sum\_ja\_j=1\\end{align\*} + +the shape of output evolves as a Markov chain with kernel related to +\\(q\\)-Whittaker functions, which are Macdonald functions when +\\(t=0\\) with a factor. + + diff --git a/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md b/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md new file mode 100644 index 0000000..38874bb --- /dev/null +++ b/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md @@ -0,0 +1,19 @@ +--- +template: oldpost +title: Symmetry property of \(q\)-weighted Robinson-Schensted algorithms and branching algorithms +date: 2014-04-01 +comments: true +archive: false +tags: RS, growth_diagrams +--- +In [this paper](http://link.springer.com/article/10.1007/s10801-014-0505-x) a symmetry property analogous to the well known symmetry +property of the normal Robinson-Schensted algorithm has been shown for +the \\(q\\)-weighted Robinson-Schensted algorithm. The proof uses a +generalisation of the growth diagram approach introduced by Fomin. This +approach, which uses "growth graphs", can also be applied to a wider +class of insertion algorithms which have a branching structure. + + + +Above is the growth graph of the \\(q\\)-weighted Robinson-Schensted +algorithm for the permutation \\({1 2 3 4\\choose1 4 2 3}\\). diff --git a/posts/2015-01-20-weighted-interpretation-super-catalan-numbers.md b/posts/2015-01-20-weighted-interpretation-super-catalan-numbers.md new file mode 100644 index 0000000..6d9e75e --- /dev/null +++ b/posts/2015-01-20-weighted-interpretation-super-catalan-numbers.md @@ -0,0 +1,40 @@ +--- +template: oldpost +title: AMS review of 'A weighted interpretation for the super Catalan numbers' by Allen and Gheorghiciuc +date: 2015-01-20 +comments: true +archive: false +--- +The super Catalan numbers are defined as +\$\$ T(m,n) = {(2 m)! (2 n)! \over 2 m! n! (m + n)!}. \$\$ + + This paper has two main results. First a combinatorial interpretation +of the super Catalan numbers is given: +\$\$ T(m,n) = P(m,n) - N(m,n) \$\$ +where \\(P(m,n)\\) +enumerates the number of 2-Motzkin paths whose \\(m\\) -th step begins at an even level (called \\(m\\)-positive paths) and \\(N(m,n)\\) +those with \\(m\\)-th step beginning at an odd level (\\(m\\)-negative paths). The proof uses a recursive argument on the number of +\\(m\\)-positive and -negative paths, based on a recursion of the super Catalan +numbers appearing in \[I. M. Gessel, J. Symbolic Comput. **14** (1992), no. 2-3, 179–194; +[MR1187230](http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=1187230&loc=fromrevtext)\]: +\$\$ 4T(m,n) = T(m+1, n) + T(m, n+1). \$\$ +This result gives an expression for the super Catalan numbers in terms +of numbers counting the so-called ballot paths. The latter sometimes are +also referred to as the generalised Catalan numbers forming the entries +of the Catalan triangle. + + Based on the first result, the second result is a combinatorial +interpretation of the super Catalan numbers \\(T(2,n)\\) +in terms of counting certain Dyck paths. This is equivalent to a +theorem, which represents \\(T(2,n)\\) +as counting of certain pairs of Dyck paths, in \[I. M. Gessel and G. +Xin, J. Integer Seq. **8** (2005), no. 2, Article +05.2.3, 13 pp.; +[MR2134162](http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=2134162&loc=fromrevtext)\], +and the equivalence is explained at the end of the paper by a bijection +between the Dyck paths and the pairs of Dyck paths. The proof of the +theorem itself is also done by constructing two bijections between Dyck +paths satisfying certain conditions. All the three bijections are +formulated by locating, removing and adding steps. + +Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3275875, its copyright owned by the AMS. diff --git a/posts/2015-04-01-unitary-double-products.md b/posts/2015-04-01-unitary-double-products.md new file mode 100644 index 0000000..a2f8ccb --- /dev/null +++ b/posts/2015-04-01-unitary-double-products.md @@ -0,0 +1,10 @@ +--- +title: Unitary causal quantum stochastic double products as universal interactions I +date: 2015-04-01 +template: oldpost +comments: true +archive: false +--- +In [this paper](http://www.actaphys.uj.edu.pl/findarticle?series=Reg&vol=46&page=1851) with [Robin](http://homepages.lboro.ac.uk/~marh3/) we show the explicit formulae for a family of unitary +triangular and rectangular double product integrals which can be +described as second quantisations. diff --git a/posts/2015-04-02-juggling-skill-tree.md b/posts/2015-04-02-juggling-skill-tree.md new file mode 100644 index 0000000..be39822 --- /dev/null +++ b/posts/2015-04-02-juggling-skill-tree.md @@ -0,0 +1,33 @@ +--- +template: oldpost +title: jst +date: 2015-04-02 +comments: true +archive: false +--- +jst = juggling skill tree + +If you have ever played a computer role playing game, you may have +noticed the protagonist sometimes has a skill "tree" (most of the time +it is actually a directed acyclic graph), where certain skills leads to +others. For example, +[here](http://hydra-media.cursecdn.com/diablo.gamepedia.com/3/37/Sorceress_Skill_Trees_%28Diablo_II%29.png?version=b74b3d4097ef7ad4e26ebee0dcf33d01) +is the skill tree of sorceress in [Diablo +II](https://en.wikipedia.org/wiki/Diablo_II). + +Now suppose our hero embarks on a quest for learning all the possible +juggling patterns. Everyone would agree she should start with cascade, +the simplest nontrivial 3-ball pattern, but what afterwards? A few other +accessible patterns for beginners are juggler's tennis, two in one and +even reverse cascade, but what to learn after that? The encyclopeadic +[Library of Juggling](http://libraryofjuggling.com/) serves as a good +guide, as it records more than 160 patterns, some of which very +aesthetically appealing. On this website almost all the patterns have a +"prerequisite" section, indicating what one should learn beforehand. I +have therefore written a script using [Python](http://python.org), +[BeautifulSoup](http://www.crummy.com/software/BeautifulSoup/) and +[pygraphviz](http://pygraphviz.github.io/) to generate a jst (graded by +difficulties, which is the leftmost column) from the Library of Juggling +(click the image for the full size): + +[{width="38em"}](../assets/resources/juggling.png) diff --git a/posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.md b/posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.md new file mode 100644 index 0000000..8f2ff8e --- /dev/null +++ b/posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.md @@ -0,0 +1,94 @@ +--- +template: oldpost +title: AMS review of 'Infinite binary words containing repetitions of odd period' by Badkobeh and Crochemore +date: 2015-05-30 +comments: true +archive: false +--- +This paper is about the existence of pattern-avoiding infinite binary +words, where the patterns are squares, cubes and \\(3^+\\)-powers. + There are mainly two kinds of results, positive (existence of an +infinite binary word avoiding a certain pattern) and negative +(non-existence of such a word). Each positive result is proved by the +construction of a word with finitely many squares and cubes which are +listed explicitly. First a synchronising (also known as comma-free) +uniform morphism \\(g\\: \\Sigma_3^\* \\to +\\Sigma_2^\*\\) + +is constructed. Then an argument is given to show that the length of +squares in the code \\(g(w)\\) +for a squarefree \\(w\\) is bounded, hence all the squares can be obtained by examining all \\(g(s)\\) for \\(s\\) +of bounded lengths. The argument resembles that of the proof of, e.g., +Theorem 1, Lemma 2, Theorem 3 and Lemma 4 in \[N. Rampersad, J. O. +Shallit and M. Wang, Theoret. Comput. Sci. **339** +(2005), no. 1, 19–34; +[MR2142071](http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=2142071&loc=fromrevtext)\]. +The negative results are proved by traversing all possible finite words +satisfying the conditions. + + Let \\(L(n_2, n_3, S)\\) be the maximum length of a word with \\(n_2\\) distinct squares, \\(n_3\\) +distinct cubes and that the periods of the squares can take values only +in \\(S\\) +, where \\(n_2, n_3 \\in \\Bbb N \\cup +\\{\\infty, \\omega\\}\\) +and \\(S \\subset \\Bbb N_+\\) +. + \\(n_k = 0\\) +corresponds to \\(k\\)-free, \\(n_k = \\infty\\) +means no restriction on the number of distinct \\(k\\)-powers, and \\(n_k = \\omega\\) +means \\(k^+\\)-free. + + Below is the summary of the positive and negative results: + +(1) (Negative) \\(L(\\infty, \\omega, 2 \\Bbb N) + < \\infty\\) + : \\(\\nexists\\) + an infinite \\(3^+\\) + -free binary word avoiding all squares of odd periods. + (Proposition 1) + +(2) (Negative) \\(L(\\infty, 0, 2 \\Bbb N + 1) \\le + 23\\) + : \\(\\nexists\\) + an infinite 3-free binary word, avoiding squares of even periods. + The longest one has length \\(\\le 23\\) + (Proposition 2). + +(3) (Positive) \\(L(\\infty, \\omega, 2 \\Bbb N + + 1) = \\infty\\) + : \\(\\exists\\) + an infinite \\(3^+\\) + -free binary word avoiding squares of even periods (Theorem 1). + +(4) (Positive) \\(L(\\infty, \\omega, \\{1, 3\\}) = + \\infty\\) + : \\(\\exists\\) + an infinite \\(3^+\\) + -free binary word containing only squares of period 1 or 3 + (Theorem 2). + +(5) (Negative) \\(L(6, 1, 2 \\Bbb N + 1) = + 57\\) + : \\(\\nexists\\) + an infinite binary word avoiding squares of even period containing + \\(< 7\\) + squares and \\(< 2\\) + cubes. The longest one containing 6 squares and 1 cube has length 57 + (Proposition 6). + +(6) (Positive) \\(L(7, 1, 2 \\Bbb N + 1) = + \\infty\\) + : \\(\\exists\\) + an infinite \\(3^+\\) + -free binary word avoiding squares of even period with 1 cube and 7 + squares (Theorem 3). + +(7) (Positive) \\(L(4, 2, 2 \\Bbb N + 1) = + \\infty\\) + : \\(\\exists\\) + an infinite \\(3^+\\) + -free binary words avoiding squares of even period and containing 2 + cubes and 4 squares (Theorem 4). + + +Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3313467, its copyright owned by the AMS. diff --git a/posts/2015-07-01-causal-quantum-product-levy-area.md b/posts/2015-07-01-causal-quantum-product-levy-area.md new file mode 100644 index 0000000..cbf2fcf --- /dev/null +++ b/posts/2015-07-01-causal-quantum-product-levy-area.md @@ -0,0 +1,13 @@ +--- +template: oldpost +title: On a causal quantum double product integral related to Lévy stochastic area. +date: 2015-07-01 +archive: false +comments: true +--- +In [this paper](https://arxiv.org/abs/1506.04294) with [Robin](http://homepages.lboro.ac.uk/~marh3/) we study the family of causal double product integrals +\\[ +\\prod_{a < x < y < b}\\left(1 + i{\\lambda \\over 2}(dP_x dQ_y - dQ_x dP_y) + i {\\mu \\over 2}(dP_x dP_y + dQ_x dQ_y)\\right) +\\] + +where $P$ and $Q$ are the mutually noncommuting momentum and position Brownian motions of quantum stochastic calculus. The evaluation is motivated heuristically by approximating the continuous double product by a discrete product in which infinitesimals are replaced by finite increments. The latter is in turn approximated by the second quantisation of a discrete double product of rotation-like operators in different planes due to a result in [(Hudson-Pei2015)](http://www.actaphys.uj.edu.pl/findarticle?series=Reg&vol=46&page=1851). The main problem solved in this paper is the explicit evaluation of the continuum limit $W$ of the latter, and showing that $W$ is a unitary operator. The kernel of $W$ is written in terms of Bessel functions, and the evaluation is achieved by working on a lattice path model and enumerating linear extensions of related partial orderings, where the enumeration turns out to be heavily related to Dyck paths and generalisations of Catalan numbers. diff --git a/posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.md b/posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.md new file mode 100644 index 0000000..efdd416 --- /dev/null +++ b/posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.md @@ -0,0 +1,73 @@ +--- +template: oldpost +title: AMS review of 'Double Macdonald polynomials as the stable limit of Macdonald superpolynomials' by Blondeau-Fournier, Lapointe and Mathieu +date: 2015-07-15 +comments: true +archive: false +--- +A Macdonald superpolynomial (introduced in \[O. Blondeau-Fournier et +al., Lett. Math. Phys. <span class="bf">101</span> (2012), no. 1, 27–47; +[MR2935476](http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=2935476&loc=fromrevtext); +J. Comb. <span class="bf">3</span> (2012), no. 3, 495–561; +[MR3029444](http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=3029444&loc=fromrevtext)\]) +in \\(N\\) +Grassmannian variables indexed by a superpartition \\(\\Lambda\\) +is said to be stable if \\({m (m + 1) \\over 2} +\\ge |\\Lambda|\\) +and \\(N \\ge |\\Lambda| - {m (m - 3) \\over +2}\\) +, where \\(m\\) +is the fermionic degree. A stable Macdonald superpolynomial +(corresponding to a bisymmetric polynomial) is also called a double +Macdonald polynomial (dMp). The main result of this paper is the +factorisation of a dMp into plethysms of two classical Macdonald +polynomials (Theorem 5). Based on this result, this paper + +(1) shows that the dMp has a unique decomposition into bisymmetric + monomials; + +(2) calculates the norm of the dMp; + +(3) calculates the kernel of the Cauchy-Littlewood-type identity of the + dMp; + +(4) shows the specialisation of the aforementioned factorisation to the + Jack, Hall-Littlewood and Schur cases. One of the three Schur + specialisations, denoted as \\(s_{\\lambda, \\mu}\\), also appears in (7) and (9) below; + +(5) defines the \\(\\omega\\) + -automorphism in this setting, which was used to prove an identity + involving products of four Littlewood-Richardson coefficients; + +(6) shows an explicit evaluation of the dMp motivated by the most + general evaluation of the usual Macdonald polynomials; + +(7) relates dMps with the representation theory of the hyperoctahedral + group \\(B_n\\) + via the double Kostka coefficients (which are defined as the entries + of the transition matrix from the bisymmetric Schur functions \\(s_{\\lambda, \\mu}\\) + to the modified dMps); + +(8) shows that the double Kostka coefficients have the positivity and + the symmetry property, and can be written as sums of products of the + usual Kostka coefficients; + +(9) defines an operator \\(\\nabla^B\\) + as an analogue of the nabla operator \\(\\nabla\\) + introduced in \[F. Bergeron and A. M. Garsia, in *Algebraic methods and \\(q\\)-special functions* (Montréal, QC, 1996), 1–52, CRM Proc. Lecture + Notes, 22, Amer. Math. Soc., Providence, RI, 1999; + [MR1726826](http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=1726826&loc=fromrevtext)\]. + The action of \\(\\nabla^B\\) + on the bisymmetric Schur function \\(s_{\\lambda, \\mu}\\) + yields the dimension formula \\((h + 1)^r\\) + for the corresponding representation of \\(B_n\\) + , where \\(h\\) + and \\(r\\) + are the Coxeter number and the rank of \\(B_n\\) + , in the same way that the action of \\(\\nabla\\) + on the \\(n\\) + th elementary symmetric function leads to the same formula for the + group of type \\(A_n\\) + . + +Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3306078, its copyright owned by the AMS. diff --git a/posts/2016-10-13-q-robinson-schensted-knuth-polymer.md b/posts/2016-10-13-q-robinson-schensted-knuth-polymer.md new file mode 100644 index 0000000..4d31e37 --- /dev/null +++ b/posts/2016-10-13-q-robinson-schensted-knuth-polymer.md @@ -0,0 +1,23 @@ +--- +template: oldpost +title: A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer +date: 2016-10-13 +comments: true +archive: false +--- +(Latest update: 2017-01-12) +In [Matveev-Petrov 2016](http://arxiv.org/abs/1504.00666) a \\(q\\)-deformed Robinson-Schensted-Knuth algorithm (\\(q\\)RSK) was introduced. In this article we give reformulations of this algorithm in terms of Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pair are swapped in a sense of distribution when the input matrix is transposed. We also formulate a \\(q\\)-polymer model based on the \\(q\\)RSK and prove the corresponding Burke property, which we use to show a strong law of large numbers for the partition function given stationary boundary conditions and \\(q\\)-geometric weights. We use the \\(q\\)-local moves to define a generalisation of the \\(q\\)RSK taking a Young diagram-shape of array as the input. We write down the joint distribution of partition functions in the space-like direction of the \\(q\\)-polymer in \\(q\\)-geometric environment, formulate a \\(q\\)-version of the multilayer polynuclear growth model (\\(q\\)PNG) and write down the joint distribution of the \\(q\\)-polymer partition functions at a fixed time. + +This article is available at [arXiv](https://arxiv.org/abs/1610.03692). +It seems to me that one difference between arXiv and Github is that on arXiv each preprint has a few versions only. +In Github many projects have a "dev" branch hosting continuous updates, whereas the master branch is where the stable releases live. + +[Here]({{ site.url }}/assets/resources/qrsklatest.pdf) is a "dev" version of the article, which I shall push to arXiv when it stablises. Below is the changelog. + +* 2017-01-12: Typos and grammar, arXiv v2. +* 2016-12-20: Added remarks on the geometric \\(q\\)-pushTASEP. Added remarks on the converse of the Burke property. Added natural language description of the \\(q\\)RSK. Fixed typos. +* 2016-11-13: Fixed some typos in the proof of Theorem 3. +* 2016-11-07: Fixed some typos. The \\(q\\)-Burke property is now stated in a more symmetric way, so is the law of large numbers Theorem 2. +* 2016-10-20: Fixed a few typos. Updated some references. Added a reference: [a set of notes titled "RSK via local transformations"](http://web.mit.edu/~shopkins/docs/rsk.pdf). +It is written by [Sam Hopkins](http://web.mit.edu/~shopkins/) in 2014 as an expository article based on MIT combinatorics preseminar presentations of Alex Postnikov. +It contains some idea (applying local moves to a general Young-diagram shaped array in the order that matches any growth sequence of the underlying Young diagram) which I thought I was the first one to write down. diff --git a/posts/2017-04-25-open_research_toywiki.md b/posts/2017-04-25-open_research_toywiki.md new file mode 100644 index 0000000..1b9b45a --- /dev/null +++ b/posts/2017-04-25-open_research_toywiki.md @@ -0,0 +1,19 @@ +--- +template: oldpost +title: Open mathematical research and launching toywiki +date: 2017-04-25 +comments: true +archive: false +--- +As an experimental project, I am launching toywiki. + +It hosts a collection of my research notes. + +It takes some ideas from the open source culture and apply them to mathematical research: +1. It uses a very permissive license (CC-BY-SA). For example anyone can fork the project and make their own version if they have a different vision and want to build upon the project. +2. All edits will done with maximum transparency, and discussions of any of notes should also be as public as possible (e.g. Github issues) +3. Anyone can suggest changes by opening issues and submitting pull requests + +Here are the links: [toywiki](http://toywiki.xyz) and [github repo](https://github.com/ycpei/toywiki). + +Feedbacks are welcome by email. diff --git a/posts/2017-08-07-mathematical_bazaar.md b/posts/2017-08-07-mathematical_bazaar.md new file mode 100644 index 0000000..00a8724 --- /dev/null +++ b/posts/2017-08-07-mathematical_bazaar.md @@ -0,0 +1,208 @@ +--- +template: oldpost +title: The Mathematical Bazaar +date: 2017-08-07 +comments: true +archive: false +--- + +In this essay I describe some problems in academia of mathematics and +propose an open source model, which I call open research in mathematics. + +This essay is a work in progress - comments and criticisms are welcome! +[^feedback] + +Before I start I should point out that + +1. Open research is *not* open access. In fact the latter is a + prerequisite to the former. +2. I am not proposing to replace the current academic model with the + open model - I know academia works well for many people and I am + happy for them, but I think an open research community is long + overdue since the wide adoption of the World Wide Web more than two + decades ago. In fact, I fail to see why an open model can not run in + tandem with the academia, just like open source and closed source + software development coexist today. + +problems of academia +-------------------- + +Open source projects are characterised by publicly available source +codes as well as open invitations for public collaborations, whereas closed +source projects do not make source codes accessible to the public. How +about mathematical academia then, is it open source or closed source? The +answer is neither. + +Compared to some other scientific disciplines, mathematics does not +require expensive equipments or resources to replicate results; compared +to programming in conventional software industry, mathematical findings +are not meant to be commercial, as credits and reputation rather than +money are the direct incentives (even though the former are commonly +used to trade for the latter). It is also a custom and common belief +that mathematical derivations and theorems shouldn\'t be patented. +Because of this, mathematical research is an open source activity in the +sense that proofs to new results are all available in papers, and thanks +to open access e.g. the arXiv preprint repository most of the new +mathematical knowledge is accessible for free. + +Then why, you may ask, do I claim that maths research is not open +sourced? Well, this is because 1. mathematical arguments are not easily +replicable and 2. mathematical research projects are mostly not open for +public participation. + +Compared to computer programs, mathematical arguments are not written in +an unambiguous language, and they are terse and not written in maximum +verbosity (this is especially true in research papers as journals +encourage limiting the length of submissions), so the understanding of a +proof depends on whether the reader is equipped with the right +background knowledge, and the completeness of a proof is highly +subjective. More generally speaking, computer programs are mostly +portable because all machines with the correct configurations can +understand and execute a piece of program, whereas humans are subject to +their environment, upbringings, resources etc. to have a brain ready to +comprehend a proof that interests them. (these barriers are softer than +the expensive equipments and resources in other scientific fields +mentioned before because it is all about having access to the right +information) + +On the other hand, as far as the pursuit of reputation and prestige +(which can be used to trade for the scarce resource of research +positions and grant money) goes, there is often little practical +motivation for career mathematicians to explain their results to the +public carefully. And so the weird reality of the mathematical academia +is that it is not an uncommon practice to keep trade secrets in order to +protect one\'s territory and maintain a monopoly. This is doable because +as long as a paper passes the opaque and sometimes political peer review +process and is accepted by a journal, it is considered work done, +accepted by the whole academic community and adds to the reputation of +the author(s). Just like in the software industry, trade secrets and +monopoly hinder the development of research as a whole, as well as +demoralise outsiders who are interested in participating in related +research. + +Apart from trade secrets and territoriality, another reason to the +nonexistence of open research community is an elitist tradition in the +mathematical academia, which goes as follows: + +- Whoever is not good at mathematics or does not possess a degree in + maths is not eligible to do research, or else they run high risks of + being labelled a crackpot. +- Mistakes made by established mathematicians are more tolerable than + those less established. +- Good mathematical writings should be deep, and expositions of + non-original results are viewed as inferior work and do not add to + (and in some cases may even damage) one\'s reputation. + +All these customs potentially discourage public participations in +mathematical research, and I do not see them easily go away unless an +open source community gains momentum. + +To solve the above problems, I propose a open source model of +mathematical research, which has high levels of openness and +transparency and also has some added benefits listed in the last section +of this essay. This model tries to achieve two major goals: + +- Open and public discussions and collaborations of mathematical + research projects online +- Open review to validate results, where author name, reviewer name, + comments and responses are all publicly available online. + +To this end, a Github model is fitting. Let me first describe how open +source collaboration works on Github. + +open source collaborations on Github +------------------------------------ + +On [Github](https://github.com), every project is publicly available in +a repository (we do not consider private repos). The owner can update +the project by \"committing\" changes, which include a message of what +has been changed, the author of the changes and a timestamp. Each +project has an issue tracker, which is basically a discussion forum +about the project, where anyone can open an issue (start a discussion), +and the owner of the project as well as the original poster of the issue +can close it if it is resolved, e.g. bug fixed, feature added, or out of +the scope of the project. Closing the issue is like ending the +discussion, except that the thread is still open to more posts for +anyone interested. People can react to each issue post, e.g. upvote, +downvote, celebration, and importantly, all the reactions are public +too, so you can find out who upvoted or downvoted your post. + +When one is interested in contributing code to a project, they fork it, +i.e. make a copy of the project, and make the changes they like in the +fork. Once they are happy with the changes, they submit a pull request +to the original project. The owner of the original project may accept or +reject the request, and they can comment on the code in the pull +request, asking for clarification, pointing out problematic part of the +code etc and the author of the pull request can respond to the comments. +Anyone, not just the owner can participate in this review process, +turning it into a public discussion. In fact, a pull request is a +special issue thread. Once the owner is happy with the pull request, +they accept it and the changes are merged into the original project. The +author of the changes will show up in the commit history of the original +project, so they get the credits. + +As an alternative to forking, if one is interested in a project but has +a different vision, or that the maintainer has stopped working on it, +they can clone it and make their own version. This is a more independent +kind of fork because there is no longer intention to contribute back to +the original project. + +Moreover, on Github there is no way to send private messages, which +forces people to interact publicly. If say you want someone to see and +reply to your comment in an issue post or pull request, you simply +mention them by `@someone`. + +open research in mathematics +---------------------------- + +All this points to a promising direction of open research. A maths +project may have a wiki / collection of notes, the paper being written, +computer programs implementing the results etc. The issue tracker can +serve as a discussion forum about the project as well as a platform for +open review (bugs are analogous to mistakes, enhancements are possible +ways of improving the main results etc.), and anyone can make their own +version of the project, and (optionally) contribute back by making pull +requests, which will also be openly reviewed. One may want to add an +extra \"review this project\" functionality, so that people can comment +on the original project like they do in a pull request. This may or may +not be necessary, as anyone can make comments or point out mistakes in +the issue tracker. + +One may doubt this model due to concerns of credits because work in +progress is available to anyone. Well, since all the contributions are +trackable in project commit history and public discussions in issues and +pull request reviews, there is in fact *less* room for cheating than the +current model in academia, where scooping can happen without any +witnesses. What we need is a platform with a good amount of trust like +arXiv, so that the open research community honours (and can not ignore) +the commit history, and the chance of mis-attribution can be reduced to +minimum. + +Compared to the academic model, open research also has the following +advantages: + +- Anyone in the world with Internet access will have a chance to + participate in research, whether they are affiliated to a + university, have the financial means to attend conferences, or are + colleagues of one of the handful experts in a specific field. +- The problem of replicating / understanding maths results will be + solved, as people help each other out. This will also remove the + burden of answering queries about one\'s research. For example, say + one has a project \"Understanding the fancy results in \[paper + name\]\", they write up some initial notes but get stuck + understanding certain arguments. In this case they can simply post + the questions on the issue tracker, and anyone who knows the answer, + or just has a speculation can participate in the discussion. In the + end the problem may be resolved without the authors of the paper + being bothered, who may be too busy to answer. +- Similarly, the burden of peer review can also be shifted from a few + appointed reviewers to the crowd. + +related readings +---------------- + +- [The Cathedral and the Bazaar by Eric Raymond](http://www.catb.org/esr/writings/cathedral-bazaar/) +- [Doing sience online by Michael Nielson](http://michaelnielsen.org/blog/doing-science-online/) +- [Is massively collaborative mathematics possible? by Timothy Gowers](https://gowers.wordpress.com/2009/01/27/is-massively-collaborative-mathematics-possible/) + +[^feedback]: Please send your comments to my email address - I am still looking for ways to add a comment functionality to this website. diff --git a/site/assets b/site/assets new file mode 120000 index 0000000..bae6859 --- /dev/null +++ b/site/assets @@ -0,0 +1 @@ +../assets/
\ No newline at end of file diff --git a/site/blog-feed.xml b/site/blog-feed.xml new file mode 100644 index 0000000..75dad23 --- /dev/null +++ b/site/blog-feed.xml @@ -0,0 +1,243 @@ +<?xml version="1.0" encoding="utf-8"?> +<feed xmlns="http://www.w3.org/2005/Atom"> + <title type="text">Yuchen Pei's Blog</title> + <id>https://ypei.me/blog-feed.xml</id> + <updated>2017-08-07T00:00:00Z</updated> + <link href="https://ypei.me" /> + <link href="https://ypei.me/blog-feed.xml" rel="self" /> + <author> + <name>Yuchen Pei</name> + </author> + <generator>PyAtom</generator> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">The Mathematical Bazaar</title> + <id>posts/2017-08-07-mathematical_bazaar.html</id> + <updated>2017-08-07T00:00:00Z</updated> + <link href="posts/2017-08-07-mathematical_bazaar.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>In this essay I describe some problems in academia of mathematics and propose an open source model, which I call open research in mathematics.</p> +<p>This essay is a work in progress - comments and criticisms are welcome! <a href="#fn1" class="footnote-ref" id="fnref1"><sup>1</sup></a></p> +<p>Before I start I should point out that</p> +<ol type="1"> +<li>Open research is <em>not</em> open access. In fact the latter is a prerequisite to the former.</li> +<li>I am not proposing to replace the current academic model with the open model - I know academia works well for many people and I am happy for them, but I think an open research community is long overdue since the wide adoption of the World Wide Web more than two decades ago. In fact, I fail to see why an open model can not run in tandem with the academia, just like open source and closed source software development coexist today.</li> +</ol> +<h2 id="problems-of-academia">problems of academia</h2> +<p>Open source projects are characterised by publicly available source codes as well as open invitations for public collaborations, whereas closed source projects do not make source codes accessible to the public. How about mathematical academia then, is it open source or closed source? The answer is neither.</p> +<p>Compared to some other scientific disciplines, mathematics does not require expensive equipments or resources to replicate results; compared to programming in conventional software industry, mathematical findings are not meant to be commercial, as credits and reputation rather than money are the direct incentives (even though the former are commonly used to trade for the latter). It is also a custom and common belief that mathematical derivations and theorems shouldn't be patented. Because of this, mathematical research is an open source activity in the sense that proofs to new results are all available in papers, and thanks to open access e.g. the arXiv preprint repository most of the new mathematical knowledge is accessible for free.</p> +<p>Then why, you may ask, do I claim that maths research is not open sourced? Well, this is because 1. mathematical arguments are not easily replicable and 2. mathematical research projects are mostly not open for public participation.</p> +<p>Compared to computer programs, mathematical arguments are not written in an unambiguous language, and they are terse and not written in maximum verbosity (this is especially true in research papers as journals encourage limiting the length of submissions), so the understanding of a proof depends on whether the reader is equipped with the right background knowledge, and the completeness of a proof is highly subjective. More generally speaking, computer programs are mostly portable because all machines with the correct configurations can understand and execute a piece of program, whereas humans are subject to their environment, upbringings, resources etc. to have a brain ready to comprehend a proof that interests them. (these barriers are softer than the expensive equipments and resources in other scientific fields mentioned before because it is all about having access to the right information)</p> +<p>On the other hand, as far as the pursuit of reputation and prestige (which can be used to trade for the scarce resource of research positions and grant money) goes, there is often little practical motivation for career mathematicians to explain their results to the public carefully. And so the weird reality of the mathematical academia is that it is not an uncommon practice to keep trade secrets in order to protect one's territory and maintain a monopoly. This is doable because as long as a paper passes the opaque and sometimes political peer review process and is accepted by a journal, it is considered work done, accepted by the whole academic community and adds to the reputation of the author(s). Just like in the software industry, trade secrets and monopoly hinder the development of research as a whole, as well as demoralise outsiders who are interested in participating in related research.</p> +<p>Apart from trade secrets and territoriality, another reason to the nonexistence of open research community is an elitist tradition in the mathematical academia, which goes as follows:</p> +<ul> +<li>Whoever is not good at mathematics or does not possess a degree in maths is not eligible to do research, or else they run high risks of being labelled a crackpot.</li> +<li>Mistakes made by established mathematicians are more tolerable than those less established.</li> +<li>Good mathematical writings should be deep, and expositions of non-original results are viewed as inferior work and do not add to (and in some cases may even damage) one's reputation.</li> +</ul> +<p>All these customs potentially discourage public participations in mathematical research, and I do not see them easily go away unless an open source community gains momentum.</p> +<p>To solve the above problems, I propose a open source model of mathematical research, which has high levels of openness and transparency and also has some added benefits listed in the last section of this essay. This model tries to achieve two major goals:</p> +<ul> +<li>Open and public discussions and collaborations of mathematical research projects online</li> +<li>Open review to validate results, where author name, reviewer name, comments and responses are all publicly available online.</li> +</ul> +<p>To this end, a Github model is fitting. Let me first describe how open source collaboration works on Github.</p> +<h2 id="open-source-collaborations-on-github">open source collaborations on Github</h2> +<p>On <a href="https://github.com">Github</a>, every project is publicly available in a repository (we do not consider private repos). The owner can update the project by &quot;committing&quot; changes, which include a message of what has been changed, the author of the changes and a timestamp. Each project has an issue tracker, which is basically a discussion forum about the project, where anyone can open an issue (start a discussion), and the owner of the project as well as the original poster of the issue can close it if it is resolved, e.g. bug fixed, feature added, or out of the scope of the project. Closing the issue is like ending the discussion, except that the thread is still open to more posts for anyone interested. People can react to each issue post, e.g. upvote, downvote, celebration, and importantly, all the reactions are public too, so you can find out who upvoted or downvoted your post.</p> +<p>When one is interested in contributing code to a project, they fork it, i.e. make a copy of the project, and make the changes they like in the fork. Once they are happy with the changes, they submit a pull request to the original project. The owner of the original project may accept or reject the request, and they can comment on the code in the pull request, asking for clarification, pointing out problematic part of the code etc and the author of the pull request can respond to the comments. Anyone, not just the owner can participate in this review process, turning it into a public discussion. In fact, a pull request is a special issue thread. Once the owner is happy with the pull request, they accept it and the changes are merged into the original project. The author of the changes will show up in the commit history of the original project, so they get the credits.</p> +<p>As an alternative to forking, if one is interested in a project but has a different vision, or that the maintainer has stopped working on it, they can clone it and make their own version. This is a more independent kind of fork because there is no longer intention to contribute back to the original project.</p> +<p>Moreover, on Github there is no way to send private messages, which forces people to interact publicly. If say you want someone to see and reply to your comment in an issue post or pull request, you simply mention them by <code>@someone</code>.</p> +<h2 id="open-research-in-mathematics">open research in mathematics</h2> +<p>All this points to a promising direction of open research. A maths project may have a wiki / collection of notes, the paper being written, computer programs implementing the results etc. The issue tracker can serve as a discussion forum about the project as well as a platform for open review (bugs are analogous to mistakes, enhancements are possible ways of improving the main results etc.), and anyone can make their own version of the project, and (optionally) contribute back by making pull requests, which will also be openly reviewed. One may want to add an extra &quot;review this project&quot; functionality, so that people can comment on the original project like they do in a pull request. This may or may not be necessary, as anyone can make comments or point out mistakes in the issue tracker.</p> +<p>One may doubt this model due to concerns of credits because work in progress is available to anyone. Well, since all the contributions are trackable in project commit history and public discussions in issues and pull request reviews, there is in fact <em>less</em> room for cheating than the current model in academia, where scooping can happen without any witnesses. What we need is a platform with a good amount of trust like arXiv, so that the open research community honours (and can not ignore) the commit history, and the chance of mis-attribution can be reduced to minimum.</p> +<p>Compared to the academic model, open research also has the following advantages:</p> +<ul> +<li>Anyone in the world with Internet access will have a chance to participate in research, whether they are affiliated to a university, have the financial means to attend conferences, or are colleagues of one of the handful experts in a specific field.</li> +<li>The problem of replicating / understanding maths results will be solved, as people help each other out. This will also remove the burden of answering queries about one's research. For example, say one has a project &quot;Understanding the fancy results in [paper name]&quot;, they write up some initial notes but get stuck understanding certain arguments. In this case they can simply post the questions on the issue tracker, and anyone who knows the answer, or just has a speculation can participate in the discussion. In the end the problem may be resolved without the authors of the paper being bothered, who may be too busy to answer.</li> +<li>Similarly, the burden of peer review can also be shifted from a few appointed reviewers to the crowd.</li> +</ul> +<h2 id="related-readings">related readings</h2> +<ul> +<li><a href="http://www.catb.org/esr/writings/cathedral-bazaar/">The Cathedral and the Bazaar by Eric Raymond</a></li> +<li><a href="http://michaelnielsen.org/blog/doing-science-online/">Doing sience online by Michael Nielson</a></li> +<li><a href="https://gowers.wordpress.com/2009/01/27/is-massively-collaborative-mathematics-possible/">Is massively collaborative mathematics possible? by Timothy Gowers</a></li> +</ul> +<section class="footnotes"> +<hr /> +<ol> +<li id="fn1"><p>Please send your comments to my email address - I am still looking for ways to add a comment functionality to this website.<a href="#fnref1" class="footnote-back">↩</a></p></li> +</ol> +</section> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">Open mathematical research and launching toywiki</title> + <id>posts/2017-04-25-open_research_toywiki.html</id> + <updated>2017-04-25T00:00:00Z</updated> + <link href="posts/2017-04-25-open_research_toywiki.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>As an experimental project, I am launching toywiki.</p> +<p>It hosts a collection of my research notes.</p> +<p>It takes some ideas from the open source culture and apply them to mathematical research: 1. It uses a very permissive license (CC-BY-SA). For example anyone can fork the project and make their own version if they have a different vision and want to build upon the project. 2. All edits will done with maximum transparency, and discussions of any of notes should also be as public as possible (e.g. Github issues) 3. Anyone can suggest changes by opening issues and submitting pull requests</p> +<p>Here are the links: <a href="http://toywiki.xyz">toywiki</a> and <a href="https://github.com/ycpei/toywiki">github repo</a>.</p> +<p>Feedbacks are welcome by email.</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer</title> + <id>posts/2016-10-13-q-robinson-schensted-knuth-polymer.html</id> + <updated>2016-10-13T00:00:00Z</updated> + <link href="posts/2016-10-13-q-robinson-schensted-knuth-polymer.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>(Latest update: 2017-01-12) In <a href="http://arxiv.org/abs/1504.00666">Matveev-Petrov 2016</a> a \(q\)-deformed Robinson-Schensted-Knuth algorithm (\(q\)RSK) was introduced. In this article we give reformulations of this algorithm in terms of Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pair are swapped in a sense of distribution when the input matrix is transposed. We also formulate a \(q\)-polymer model based on the \(q\)RSK and prove the corresponding Burke property, which we use to show a strong law of large numbers for the partition function given stationary boundary conditions and \(q\)-geometric weights. We use the \(q\)-local moves to define a generalisation of the \(q\)RSK taking a Young diagram-shape of array as the input. We write down the joint distribution of partition functions in the space-like direction of the \(q\)-polymer in \(q\)-geometric environment, formulate a \(q\)-version of the multilayer polynuclear growth model (\(q\)PNG) and write down the joint distribution of the \(q\)-polymer partition functions at a fixed time.</p> +<p>This article is available at <a href="https://arxiv.org/abs/1610.03692">arXiv</a>. It seems to me that one difference between arXiv and Github is that on arXiv each preprint has a few versions only. In Github many projects have a “dev” branch hosting continuous updates, whereas the master branch is where the stable releases live.</p> +<p><a href="%7B%7B%20site.url%20%7D%7D/assets/resources/qrsklatest.pdf">Here</a> is a “dev” version of the article, which I shall push to arXiv when it stablises. Below is the changelog.</p> +<ul> +<li>2017-01-12: Typos and grammar, arXiv v2.</li> +<li>2016-12-20: Added remarks on the geometric \(q\)-pushTASEP. Added remarks on the converse of the Burke property. Added natural language description of the \(q\)RSK. Fixed typos.</li> +<li>2016-11-13: Fixed some typos in the proof of Theorem 3.</li> +<li>2016-11-07: Fixed some typos. The \(q\)-Burke property is now stated in a more symmetric way, so is the law of large numbers Theorem 2.</li> +<li>2016-10-20: Fixed a few typos. Updated some references. Added a reference: <a href="http://web.mit.edu/~shopkins/docs/rsk.pdf">a set of notes titled “RSK via local transformations”</a>. It is written by <a href="http://web.mit.edu/~shopkins/">Sam Hopkins</a> in 2014 as an expository article based on MIT combinatorics preseminar presentations of Alex Postnikov. It contains some idea (applying local moves to a general Young-diagram shaped array in the order that matches any growth sequence of the underlying Young diagram) which I thought I was the first one to write down.</li> +</ul> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">AMS review of 'Double Macdonald polynomials as the stable limit of Macdonald superpolynomials' by Blondeau-Fournier, Lapointe and Mathieu</title> + <id>posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html</id> + <updated>2015-07-15T00:00:00Z</updated> + <link href="posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>A Macdonald superpolynomial (introduced in [O. Blondeau-Fournier et al., Lett. Math. Phys. <span class="bf">101</span> (2012), no. 1, 27–47; <a href="http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&amp;s1=2935476&amp;loc=fromrevtext">MR2935476</a>; J. Comb. <span class="bf">3</span> (2012), no. 3, 495–561; <a href="http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&amp;s1=3029444&amp;loc=fromrevtext">MR3029444</a>]) in \(N\) Grassmannian variables indexed by a superpartition \(\Lambda\) is said to be stable if \({m (m + 1) \over 2} \ge |\Lambda|\) and \(N \ge |\Lambda| - {m (m - 3) \over 2}\) , where \(m\) is the fermionic degree. A stable Macdonald superpolynomial (corresponding to a bisymmetric polynomial) is also called a double Macdonald polynomial (dMp). The main result of this paper is the factorisation of a dMp into plethysms of two classical Macdonald polynomials (Theorem 5). Based on this result, this paper</p> +<ol type="1"> +<li><p>shows that the dMp has a unique decomposition into bisymmetric monomials;</p></li> +<li><p>calculates the norm of the dMp;</p></li> +<li><p>calculates the kernel of the Cauchy-Littlewood-type identity of the dMp;</p></li> +<li><p>shows the specialisation of the aforementioned factorisation to the Jack, Hall-Littlewood and Schur cases. One of the three Schur specialisations, denoted as \(s_{\lambda, \mu}\), also appears in (7) and (9) below;</p></li> +<li><p>defines the \(\omega\) -automorphism in this setting, which was used to prove an identity involving products of four Littlewood-Richardson coefficients;</p></li> +<li><p>shows an explicit evaluation of the dMp motivated by the most general evaluation of the usual Macdonald polynomials;</p></li> +<li><p>relates dMps with the representation theory of the hyperoctahedral group \(B_n\) via the double Kostka coefficients (which are defined as the entries of the transition matrix from the bisymmetric Schur functions \(s_{\lambda, \mu}\) to the modified dMps);</p></li> +<li><p>shows that the double Kostka coefficients have the positivity and the symmetry property, and can be written as sums of products of the usual Kostka coefficients;</p></li> +<li><p>defines an operator \(\nabla^B\) as an analogue of the nabla operator \(\nabla\) introduced in [F. Bergeron and A. M. Garsia, in <em>Algebraic methods and \(q\)-special functions</em> (Montréal, QC, 1996), 1–52, CRM Proc. Lecture Notes, 22, Amer. Math. Soc., Providence, RI, 1999; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&amp;pg1=MR&amp;s1=1726826&amp;loc=fromrevtext">MR1726826</a>]. The action of \(\nabla^B\) on the bisymmetric Schur function \(s_{\lambda, \mu}\) yields the dimension formula \((h + 1)^r\) for the corresponding representation of \(B_n\) , where \(h\) and \(r\) are the Coxeter number and the rank of \(B_n\) , in the same way that the action of \(\nabla\) on the \(n\) th elementary symmetric function leads to the same formula for the group of type \(A_n\) .</p></li> +</ol> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3306078, its copyright owned by the AMS.</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">On a causal quantum double product integral related to Lévy stochastic area.</title> + <id>posts/2015-07-01-causal-quantum-product-levy-area.html</id> + <updated>2015-07-01T00:00:00Z</updated> + <link href="posts/2015-07-01-causal-quantum-product-levy-area.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>In <a href="https://arxiv.org/abs/1506.04294">this paper</a> with <a href="http://homepages.lboro.ac.uk/~marh3/">Robin</a> we study the family of causal double product integrals \[ \prod_{a &lt; x &lt; y &lt; b}\left(1 + i{\lambda \over 2}(dP_x dQ_y - dQ_x dP_y) + i {\mu \over 2}(dP_x dP_y + dQ_x dQ_y)\right) \]</p> +<p>where <span class="math inline"><em>P</em></span> and <span class="math inline"><em>Q</em></span> are the mutually noncommuting momentum and position Brownian motions of quantum stochastic calculus. The evaluation is motivated heuristically by approximating the continuous double product by a discrete product in which infinitesimals are replaced by finite increments. The latter is in turn approximated by the second quantisation of a discrete double product of rotation-like operators in different planes due to a result in <a href="http://www.actaphys.uj.edu.pl/findarticle?series=Reg&amp;vol=46&amp;page=1851">(Hudson-Pei2015)</a>. The main problem solved in this paper is the explicit evaluation of the continuum limit <span class="math inline"><em>W</em></span> of the latter, and showing that <span class="math inline"><em>W</em></span> is a unitary operator. The kernel of <span class="math inline"><em>W</em></span> is written in terms of Bessel functions, and the evaluation is achieved by working on a lattice path model and enumerating linear extensions of related partial orderings, where the enumeration turns out to be heavily related to Dyck paths and generalisations of Catalan numbers.</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">AMS review of 'Infinite binary words containing repetitions of odd period' by Badkobeh and Crochemore</title> + <id>posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.html</id> + <updated>2015-05-30T00:00:00Z</updated> + <link href="posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>This paper is about the existence of pattern-avoiding infinite binary words, where the patterns are squares, cubes and \(3^+\)-powers. There are mainly two kinds of results, positive (existence of an infinite binary word avoiding a certain pattern) and negative (non-existence of such a word). Each positive result is proved by the construction of a word with finitely many squares and cubes which are listed explicitly. First a synchronising (also known as comma-free) uniform morphism \(g\: \Sigma_3^* \to \Sigma_2^*\)</p> +<p>is constructed. Then an argument is given to show that the length of squares in the code \(g(w)\) for a squarefree \(w\) is bounded, hence all the squares can be obtained by examining all \(g(s)\) for \(s\) of bounded lengths. The argument resembles that of the proof of, e.g., Theorem 1, Lemma 2, Theorem 3 and Lemma 4 in [N. Rampersad, J. O. Shallit and M. Wang, Theoret. Comput. Sci. <strong>339</strong> (2005), no. 1, 19–34; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&amp;pg1=MR&amp;s1=2142071&amp;loc=fromrevtext">MR2142071</a>]. The negative results are proved by traversing all possible finite words satisfying the conditions.</p> +<p> Let \(L(n_2, n_3, S)\) be the maximum length of a word with \(n_2\) distinct squares, \(n_3\) distinct cubes and that the periods of the squares can take values only in \(S\) , where \(n_2, n_3 \in \Bbb N \cup \{\infty, \omega\}\) and \(S \subset \Bbb N_+\) . \(n_k = 0\) corresponds to \(k\)-free, \(n_k = \infty\) means no restriction on the number of distinct \(k\)-powers, and \(n_k = \omega\) means \(k^+\)-free.</p> +<p> Below is the summary of the positive and negative results:</p> +<ol type="1"> +<li><p>(Negative) \(L(\infty, \omega, 2 \Bbb N) &lt; \infty\) : \(\nexists\) an infinite \(3^+\) -free binary word avoiding all squares of odd periods. (Proposition 1)</p></li> +<li><p>(Negative) \(L(\infty, 0, 2 \Bbb N + 1) \le 23\) : \(\nexists\) an infinite 3-free binary word, avoiding squares of even periods. The longest one has length \(\le 23\) (Proposition 2).</p></li> +<li>(Positive) \(L(\infty, \omega, 2 \Bbb N + +<ol type="1"> +<li><dl> +<dt>= \infty\)</dt> +<dd>\(\exists\) an infinite \(3^+\) -free binary word avoiding squares of even periods (Theorem 1). +</dd> +</dl></li> +</ol></li> +<li><p>(Positive) \(L(\infty, \omega, \{1, 3\}) = \infty\) : \(\exists\) an infinite \(3^+\) -free binary word containing only squares of period 1 or 3 (Theorem 2).</p></li> +<li><p>(Negative) \(L(6, 1, 2 \Bbb N + 1) = 57\) : \(\nexists\) an infinite binary word avoiding squares of even period containing \(&lt; 7\) squares and \(&lt; 2\) cubes. The longest one containing 6 squares and 1 cube has length 57 (Proposition 6).</p></li> +<li><p>(Positive) \(L(7, 1, 2 \Bbb N + 1) = \infty\) : \(\exists\) an infinite \(3^+\) -free binary word avoiding squares of even period with 1 cube and 7 squares (Theorem 3).</p></li> +<li><p>(Positive) \(L(4, 2, 2 \Bbb N + 1) = \infty\) : \(\exists\) an infinite \(3^+\) -free binary words avoiding squares of even period and containing 2 cubes and 4 squares (Theorem 4).</p></li> +</ol> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3313467, its copyright owned by the AMS.</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">jst</title> + <id>posts/2015-04-02-juggling-skill-tree.html</id> + <updated>2015-04-02T00:00:00Z</updated> + <link href="posts/2015-04-02-juggling-skill-tree.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>jst = juggling skill tree</p> +<p>If you have ever played a computer role playing game, you may have noticed the protagonist sometimes has a skill “tree” (most of the time it is actually a directed acyclic graph), where certain skills leads to others. For example, <a href="http://hydra-media.cursecdn.com/diablo.gamepedia.com/3/37/Sorceress_Skill_Trees_%28Diablo_II%29.png?version=b74b3d4097ef7ad4e26ebee0dcf33d01">here</a> is the skill tree of sorceress in <a href="https://en.wikipedia.org/wiki/Diablo_II">Diablo II</a>.</p> +<p>Now suppose our hero embarks on a quest for learning all the possible juggling patterns. Everyone would agree she should start with cascade, the simplest nontrivial 3-ball pattern, but what afterwards? A few other accessible patterns for beginners are juggler’s tennis, two in one and even reverse cascade, but what to learn after that? The encyclopeadic <a href="http://libraryofjuggling.com/">Library of Juggling</a> serves as a good guide, as it records more than 160 patterns, some of which very aesthetically appealing. On this website almost all the patterns have a “prerequisite” section, indicating what one should learn beforehand. I have therefore written a script using <a href="http://python.org">Python</a>, <a href="http://www.crummy.com/software/BeautifulSoup/">BeautifulSoup</a> and <a href="http://pygraphviz.github.io/">pygraphviz</a> to generate a jst (graded by difficulties, which is the leftmost column) from the Library of Juggling (click the image for the full size):</p> +<p><a href="../assets/resources/juggling.png"><img src="../assets/resources/juggling.png" alt="The juggling skill tree" style="width:38em" /></a></p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">Unitary causal quantum stochastic double products as universal interactions I</title> + <id>posts/2015-04-01-unitary-double-products.html</id> + <updated>2015-04-01T00:00:00Z</updated> + <link href="posts/2015-04-01-unitary-double-products.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>In <a href="http://www.actaphys.uj.edu.pl/findarticle?series=Reg&amp;vol=46&amp;page=1851">this paper</a> with <a href="http://homepages.lboro.ac.uk/~marh3/">Robin</a> we show the explicit formulae for a family of unitary triangular and rectangular double product integrals which can be described as second quantisations.</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">AMS review of 'A weighted interpretation for the super Catalan numbers' by Allen and Gheorghiciuc</title> + <id>posts/2015-01-20-weighted-interpretation-super-catalan-numbers.html</id> + <updated>2015-01-20T00:00:00Z</updated> + <link href="posts/2015-01-20-weighted-interpretation-super-catalan-numbers.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>The super Catalan numbers are defined as $$ T(m,n) = {(2 m)! (2 n)! 2 m! n! (m + n)!}. $$</p> +<p> This paper has two main results. First a combinatorial interpretation of the super Catalan numbers is given: $$ T(m,n) = P(m,n) - N(m,n) $$ where \(P(m,n)\) enumerates the number of 2-Motzkin paths whose \(m\) -th step begins at an even level (called \(m\)-positive paths) and \(N(m,n)\) those with \(m\)-th step beginning at an odd level (\(m\)-negative paths). The proof uses a recursive argument on the number of \(m\)-positive and -negative paths, based on a recursion of the super Catalan numbers appearing in [I. M. Gessel, J. Symbolic Comput. <strong>14</strong> (1992), no. 2-3, 179–194; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&amp;pg1=MR&amp;s1=1187230&amp;loc=fromrevtext">MR1187230</a>]: $$ 4T(m,n) = T(m+1, n) + T(m, n+1). $$ This result gives an expression for the super Catalan numbers in terms of numbers counting the so-called ballot paths. The latter sometimes are also referred to as the generalised Catalan numbers forming the entries of the Catalan triangle.</p> +<p> Based on the first result, the second result is a combinatorial interpretation of the super Catalan numbers \(T(2,n)\) in terms of counting certain Dyck paths. This is equivalent to a theorem, which represents \(T(2,n)\) as counting of certain pairs of Dyck paths, in [I. M. Gessel and G. Xin, J. Integer Seq. <strong>8</strong> (2005), no. 2, Article 05.2.3, 13 pp.; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&amp;pg1=MR&amp;s1=2134162&amp;loc=fromrevtext">MR2134162</a>], and the equivalence is explained at the end of the paper by a bijection between the Dyck paths and the pairs of Dyck paths. The proof of the theorem itself is also done by constructing two bijections between Dyck paths satisfying certain conditions. All the three bijections are formulated by locating, removing and adding steps.</p> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3275875, its copyright owned by the AMS.</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">Symmetry property of \(q\)-weighted Robinson-Schensted algorithms and branching algorithms</title> + <id>posts/2014-04-01-q-robinson-schensted-symmetry-paper.html</id> + <updated>2014-04-01T00:00:00Z</updated> + <link href="posts/2014-04-01-q-robinson-schensted-symmetry-paper.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>In <a href="http://link.springer.com/article/10.1007/s10801-014-0505-x">this paper</a> a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted algorithm has been shown for the \(q\)-weighted Robinson-Schensted algorithm. The proof uses a generalisation of the growth diagram approach introduced by Fomin. This approach, which uses “growth graphs”, can also be applied to a wider class of insertion algorithms which have a branching structure.</p> +<figure> +<img src="../assets/resources/1423graph.jpg" alt="Growth graph of q-RS for 1423" /><figcaption>Growth graph of q-RS for 1423</figcaption> +</figure> +<p>Above is the growth graph of the \(q\)-weighted Robinson-Schensted algorithm for the permutation \({1 2 3 4\choose1 4 2 3}\).</p> +</content> + </entry> + <entry xml:base="https://ypei.me/blog-feed.xml"> + <title type="text">A \(q\)-weighted Robinson-Schensted algorithm</title> + <id>posts/2013-06-01-q-robinson-schensted-paper.html</id> + <updated>2013-06-01T00:00:00Z</updated> + <link href="posts/2013-06-01-q-robinson-schensted-paper.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><p>In <a href="https://projecteuclid.org/euclid.ejp/1465064320">this paper</a> with <a href="http://www.bristol.ac.uk/maths/people/neil-m-oconnell/">Neil</a> we construct a \(q\)-version of the Robinson-Schensted algorithm with column insertion. Like the <a href="http://en.wikipedia.org/wiki/Robinson–Schensted_correspondence">usual RS correspondence</a> with column insertion, this algorithm could take words as input. Unlike the usual RS algorithm, the output is a set of weighted pairs of semistandard and standard Young tableaux \((P,Q)\) with the same shape. The weights are rational functions of indeterminant \(q\).</p> +<p>If \(q\in[0,1]\), the algorithm can be considered as a randomised RS algorithm, with 0 and 1 being two interesting cases. When \(q\to0\), it is reduced to the latter usual RS algorithm; while when \(q\to1\) with proper scaling it should scale to directed random polymer model in <a href="http://arxiv.org/abs/0910.0069">(O’Connell 2012)</a>. When the input word \(w\) is a random walk:</p> +<p>\begin{align*}\mathbb P(w=v)=\prod_{i=1}^na_{v_i},\qquad\sum_ja_j=1\end{align*}</p> +<p>the shape of output evolves as a Markov chain with kernel related to \(q\)-Whittaker functions, which are Macdonald functions when \(t=0\) with a factor.</p> +</content> + </entry> +</feed> diff --git a/site/blog.html b/site/blog.html new file mode 100644 index 0000000..4bfe026 --- /dev/null +++ b/site/blog.html @@ -0,0 +1,133 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Yuchen's Blog</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="blog.html">Yuchen's Blog</a> + </span> + <nav> + <a href="postlist.html">All posts</a><a href="index.html">About</a><a href="blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <a href="posts/2017-08-07-mathematical_bazaar.html"><h2> The Mathematical Bazaar </h2></a> + <p>Posted on 2017-08-07</p> + <p>In this essay I describe some problems in academia of mathematics and propose an open source model, which I call open research in mathematics.</p> +<p>This essay is a work in progress - comments and criticisms are welcome! <a href="#fn1" class="footnote-ref" id="fnref1"><sup>1</sup></a></p> +<p>Before I start I should point out that</p> +<ol type="1"> +<li>Open research is <em>not</em> open access. In fact the latter is a prerequisite to the former.</li> +<li>I am not proposing to replace the current academic model with the open model - I know academia works well for many people and I am happy for them, but I think an open research community is long overdue since the wide adoption of the World Wide Web more than two decades ago. In fact, I fail to see why an open model can not run in tandem with the academia, just like open source and closed source software development coexist today.</li> +</ol> +<h2 id="problems-of-academia">problems of academia</h2> +<p>Open source projects are characterised by publicly available source codes as well as open invitations for public collaborations, whereas closed source projects do not make source codes accessible to the public. How about mathematical academia then, is it open source or closed source? The answer is neither.</p> +<p>Compared to some other scientific disciplines, mathematics does not require expensive equipments or resources to replicate results; compared to programming in conventional software industry, mathematical findings are not meant to be commercial, as credits and reputation rather than money are the direct incentives (even though the former are commonly used to trade for the latter). It is also a custom and common belief that mathematical derivations and theorems shouldn't be patented. Because of this, mathematical research is an open source activity in the sense that proofs to new results are all available in papers, and thanks to open access e.g. the arXiv preprint repository most of the new mathematical knowledge is accessible for free.</p> +<p>Then why, you may ask, do I claim that maths research is not open sourced? Well, this is because 1. mathematical arguments are not easily replicable and 2. mathematical research projects are mostly not open for public participation.</p> +<p>Compared to computer programs, mathematical arguments are not written in an unambiguous language, and they are terse and not written in maximum verbosity (this is especially true in research papers as journals encourage limiting the length of submissions), so the understanding of a proof depends on whether the reader is equipped with the right background knowledge, and the completeness of a proof is highly subjective. More generally speaking, computer programs are mostly portable because all machines with the correct configurations can understand and execute a piece of program, whereas humans are subject to their environment, upbringings, resources etc. to have a brain ready to comprehend a proof that interests them. (these barriers are softer than the expensive equipments and resources in other scientific fields mentioned before because it is all about having access to the right information)</p> +<p>On the other hand, as far as the pursuit of reputation and prestige (which can be used to trade for the scarce resource of research positions and grant money) goes, there is often little practical motivation for career mathematicians to explain their results to the public carefully. And so the weird reality of the mathematical academia is that it is not an uncommon practice to keep trade secrets in order to protect one's territory and maintain a monopoly. This is doable because as long as a paper passes the opaque and sometimes political peer review process and is accepted by a journal, it is considered work done, accepted by the whole academic community and adds to the reputation of the author(s). Just like in the software industry, trade secrets and monopoly hinder the development of research as a whole, as well as demoralise outsiders who are interested in participating in related research.</p> +<p>Apart from trade secrets and territoriality, another reason to the nonexistence of open research community is an elitist tradition in the mathematical academia, which goes as follows:</p> +<ul> +<li>Whoever is not good at mathematics or does not possess a degree in maths is not eligible to do research, or else they run high risks of being labelled a crackpot.</li> +<li>Mistakes made by established mathematicians are more tolerable than those less established.</li> +<li>Good mathematical writings should be deep, and expositions of non-original results are viewed as inferior work and do not add to (and in some cases may even damage) one's reputation.</li> +</ul> +<p>All these customs potentially discourage public participations in mathematical research, and I do not see them easily go away unless an open source community gains momentum.</p> +<p>To solve the above problems, I propose a open source model of mathematical research, which has high levels of openness and transparency and also has some added benefits listed in the last section of this essay. This model tries to achieve two major goals:</p> +<ul> +<li>Open and public discussions and collaborations of mathematical research projects online</li> +<li>Open review to validate results, where author name, reviewer name, comments and responses are all publicly available online.</li> +</ul> +<p>To this end, a Github model is fitting. Let me first describe how open source collaboration works on Github.</p> +<h2 id="open-source-collaborations-on-github">open source collaborations on Github</h2> +<p>On <a href="https://github.com">Github</a>, every project is publicly available in a repository (we do not consider private repos). The owner can update the project by "committing" changes, which include a message of what has been changed, the author of the changes and a timestamp. Each project has an issue tracker, which is basically a discussion forum about the project, where anyone can open an issue (start a discussion), and the owner of the project as well as the original poster of the issue can close it if it is resolved, e.g. bug fixed, feature added, or out of the scope of the project. Closing the issue is like ending the discussion, except that the thread is still open to more posts for anyone interested. People can react to each issue post, e.g. upvote, downvote, celebration, and importantly, all the reactions are public too, so you can find out who upvoted or downvoted your post.</p> +<p>When one is interested in contributing code to a project, they fork it, i.e. make a copy of the project, and make the changes they like in the fork. Once they are happy with the changes, they submit a pull request to the original project. The owner of the original project may accept or reject the request, and they can comment on the code in the pull request, asking for clarification, pointing out problematic part of the code etc and the author of the pull request can respond to the comments. Anyone, not just the owner can participate in this review process, turning it into a public discussion. In fact, a pull request is a special issue thread. Once the owner is happy with the pull request, they accept it and the changes are merged into the original project. The author of the changes will show up in the commit history of the original project, so they get the credits.</p> +<p>As an alternative to forking, if one is interested in a project but has a different vision, or that the maintainer has stopped working on it, they can clone it and make their own version. This is a more independent kind of fork because there is no longer intention to contribute back to the original project.</p> +<p>Moreover, on Github there is no way to send private messages, which forces people to interact publicly. If say you want someone to see and reply to your comment in an issue post or pull request, you simply mention them by <code>@someone</code>.</p> +<h2 id="open-research-in-mathematics">open research in mathematics</h2> +<p>All this points to a promising direction of open research. A maths project may have a wiki / collection of notes, the paper being written, computer programs implementing the results etc. The issue tracker can serve as a discussion forum about the project as well as a platform for open review (bugs are analogous to mistakes, enhancements are possible ways of improving the main results etc.), and anyone can make their own version of the project, and (optionally) contribute back by making pull requests, which will also be openly reviewed. One may want to add an extra "review this project" functionality, so that people can comment on the original project like they do in a pull request. This may or may not be necessary, as anyone can make comments or point out mistakes in the issue tracker.</p> +<p>One may doubt this model due to concerns of credits because work in progress is available to anyone. Well, since all the contributions are trackable in project commit history and public discussions in issues and pull request reviews, there is in fact <em>less</em> room for cheating than the current model in academia, where scooping can happen without any witnesses. What we need is a platform with a good amount of trust like arXiv, so that the open research community honours (and can not ignore) the commit history, and the chance of mis-attribution can be reduced to minimum.</p> +<p>Compared to the academic model, open research also has the following advantages:</p> +<ul> +<li>Anyone in the world with Internet access will have a chance to participate in research, whether they are affiliated to a university, have the financial means to attend conferences, or are colleagues of one of the handful experts in a specific field.</li> +<li>The problem of replicating / understanding maths results will be solved, as people help each other out. This will also remove the burden of answering queries about one's research. For example, say one has a project "Understanding the fancy results in [paper name]", they write up some initial notes but get stuck understanding certain arguments. In this case they can simply post the questions on the issue tracker, and anyone who knows the answer, or just has a speculation can participate in the discussion. In the end the problem may be resolved without the authors of the paper being bothered, who may be too busy to answer.</li> +<li>Similarly, the burden of peer review can also be shifted from a few appointed reviewers to the crowd.</li> +</ul> +<h2 id="related-readings">related readings</h2> +<ul> +<li><a href="http://www.catb.org/esr/writings/cathedral-bazaar/">The Cathedral and the Bazaar by Eric Raymond</a></li> +<li><a href="http://michaelnielsen.org/blog/doing-science-online/">Doing sience online by Michael Nielson</a></li> +<li><a href="https://gowers.wordpress.com/2009/01/27/is-massively-collaborative-mathematics-possible/">Is massively collaborative mathematics possible? by Timothy Gowers</a></li> +</ul> +<section class="footnotes"> +<hr /> +<ol> +<li id="fn1"><p>Please send your comments to my email address - I am still looking for ways to add a comment functionality to this website.<a href="#fnref1" class="footnote-back">↩</a></p></li> +</ol> +</section> + +</div> +<div class="bodyitem"> + <a href="posts/2017-04-25-open_research_toywiki.html"><h2> Open mathematical research and launching toywiki </h2></a> + <p>Posted on 2017-04-25</p> + <p>As an experimental project, I am launching toywiki.</p> +<p>It hosts a collection of my research notes.</p> +<p>It takes some ideas from the open source culture and apply them to mathematical research: 1. It uses a very permissive license (CC-BY-SA). For example anyone can fork the project and make their own version if they have a different vision and want to build upon the project. 2. All edits will done with maximum transparency, and discussions of any of notes should also be as public as possible (e.g. Github issues) 3. Anyone can suggest changes by opening issues and submitting pull requests</p> +<p>Here are the links: <a href="http://toywiki.xyz">toywiki</a> and <a href="https://github.com/ycpei/toywiki">github repo</a>.</p> +<p>Feedbacks are welcome by email.</p> + +</div> +<div class="bodyitem"> + <a href="posts/2016-10-13-q-robinson-schensted-knuth-polymer.html"><h2> A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer </h2></a> + <p>Posted on 2016-10-13</p> + <p>(Latest update: 2017-01-12) In <a href="http://arxiv.org/abs/1504.00666">Matveev-Petrov 2016</a> a \(q\)-deformed Robinson-Schensted-Knuth algorithm (\(q\)RSK) was introduced. In this article we give reformulations of this algorithm in terms of Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pair are swapped in a sense of distribution when the input matrix is transposed. We also formulate a \(q\)-polymer model based on the \(q\)RSK and prove the corresponding Burke property, which we use to show a strong law of large numbers for the partition function given stationary boundary conditions and \(q\)-geometric weights. We use the \(q\)-local moves to define a generalisation of the \(q\)RSK taking a Young diagram-shape of array as the input. We write down the joint distribution of partition functions in the space-like direction of the \(q\)-polymer in \(q\)-geometric environment, formulate a \(q\)-version of the multilayer polynuclear growth model (\(q\)PNG) and write down the joint distribution of the \(q\)-polymer partition functions at a fixed time.</p> +<p>This article is available at <a href="https://arxiv.org/abs/1610.03692">arXiv</a>. It seems to me that one difference between arXiv and Github is that on arXiv each preprint has a few versions only. In Github many projects have a “dev” branch hosting continuous updates, whereas the master branch is where the stable releases live.</p> +<p><a href="%7B%7B%20site.url%20%7D%7D/assets/resources/qrsklatest.pdf">Here</a> is a “dev” version of the article, which I shall push to arXiv when it stablises. Below is the changelog.</p> +<ul> +<li>2017-01-12: Typos and grammar, arXiv v2.</li> +<li>2016-12-20: Added remarks on the geometric \(q\)-pushTASEP. Added remarks on the converse of the Burke property. Added natural language description of the \(q\)RSK. Fixed typos.</li> +<li>2016-11-13: Fixed some typos in the proof of Theorem 3.</li> +<li>2016-11-07: Fixed some typos. The \(q\)-Burke property is now stated in a more symmetric way, so is the law of large numbers Theorem 2.</li> +<li>2016-10-20: Fixed a few typos. Updated some references. Added a reference: <a href="http://web.mit.edu/~shopkins/docs/rsk.pdf">a set of notes titled “RSK via local transformations”</a>. It is written by <a href="http://web.mit.edu/~shopkins/">Sam Hopkins</a> in 2014 as an expository article based on MIT combinatorics preseminar presentations of Alex Postnikov. It contains some idea (applying local moves to a general Young-diagram shaped array in the order that matches any growth sequence of the underlying Young diagram) which I thought I was the first one to write down.</li> +</ul> + +</div> +<div class="bodyitem"> + <a href="posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html"><h2> AMS review of 'Double Macdonald polynomials as the stable limit of Macdonald superpolynomials' by Blondeau-Fournier, Lapointe and Mathieu </h2></a> + <p>Posted on 2015-07-15</p> + <p>A Macdonald superpolynomial (introduced in [O. Blondeau-Fournier et al., Lett. Math. Phys. <span class="bf">101</span> (2012), no. 1, 27–47; <a href="http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=2935476&loc=fromrevtext">MR2935476</a>; J. Comb. <span class="bf">3</span> (2012), no. 3, 495–561; <a href="http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=3029444&loc=fromrevtext">MR3029444</a>]) in \(N\) Grassmannian variables indexed by a superpartition \(\Lambda\) is said to be stable if \({m (m + 1) \over 2} \ge |\Lambda|\) and \(N \ge |\Lambda| - {m (m - 3) \over 2}\) , where \(m\) is the fermionic degree. A stable Macdonald superpolynomial (corresponding to a bisymmetric polynomial) is also called a double Macdonald polynomial (dMp). The main result of this paper is the factorisation of a dMp into plethysms of two classical Macdonald polynomials (Theorem 5). Based on this result, this paper</p> +<ol type="1"> +<li><p>shows that the dMp has a unique decomposition into bisymmetric monomials;</p></li> +<li><p>calculates the norm of the dMp;</p></li> +<li><p>calculates the kernel of the Cauchy-Littlewood-type identity of the dMp;</p></li> +<li><p>shows the specialisation of the aforementioned factorisation to the Jack, Hall-Littlewood and Schur cases. One of the three Schur specialisations, denoted as \(s_{\lambda, \mu}\), also appears in (7) and (9) below;</p></li> +<li><p>defines the \(\omega\) -automorphism in this setting, which was used to prove an identity involving products of four Littlewood-Richardson coefficients;</p></li> +<li><p>shows an explicit evaluation of the dMp motivated by the most general evaluation of the usual Macdonald polynomials;</p></li> +<li><p>relates dMps with the representation theory of the hyperoctahedral group \(B_n\) via the double Kostka coefficients (which are defined as the entries of the transition matrix from the bisymmetric Schur functions \(s_{\lambda, \mu}\) to the modified dMps);</p></li> +<li><p>shows that the double Kostka coefficients have the positivity and the symmetry property, and can be written as sums of products of the usual Kostka coefficients;</p></li> +<li><p>defines an operator \(\nabla^B\) as an analogue of the nabla operator \(\nabla\) introduced in [F. Bergeron and A. M. Garsia, in <em>Algebraic methods and \(q\)-special functions</em> (Montréal, QC, 1996), 1–52, CRM Proc. Lecture Notes, 22, Amer. Math. Soc., Providence, RI, 1999; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=1726826&loc=fromrevtext">MR1726826</a>]. The action of \(\nabla^B\) on the bisymmetric Schur function \(s_{\lambda, \mu}\) yields the dimension formula \((h + 1)^r\) for the corresponding representation of \(B_n\) , where \(h\) and \(r\) are the Coxeter number and the rank of \(B_n\) , in the same way that the action of \(\nabla\) on the \(n\) th elementary symmetric function leads to the same formula for the group of type \(A_n\) .</p></li> +</ol> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3306078, its copyright owned by the AMS.</p> + +</div> +<div class="bodyitem"> + <a href="posts/2015-07-01-causal-quantum-product-levy-area.html"><h2> On a causal quantum double product integral related to Lévy stochastic area. </h2></a> + <p>Posted on 2015-07-01</p> + <p>In <a href="https://arxiv.org/abs/1506.04294">this paper</a> with <a href="http://homepages.lboro.ac.uk/~marh3/">Robin</a> we study the family of causal double product integrals \[ \prod_{a < x < y < b}\left(1 + i{\lambda \over 2}(dP_x dQ_y - dQ_x dP_y) + i {\mu \over 2}(dP_x dP_y + dQ_x dQ_y)\right) \]</p> +<p>where <span class="math inline"><em>P</em></span> and <span class="math inline"><em>Q</em></span> are the mutually noncommuting momentum and position Brownian motions of quantum stochastic calculus. The evaluation is motivated heuristically by approximating the continuous double product by a discrete product in which infinitesimals are replaced by finite increments. The latter is in turn approximated by the second quantisation of a discrete double product of rotation-like operators in different planes due to a result in <a href="http://www.actaphys.uj.edu.pl/findarticle?series=Reg&vol=46&page=1851">(Hudson-Pei2015)</a>. The main problem solved in this paper is the explicit evaluation of the continuum limit <span class="math inline"><em>W</em></span> of the latter, and showing that <span class="math inline"><em>W</em></span> is a unitary operator. The kernel of <span class="math inline"><em>W</em></span> is written in terms of Bessel functions, and the evaluation is achieved by working on a lattice path model and enumerating linear extensions of related partial orderings, where the enumeration turns out to be heavily related to Dyck paths and generalisations of Catalan numbers.</p> + +</div> + + <div class="bodyitem"> + <p><a href="postlist.html">older posts</a></p> + </div> + </div> + </body> +</html> diff --git a/site/index.html b/site/index.html new file mode 100644 index 0000000..e9ce29f --- /dev/null +++ b/site/index.html @@ -0,0 +1,32 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Yuchen Pei</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="index.html">Yuchen Pei</a> + </span> + <nav> + <a href="blog.html">Blog</a><a href="microblog.html">Microblog</a><a href="links.html">Links</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <p>Yuchen is a postdoctoral researcher in the <a href="https://www.math.kth.se/RMSMA/">KTH RMSMA group</a>. Before KTH he did PhD in the <a href="https://warwick.ac.uk/fac/sci/masdoc">MASDOC program at Warwick</a>, and spent two years in a postdoc position in <a href="http://cmsa.fas.harvard.edu">CMSA at Harvard</a>.</p> +<p>He is interested in machine learning and functional programming.</p> +<p>He is also interested in the idea of open research and open sourced his research in Robinson-Schensted algorithms as a <a href="https://toywiki.xyz">wiki</a>.</p> +<p>He can be reached at: hi@ypei.me | <a href="https://github.com/ycpei">Github</a> | <a href="https://www.linkedin.com/in/ycpei/">LinkedIn</a> | <a href="https://twitter.com/_ypei">Twitter</a></p> +<p>This website is made using a handmade static site generator.</p> +<p>Unless otherwise specified, all contents on this website are licensed under <a href="https://creativecommons.org/licenses/by-nd/4.0/">Creative Commons Attribution-NoDerivatives 4.0 International License</a>.</p> + + </div> + </div> + + </body> +</html> diff --git a/site/links.html b/site/links.html new file mode 100644 index 0000000..9b03c14 --- /dev/null +++ b/site/links.html @@ -0,0 +1,82 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Links</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="index.html">Yuchen Pei</a> + </span> + <nav> + <a href="blog.html">Blog</a><a href="microblog.html">Microblog</a><a href="links.html">Links</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <p>Here are some links I find interesting or helpful, or both. Listed in no particular order.</p> +<ul> +<li><a href="https://haskellformaths.blogspot.com/">HaskellForMaths</a></li> +<li><a href="http://www.openproblemgarden.org/">Open Problem Garden</a></li> +<li><a href="http://www.ams.org/open-math-notes">AMS open notes</a></li> +<li><a href="http://garsia.math.yorku.ca/MPWP/">Macdonald polynomials webpage</a></li> +<li><a href="https://news.ycombinator.com/">Hacker News</a></li> +<li><a href="http://arminstraub.com/">Armin Straub</a></li> +<li><a href="http://www-math.ucdenver.edu/~wcherowi/">Bill Cherowitzo</a></li> +<li><a href="https://stallman.org/">Richard Stallman</a></li> +<li><a href="http://www.aaronsw.com/">Aaron Swartz</a> - The Internet’s own boy</li> +<li><a href="https://docs.google.com/document/d/10eA5-mCZLSS4MQY5QGb5ewC3VAL6pLkT53V_81ZyitM/preview">False, Misleading, Clickbait-y, and/or Satirical “News” Sources</a></li> +<li><a href="http://www.math.utah.edu/~jasonu/deala/">Differential Equations & Linear Algebra</a> - Lecture notes on the web</li> +<li><a href="http://wstein.org/">William Stein</a> - William Stein, the creator of SageMath +<ul> +<li><a href="http://wstein.org/talks/2016-06-sage-bp/">The origins of SageMath</a> Stein’s BP centenary talk at Harvard</li> +</ul></li> +<li><a href="http://www.sagemath.org/">SageMath</a> - Open-source maths software system<br /> +</li> +<li><a href="https://projecteuler.net/">Project Euler</a></li> +<li><a href="https://blockly-games.appspot.com/about?lang=en">Blockly games</a></li> +<li><a href="https://jeremykun.com/">Math ∩ Programming</a></li> +<li><a href="https://www.authorea.com/">Authorea</a></li> +<li><a href="http://bigdata.show">Big Data</a></li> +<li><a href="http://fermatslibrary.com/">Fermat’s Library</a></li> +<li><a href="http://www.tricki.org/">Tricki</a></li> +<li><a href="http://www.ams.org/samplings/feature-column/fc-current.cgi">AMS Feature Column</a></li> +<li><a href="https://arxiv.org">arXiv</a></li> +<li><a href="https://terrytao.wordpress.com/">What’s new</a> - Terence Tao’s blog</li> +<li><a href="https://gowers.wordpress.com/">Gowers’s weblog</a> - Timothy Gowers’s blog</li> +<li><a href="http://michaelnielsen.org/polymath1/index.php?title=Main_Page">Polymath</a> - MMO maths research</li> +<li><a href="https://oeis.org/">OEIS</a> - The On-Line Encyclopedia of Integer Sequences® (OEIS®)</li> +<li><a href="http://www.vim.org">Vi IMproved</a> - the one true text editor. Plugins: +<ul> +<li><a href="http://vim-latex.sourceforge.net/">vim-latex</a> - for latexing</li> +<li><a href="https://code.google.com/p/vimwiki/">vimwiki</a> - a wiki tool with google wiki-like markup</li> +<li><a href="https://github.com/Shougo/neocomplete.vim">neocomplete</a> - for auto-completion</li> +</ul></li> +<li><a href="http://www.vimperator.org/vimperator">vimperator</a> - turn your Firefox into Vim</li> +<li><a href="http://www.vimperator.org/muttator">muttator</a> - turn your Thunderbird into Vim</li> +<li><a href="http://pwmt.org/projects/zathura/">zathura</a> - turn your pdf reader into Vim</li> +<li><a href="https://i3wm.org/">i3wm</a> - turn your window manager into Vim</li> +<li><a href="http://www.vimgolf.com/">VimGolf</a></li> +<li><a href="http://regex.alf.nu/">Regex Golf</a></li> +<li><a href="http://regexcrossword.com/">Regex Crossword</a></li> +<li><a href="http://archlinux.org">Arch Linux</a></li> +<li><a href="https://jupyter.org/">Jupyter notebook</a> - An open-source notebook</li> +<li>Stackexchange sites +<ul> +<li><a href="https://mathoverflow.net/">Mathoverflow</a></li> +<li><a href="https://math.stackexchange.com/">Mathematics</a></li> +<li><a href="https://codegolf.stackexchange.com/">Codegolf</a> - The most fun corner of Stackexchange.</li> +</ul></li> +<li><a href="http://math.stanford.edu/~bump/">Danial Bump</a></li> +<li><a href="http://www.math.ubc.ca/~cass/">Bill Casselman</a></li> +</ul> + + </div> + </div> + + </body> +</html> diff --git a/site/microblog-feed.xml b/site/microblog-feed.xml new file mode 100644 index 0000000..79d1dbc --- /dev/null +++ b/site/microblog-feed.xml @@ -0,0 +1,48 @@ +<?xml version="1.0" encoding="utf-8"?> +<feed xmlns="http://www.w3.org/2005/Atom"> + <title type="text">Yuchen Pei's Microblog</title> + <id>https://ypei.me/microblog-feed.xml</id> + <updated>2018-04-06T00:00:00Z</updated> + <link href="https://ypei.me" /> + <link href="https://ypei.me/microblog-feed.xml" rel="self" /> + <author> + <name>Yuchen Pei</name> + </author> + <generator>PyAtom</generator> + <entry xml:base="https://ypei.me/microblog-feed.xml"> + <title type="text">2018-04-06</title> + <id>microblog.html</id> + <updated>2018-04-06T00:00:00Z</updated> + <link href="microblog.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><blockquote> +<ul> +<li>Access to computers—and anything that might teach you something about the way the world works—should be unlimited and total. Always yield to the Hands-On Imperative!</li> +<li>All information should be free.</li> +<li>Mistrust Authority—Promote Decentralization.</li> +<li>Hackers should be judged by their hacking, not bogus criteria such as degrees, age, race, or position.</li> +<li>You can create art and beauty on a computer.</li> +<li>Computers can change your life for the better.</li> +</ul> +</blockquote> +<p><a href="https://en.wikipedia.org/wiki/Hacker_ethic">The Hacker Ethic</a>, <a href="https://en.wikipedia.org/wiki/Hackers:_Heroes_of_the_Computer_Revolution">Hackers: Heroes of Computer Revolution</a>, by Steven Levy</p> +</content> + </entry> + <entry xml:base="https://ypei.me/microblog-feed.xml"> + <title type="text">2018-03-23</title> + <id>microblog.html</id> + <updated>2018-03-23T00:00:00Z</updated> + <link href="microblog.html" /> + <author> + <name>Yuchen Pei</name> + </author> + <content type="html"><blockquote> +<p>“Static site generators seem like music databases, in that everyone eventually writes their own crappy one that just barely scratches the itch they had (and I’m no exception).”</p> +</blockquote> +<p><a href="https://news.ycombinator.com/item?id=7747651">__david__@hackernews</a></p> +<p>So did I.</p> +</content> + </entry> +</feed> diff --git a/site/microblog.html b/site/microblog.html new file mode 100644 index 0000000..94cab80 --- /dev/null +++ b/site/microblog.html @@ -0,0 +1,48 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Yuchen's Microblog</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="microblog.html">Yuchen's Microblog</a> + </span> + <nav> + <a href="index.html">About</a><a href="microblog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <p>2018-04-06</p> + <blockquote> +<ul> +<li>Access to computers—and anything that might teach you something about the way the world works—should be unlimited and total. Always yield to the Hands-On Imperative!</li> +<li>All information should be free.</li> +<li>Mistrust Authority—Promote Decentralization.</li> +<li>Hackers should be judged by their hacking, not bogus criteria such as degrees, age, race, or position.</li> +<li>You can create art and beauty on a computer.</li> +<li>Computers can change your life for the better.</li> +</ul> +</blockquote> +<p><a href="https://en.wikipedia.org/wiki/Hacker_ethic">The Hacker Ethic</a>, <a href="https://en.wikipedia.org/wiki/Hackers:_Heroes_of_the_Computer_Revolution">Hackers: Heroes of Computer Revolution</a>, by Steven Levy</p> + +</div> +<div class="bodyitem"> + <p>2018-03-23</p> + <blockquote> +<p>“Static site generators seem like music databases, in that everyone eventually writes their own crappy one that just barely scratches the itch they had (and I’m no exception).”</p> +</blockquote> +<p><a href="https://news.ycombinator.com/item?id=7747651">__david__@hackernews</a></p> +<p>So did I.</p> + +</div> + + </div> + + </body> +</html> diff --git a/site/postlist.html b/site/postlist.html new file mode 100644 index 0000000..9843665 --- /dev/null +++ b/site/postlist.html @@ -0,0 +1,63 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>All posts</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.9.0/katex.min.css" integrity="sha384-TEMocfGvRuD1rIAacqrknm5BQZ7W7uWitoih+jMNFXQIbNl16bO8OZmylH/Vi/Ei" crossorigin="anonymous"> + <script src="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.9.0/katex.min.js" integrity="sha384-jmxIlussZWB7qCuB+PgKG1uLjjxbVVIayPJwi6cG6Zb4YKq0JIw+OMnkkEC7kYCq" crossorigin="anonymous"></script> + <script src="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.9.0/contrib/auto-render.min.js" integrity="sha384-IiI65aU9ZYub2MY9zhtKd1H2ps7xxf+eb2YFG9lX6uRqpXCvBTOidPRCXCrQ++Uc" crossorigin="anonymous"></script> + <script> document.addEventListener("DOMContentLoaded", function() { renderMathInElement(document.body); }); </script> + </head> + <body> + <header> + <span class="logo"> + <a href="blog.html">Yuchen's Blog</a> + </span> + <nav> + <a>All posts</a><a href="index.html">About</a><a href="blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <ul class="postlist"> + <li class="postlistitem"> + <a href="posts/2017-08-07-mathematical_bazaar.html">The Mathematical Bazaar</a> - 2017-08-07 +</li> +<li class="postlistitem"> + <a href="posts/2017-04-25-open_research_toywiki.html">Open mathematical research and launching toywiki</a> - 2017-04-25 +</li> +<li class="postlistitem"> + <a href="posts/2016-10-13-q-robinson-schensted-knuth-polymer.html">A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer</a> - 2016-10-13 +</li> +<li class="postlistitem"> + <a href="posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html">AMS review of 'Double Macdonald polynomials as the stable limit of Macdonald superpolynomials' by Blondeau-Fournier, Lapointe and Mathieu</a> - 2015-07-15 +</li> +<li class="postlistitem"> + <a href="posts/2015-07-01-causal-quantum-product-levy-area.html">On a causal quantum double product integral related to Lévy stochastic area.</a> - 2015-07-01 +</li> +<li class="postlistitem"> + <a href="posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.html">AMS review of 'Infinite binary words containing repetitions of odd period' by Badkobeh and Crochemore</a> - 2015-05-30 +</li> +<li class="postlistitem"> + <a href="posts/2015-04-02-juggling-skill-tree.html">jst</a> - 2015-04-02 +</li> +<li class="postlistitem"> + <a href="posts/2015-04-01-unitary-double-products.html">Unitary causal quantum stochastic double products as universal interactions I</a> - 2015-04-01 +</li> +<li class="postlistitem"> + <a href="posts/2015-01-20-weighted-interpretation-super-catalan-numbers.html">AMS review of 'A weighted interpretation for the super Catalan numbers' by Allen and Gheorghiciuc</a> - 2015-01-20 +</li> +<li class="postlistitem"> + <a href="posts/2014-04-01-q-robinson-schensted-symmetry-paper.html">Symmetry property of \(q\)-weighted Robinson-Schensted algorithms and branching algorithms</a> - 2014-04-01 +</li> +<li class="postlistitem"> + <a href="posts/2013-06-01-q-robinson-schensted-paper.html">A \(q\)-weighted Robinson-Schensted algorithm</a> - 2013-06-01 +</li> + + </ul> + </div> + </div> + </body> +</html> diff --git a/site/posts/2013-06-01-q-robinson-schensted-paper.html b/site/posts/2013-06-01-q-robinson-schensted-paper.html new file mode 100644 index 0000000..b8f9e3d --- /dev/null +++ b/site/posts/2013-06-01-q-robinson-schensted-paper.html @@ -0,0 +1,31 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>A \(q\)-weighted Robinson-Schensted algorithm</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> A \(q\)-weighted Robinson-Schensted algorithm </h2> + <p>Posted on 2013-06-01</p> + <p>In <a href="https://projecteuclid.org/euclid.ejp/1465064320">this paper</a> with <a href="http://www.bristol.ac.uk/maths/people/neil-m-oconnell/">Neil</a> we construct a \(q\)-version of the Robinson-Schensted algorithm with column insertion. Like the <a href="http://en.wikipedia.org/wiki/Robinson–Schensted_correspondence">usual RS correspondence</a> with column insertion, this algorithm could take words as input. Unlike the usual RS algorithm, the output is a set of weighted pairs of semistandard and standard Young tableaux \((P,Q)\) with the same shape. The weights are rational functions of indeterminant \(q\).</p> +<p>If \(q\in[0,1]\), the algorithm can be considered as a randomised RS algorithm, with 0 and 1 being two interesting cases. When \(q\to0\), it is reduced to the latter usual RS algorithm; while when \(q\to1\) with proper scaling it should scale to directed random polymer model in <a href="http://arxiv.org/abs/0910.0069">(O’Connell 2012)</a>. When the input word \(w\) is a random walk:</p> +<p>\begin{align*}\mathbb P(w=v)=\prod_{i=1}^na_{v_i},\qquad\sum_ja_j=1\end{align*}</p> +<p>the shape of output evolves as a Markov chain with kernel related to \(q\)-Whittaker functions, which are Macdonald functions when \(t=0\) with a factor.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2014-04-01-q-robinson-schensted-symmetry-paper.html b/site/posts/2014-04-01-q-robinson-schensted-symmetry-paper.html new file mode 100644 index 0000000..b262b20 --- /dev/null +++ b/site/posts/2014-04-01-q-robinson-schensted-symmetry-paper.html @@ -0,0 +1,32 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Symmetry property of \(q\)-weighted Robinson-Schensted algorithms and branching algorithms</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> Symmetry property of \(q\)-weighted Robinson-Schensted algorithms and branching algorithms </h2> + <p>Posted on 2014-04-01</p> + <p>In <a href="http://link.springer.com/article/10.1007/s10801-014-0505-x">this paper</a> a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted algorithm has been shown for the \(q\)-weighted Robinson-Schensted algorithm. The proof uses a generalisation of the growth diagram approach introduced by Fomin. This approach, which uses “growth graphs”, can also be applied to a wider class of insertion algorithms which have a branching structure.</p> +<figure> +<img src="../assets/resources/1423graph.jpg" alt="Growth graph of q-RS for 1423" /><figcaption>Growth graph of q-RS for 1423</figcaption> +</figure> +<p>Above is the growth graph of the \(q\)-weighted Robinson-Schensted algorithm for the permutation \({1 2 3 4\choose1 4 2 3}\).</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2015-01-20-weighted-interpretation-super-catalan-numbers.html b/site/posts/2015-01-20-weighted-interpretation-super-catalan-numbers.html new file mode 100644 index 0000000..7a292f4 --- /dev/null +++ b/site/posts/2015-01-20-weighted-interpretation-super-catalan-numbers.html @@ -0,0 +1,31 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>AMS review of 'A weighted interpretation for the super Catalan numbers' by Allen and Gheorghiciuc</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> AMS review of 'A weighted interpretation for the super Catalan numbers' by Allen and Gheorghiciuc </h2> + <p>Posted on 2015-01-20</p> + <p>The super Catalan numbers are defined as $$ T(m,n) = {(2 m)! (2 n)! 2 m! n! (m + n)!}. $$</p> +<p> This paper has two main results. First a combinatorial interpretation of the super Catalan numbers is given: $$ T(m,n) = P(m,n) - N(m,n) $$ where \(P(m,n)\) enumerates the number of 2-Motzkin paths whose \(m\) -th step begins at an even level (called \(m\)-positive paths) and \(N(m,n)\) those with \(m\)-th step beginning at an odd level (\(m\)-negative paths). The proof uses a recursive argument on the number of \(m\)-positive and -negative paths, based on a recursion of the super Catalan numbers appearing in [I. M. Gessel, J. Symbolic Comput. <strong>14</strong> (1992), no. 2-3, 179–194; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=1187230&loc=fromrevtext">MR1187230</a>]: $$ 4T(m,n) = T(m+1, n) + T(m, n+1). $$ This result gives an expression for the super Catalan numbers in terms of numbers counting the so-called ballot paths. The latter sometimes are also referred to as the generalised Catalan numbers forming the entries of the Catalan triangle.</p> +<p> Based on the first result, the second result is a combinatorial interpretation of the super Catalan numbers \(T(2,n)\) in terms of counting certain Dyck paths. This is equivalent to a theorem, which represents \(T(2,n)\) as counting of certain pairs of Dyck paths, in [I. M. Gessel and G. Xin, J. Integer Seq. <strong>8</strong> (2005), no. 2, Article 05.2.3, 13 pp.; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=2134162&loc=fromrevtext">MR2134162</a>], and the equivalence is explained at the end of the paper by a bijection between the Dyck paths and the pairs of Dyck paths. The proof of the theorem itself is also done by constructing two bijections between Dyck paths satisfying certain conditions. All the three bijections are formulated by locating, removing and adding steps.</p> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3275875, its copyright owned by the AMS.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2015-04-01-unitary-double-products.html b/site/posts/2015-04-01-unitary-double-products.html new file mode 100644 index 0000000..1787246 --- /dev/null +++ b/site/posts/2015-04-01-unitary-double-products.html @@ -0,0 +1,28 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Unitary causal quantum stochastic double products as universal interactions I</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> Unitary causal quantum stochastic double products as universal interactions I </h2> + <p>Posted on 2015-04-01</p> + <p>In <a href="http://www.actaphys.uj.edu.pl/findarticle?series=Reg&vol=46&page=1851">this paper</a> with <a href="http://homepages.lboro.ac.uk/~marh3/">Robin</a> we show the explicit formulae for a family of unitary triangular and rectangular double product integrals which can be described as second quantisations.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2015-04-02-juggling-skill-tree.html b/site/posts/2015-04-02-juggling-skill-tree.html new file mode 100644 index 0000000..598d80a --- /dev/null +++ b/site/posts/2015-04-02-juggling-skill-tree.html @@ -0,0 +1,31 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>jst</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> jst </h2> + <p>Posted on 2015-04-02</p> + <p>jst = juggling skill tree</p> +<p>If you have ever played a computer role playing game, you may have noticed the protagonist sometimes has a skill “tree” (most of the time it is actually a directed acyclic graph), where certain skills leads to others. For example, <a href="http://hydra-media.cursecdn.com/diablo.gamepedia.com/3/37/Sorceress_Skill_Trees_%28Diablo_II%29.png?version=b74b3d4097ef7ad4e26ebee0dcf33d01">here</a> is the skill tree of sorceress in <a href="https://en.wikipedia.org/wiki/Diablo_II">Diablo II</a>.</p> +<p>Now suppose our hero embarks on a quest for learning all the possible juggling patterns. Everyone would agree she should start with cascade, the simplest nontrivial 3-ball pattern, but what afterwards? A few other accessible patterns for beginners are juggler’s tennis, two in one and even reverse cascade, but what to learn after that? The encyclopeadic <a href="http://libraryofjuggling.com/">Library of Juggling</a> serves as a good guide, as it records more than 160 patterns, some of which very aesthetically appealing. On this website almost all the patterns have a “prerequisite” section, indicating what one should learn beforehand. I have therefore written a script using <a href="http://python.org">Python</a>, <a href="http://www.crummy.com/software/BeautifulSoup/">BeautifulSoup</a> and <a href="http://pygraphviz.github.io/">pygraphviz</a> to generate a jst (graded by difficulties, which is the leftmost column) from the Library of Juggling (click the image for the full size):</p> +<p><a href="../assets/resources/juggling.png"><img src="../assets/resources/juggling.png" alt="The juggling skill tree" style="width:38em" /></a></p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.html b/site/posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.html new file mode 100644 index 0000000..962b102 --- /dev/null +++ b/site/posts/2015-05-30-infinite-binary-words-containing-repetitions-odd-periods.html @@ -0,0 +1,48 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>AMS review of 'Infinite binary words containing repetitions of odd period' by Badkobeh and Crochemore</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> AMS review of 'Infinite binary words containing repetitions of odd period' by Badkobeh and Crochemore </h2> + <p>Posted on 2015-05-30</p> + <p>This paper is about the existence of pattern-avoiding infinite binary words, where the patterns are squares, cubes and \(3^+\)-powers. There are mainly two kinds of results, positive (existence of an infinite binary word avoiding a certain pattern) and negative (non-existence of such a word). Each positive result is proved by the construction of a word with finitely many squares and cubes which are listed explicitly. First a synchronising (also known as comma-free) uniform morphism \(g\: \Sigma_3^* \to \Sigma_2^*\)</p> +<p>is constructed. Then an argument is given to show that the length of squares in the code \(g(w)\) for a squarefree \(w\) is bounded, hence all the squares can be obtained by examining all \(g(s)\) for \(s\) of bounded lengths. The argument resembles that of the proof of, e.g., Theorem 1, Lemma 2, Theorem 3 and Lemma 4 in [N. Rampersad, J. O. Shallit and M. Wang, Theoret. Comput. Sci. <strong>339</strong> (2005), no. 1, 19–34; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=2142071&loc=fromrevtext">MR2142071</a>]. The negative results are proved by traversing all possible finite words satisfying the conditions.</p> +<p> Let \(L(n_2, n_3, S)\) be the maximum length of a word with \(n_2\) distinct squares, \(n_3\) distinct cubes and that the periods of the squares can take values only in \(S\) , where \(n_2, n_3 \in \Bbb N \cup \{\infty, \omega\}\) and \(S \subset \Bbb N_+\) . \(n_k = 0\) corresponds to \(k\)-free, \(n_k = \infty\) means no restriction on the number of distinct \(k\)-powers, and \(n_k = \omega\) means \(k^+\)-free.</p> +<p> Below is the summary of the positive and negative results:</p> +<ol type="1"> +<li><p>(Negative) \(L(\infty, \omega, 2 \Bbb N) < \infty\) : \(\nexists\) an infinite \(3^+\) -free binary word avoiding all squares of odd periods. (Proposition 1)</p></li> +<li><p>(Negative) \(L(\infty, 0, 2 \Bbb N + 1) \le 23\) : \(\nexists\) an infinite 3-free binary word, avoiding squares of even periods. The longest one has length \(\le 23\) (Proposition 2).</p></li> +<li>(Positive) \(L(\infty, \omega, 2 \Bbb N + +<ol type="1"> +<li><dl> +<dt>= \infty\)</dt> +<dd>\(\exists\) an infinite \(3^+\) -free binary word avoiding squares of even periods (Theorem 1). +</dd> +</dl></li> +</ol></li> +<li><p>(Positive) \(L(\infty, \omega, \{1, 3\}) = \infty\) : \(\exists\) an infinite \(3^+\) -free binary word containing only squares of period 1 or 3 (Theorem 2).</p></li> +<li><p>(Negative) \(L(6, 1, 2 \Bbb N + 1) = 57\) : \(\nexists\) an infinite binary word avoiding squares of even period containing \(< 7\) squares and \(< 2\) cubes. The longest one containing 6 squares and 1 cube has length 57 (Proposition 6).</p></li> +<li><p>(Positive) \(L(7, 1, 2 \Bbb N + 1) = \infty\) : \(\exists\) an infinite \(3^+\) -free binary word avoiding squares of even period with 1 cube and 7 squares (Theorem 3).</p></li> +<li><p>(Positive) \(L(4, 2, 2 \Bbb N + 1) = \infty\) : \(\exists\) an infinite \(3^+\) -free binary words avoiding squares of even period and containing 2 cubes and 4 squares (Theorem 4).</p></li> +</ol> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3313467, its copyright owned by the AMS.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2015-07-01-causal-quantum-product-levy-area.html b/site/posts/2015-07-01-causal-quantum-product-levy-area.html new file mode 100644 index 0000000..2d05b8e --- /dev/null +++ b/site/posts/2015-07-01-causal-quantum-product-levy-area.html @@ -0,0 +1,29 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>On a causal quantum double product integral related to Lévy stochastic area.</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> On a causal quantum double product integral related to Lévy stochastic area. </h2> + <p>Posted on 2015-07-01</p> + <p>In <a href="https://arxiv.org/abs/1506.04294">this paper</a> with <a href="http://homepages.lboro.ac.uk/~marh3/">Robin</a> we study the family of causal double product integrals \[ \prod_{a < x < y < b}\left(1 + i{\lambda \over 2}(dP_x dQ_y - dQ_x dP_y) + i {\mu \over 2}(dP_x dP_y + dQ_x dQ_y)\right) \]</p> +<p>where <span class="math inline"><em>P</em></span> and <span class="math inline"><em>Q</em></span> are the mutually noncommuting momentum and position Brownian motions of quantum stochastic calculus. The evaluation is motivated heuristically by approximating the continuous double product by a discrete product in which infinitesimals are replaced by finite increments. The latter is in turn approximated by the second quantisation of a discrete double product of rotation-like operators in different planes due to a result in <a href="http://www.actaphys.uj.edu.pl/findarticle?series=Reg&vol=46&page=1851">(Hudson-Pei2015)</a>. The main problem solved in this paper is the explicit evaluation of the continuum limit <span class="math inline"><em>W</em></span> of the latter, and showing that <span class="math inline"><em>W</em></span> is a unitary operator. The kernel of <span class="math inline"><em>W</em></span> is written in terms of Bessel functions, and the evaluation is achieved by working on a lattice path model and enumerating linear extensions of related partial orderings, where the enumeration turns out to be heavily related to Dyck paths and generalisations of Catalan numbers.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html b/site/posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html new file mode 100644 index 0000000..f64f9b6 --- /dev/null +++ b/site/posts/2015-07-15-double-macdonald-polynomials-macdonald-superpolynomials.html @@ -0,0 +1,40 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>AMS review of 'Double Macdonald polynomials as the stable limit of Macdonald superpolynomials' by Blondeau-Fournier, Lapointe and Mathieu</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> AMS review of 'Double Macdonald polynomials as the stable limit of Macdonald superpolynomials' by Blondeau-Fournier, Lapointe and Mathieu </h2> + <p>Posted on 2015-07-15</p> + <p>A Macdonald superpolynomial (introduced in [O. Blondeau-Fournier et al., Lett. Math. Phys. <span class="bf">101</span> (2012), no. 1, 27–47; <a href="http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=2935476&loc=fromrevtext">MR2935476</a>; J. Comb. <span class="bf">3</span> (2012), no. 3, 495–561; <a href="http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=3029444&loc=fromrevtext">MR3029444</a>]) in \(N\) Grassmannian variables indexed by a superpartition \(\Lambda\) is said to be stable if \({m (m + 1) \over 2} \ge |\Lambda|\) and \(N \ge |\Lambda| - {m (m - 3) \over 2}\) , where \(m\) is the fermionic degree. A stable Macdonald superpolynomial (corresponding to a bisymmetric polynomial) is also called a double Macdonald polynomial (dMp). The main result of this paper is the factorisation of a dMp into plethysms of two classical Macdonald polynomials (Theorem 5). Based on this result, this paper</p> +<ol type="1"> +<li><p>shows that the dMp has a unique decomposition into bisymmetric monomials;</p></li> +<li><p>calculates the norm of the dMp;</p></li> +<li><p>calculates the kernel of the Cauchy-Littlewood-type identity of the dMp;</p></li> +<li><p>shows the specialisation of the aforementioned factorisation to the Jack, Hall-Littlewood and Schur cases. One of the three Schur specialisations, denoted as \(s_{\lambda, \mu}\), also appears in (7) and (9) below;</p></li> +<li><p>defines the \(\omega\) -automorphism in this setting, which was used to prove an identity involving products of four Littlewood-Richardson coefficients;</p></li> +<li><p>shows an explicit evaluation of the dMp motivated by the most general evaluation of the usual Macdonald polynomials;</p></li> +<li><p>relates dMps with the representation theory of the hyperoctahedral group \(B_n\) via the double Kostka coefficients (which are defined as the entries of the transition matrix from the bisymmetric Schur functions \(s_{\lambda, \mu}\) to the modified dMps);</p></li> +<li><p>shows that the double Kostka coefficients have the positivity and the symmetry property, and can be written as sums of products of the usual Kostka coefficients;</p></li> +<li><p>defines an operator \(\nabla^B\) as an analogue of the nabla operator \(\nabla\) introduced in [F. Bergeron and A. M. Garsia, in <em>Algebraic methods and \(q\)-special functions</em> (Montréal, QC, 1996), 1–52, CRM Proc. Lecture Notes, 22, Amer. Math. Soc., Providence, RI, 1999; <a href="http://www.ams.org/mathscinet/search/publdoc.html?r=1&pg1=MR&s1=1726826&loc=fromrevtext">MR1726826</a>]. The action of \(\nabla^B\) on the bisymmetric Schur function \(s_{\lambda, \mu}\) yields the dimension formula \((h + 1)^r\) for the corresponding representation of \(B_n\) , where \(h\) and \(r\) are the Coxeter number and the rank of \(B_n\) , in the same way that the action of \(\nabla\) on the \(n\) th elementary symmetric function leads to the same formula for the group of type \(A_n\) .</p></li> +</ol> +<p>Copyright notice: This review is published at http://www.ams.org/mathscinet-getitem?mr=3306078, its copyright owned by the AMS.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2016-10-13-q-robinson-schensted-knuth-polymer.html b/site/posts/2016-10-13-q-robinson-schensted-knuth-polymer.html new file mode 100644 index 0000000..93bd833 --- /dev/null +++ b/site/posts/2016-10-13-q-robinson-schensted-knuth-polymer.html @@ -0,0 +1,37 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer </h2> + <p>Posted on 2016-10-13</p> + <p>(Latest update: 2017-01-12) In <a href="http://arxiv.org/abs/1504.00666">Matveev-Petrov 2016</a> a \(q\)-deformed Robinson-Schensted-Knuth algorithm (\(q\)RSK) was introduced. In this article we give reformulations of this algorithm in terms of Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pair are swapped in a sense of distribution when the input matrix is transposed. We also formulate a \(q\)-polymer model based on the \(q\)RSK and prove the corresponding Burke property, which we use to show a strong law of large numbers for the partition function given stationary boundary conditions and \(q\)-geometric weights. We use the \(q\)-local moves to define a generalisation of the \(q\)RSK taking a Young diagram-shape of array as the input. We write down the joint distribution of partition functions in the space-like direction of the \(q\)-polymer in \(q\)-geometric environment, formulate a \(q\)-version of the multilayer polynuclear growth model (\(q\)PNG) and write down the joint distribution of the \(q\)-polymer partition functions at a fixed time.</p> +<p>This article is available at <a href="https://arxiv.org/abs/1610.03692">arXiv</a>. It seems to me that one difference between arXiv and Github is that on arXiv each preprint has a few versions only. In Github many projects have a “dev” branch hosting continuous updates, whereas the master branch is where the stable releases live.</p> +<p><a href="%7B%7B%20site.url%20%7D%7D/assets/resources/qrsklatest.pdf">Here</a> is a “dev” version of the article, which I shall push to arXiv when it stablises. Below is the changelog.</p> +<ul> +<li>2017-01-12: Typos and grammar, arXiv v2.</li> +<li>2016-12-20: Added remarks on the geometric \(q\)-pushTASEP. Added remarks on the converse of the Burke property. Added natural language description of the \(q\)RSK. Fixed typos.</li> +<li>2016-11-13: Fixed some typos in the proof of Theorem 3.</li> +<li>2016-11-07: Fixed some typos. The \(q\)-Burke property is now stated in a more symmetric way, so is the law of large numbers Theorem 2.</li> +<li>2016-10-20: Fixed a few typos. Updated some references. Added a reference: <a href="http://web.mit.edu/~shopkins/docs/rsk.pdf">a set of notes titled “RSK via local transformations”</a>. It is written by <a href="http://web.mit.edu/~shopkins/">Sam Hopkins</a> in 2014 as an expository article based on MIT combinatorics preseminar presentations of Alex Postnikov. It contains some idea (applying local moves to a general Young-diagram shaped array in the order that matches any growth sequence of the underlying Young diagram) which I thought I was the first one to write down.</li> +</ul> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2017-04-25-open_research_toywiki.html b/site/posts/2017-04-25-open_research_toywiki.html new file mode 100644 index 0000000..50c22a7 --- /dev/null +++ b/site/posts/2017-04-25-open_research_toywiki.html @@ -0,0 +1,32 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Open mathematical research and launching toywiki</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> Open mathematical research and launching toywiki </h2> + <p>Posted on 2017-04-25</p> + <p>As an experimental project, I am launching toywiki.</p> +<p>It hosts a collection of my research notes.</p> +<p>It takes some ideas from the open source culture and apply them to mathematical research: 1. It uses a very permissive license (CC-BY-SA). For example anyone can fork the project and make their own version if they have a different vision and want to build upon the project. 2. All edits will done with maximum transparency, and discussions of any of notes should also be as public as possible (e.g. Github issues) 3. Anyone can suggest changes by opening issues and submitting pull requests</p> +<p>Here are the links: <a href="http://toywiki.xyz">toywiki</a> and <a href="https://github.com/ycpei/toywiki">github repo</a>.</p> +<p>Feedbacks are welcome by email.</p> + + </div> + </div> + </body> +</html> diff --git a/site/posts/2017-08-07-mathematical_bazaar.html b/site/posts/2017-08-07-mathematical_bazaar.html new file mode 100644 index 0000000..c5d62a2 --- /dev/null +++ b/site/posts/2017-08-07-mathematical_bazaar.html @@ -0,0 +1,79 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>The Mathematical Bazaar</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> The Mathematical Bazaar </h2> + <p>Posted on 2017-08-07</p> + <p>In this essay I describe some problems in academia of mathematics and propose an open source model, which I call open research in mathematics.</p> +<p>This essay is a work in progress - comments and criticisms are welcome! <a href="#fn1" class="footnote-ref" id="fnref1"><sup>1</sup></a></p> +<p>Before I start I should point out that</p> +<ol type="1"> +<li>Open research is <em>not</em> open access. In fact the latter is a prerequisite to the former.</li> +<li>I am not proposing to replace the current academic model with the open model - I know academia works well for many people and I am happy for them, but I think an open research community is long overdue since the wide adoption of the World Wide Web more than two decades ago. In fact, I fail to see why an open model can not run in tandem with the academia, just like open source and closed source software development coexist today.</li> +</ol> +<h2 id="problems-of-academia">problems of academia</h2> +<p>Open source projects are characterised by publicly available source codes as well as open invitations for public collaborations, whereas closed source projects do not make source codes accessible to the public. How about mathematical academia then, is it open source or closed source? The answer is neither.</p> +<p>Compared to some other scientific disciplines, mathematics does not require expensive equipments or resources to replicate results; compared to programming in conventional software industry, mathematical findings are not meant to be commercial, as credits and reputation rather than money are the direct incentives (even though the former are commonly used to trade for the latter). It is also a custom and common belief that mathematical derivations and theorems shouldn't be patented. Because of this, mathematical research is an open source activity in the sense that proofs to new results are all available in papers, and thanks to open access e.g. the arXiv preprint repository most of the new mathematical knowledge is accessible for free.</p> +<p>Then why, you may ask, do I claim that maths research is not open sourced? Well, this is because 1. mathematical arguments are not easily replicable and 2. mathematical research projects are mostly not open for public participation.</p> +<p>Compared to computer programs, mathematical arguments are not written in an unambiguous language, and they are terse and not written in maximum verbosity (this is especially true in research papers as journals encourage limiting the length of submissions), so the understanding of a proof depends on whether the reader is equipped with the right background knowledge, and the completeness of a proof is highly subjective. More generally speaking, computer programs are mostly portable because all machines with the correct configurations can understand and execute a piece of program, whereas humans are subject to their environment, upbringings, resources etc. to have a brain ready to comprehend a proof that interests them. (these barriers are softer than the expensive equipments and resources in other scientific fields mentioned before because it is all about having access to the right information)</p> +<p>On the other hand, as far as the pursuit of reputation and prestige (which can be used to trade for the scarce resource of research positions and grant money) goes, there is often little practical motivation for career mathematicians to explain their results to the public carefully. And so the weird reality of the mathematical academia is that it is not an uncommon practice to keep trade secrets in order to protect one's territory and maintain a monopoly. This is doable because as long as a paper passes the opaque and sometimes political peer review process and is accepted by a journal, it is considered work done, accepted by the whole academic community and adds to the reputation of the author(s). Just like in the software industry, trade secrets and monopoly hinder the development of research as a whole, as well as demoralise outsiders who are interested in participating in related research.</p> +<p>Apart from trade secrets and territoriality, another reason to the nonexistence of open research community is an elitist tradition in the mathematical academia, which goes as follows:</p> +<ul> +<li>Whoever is not good at mathematics or does not possess a degree in maths is not eligible to do research, or else they run high risks of being labelled a crackpot.</li> +<li>Mistakes made by established mathematicians are more tolerable than those less established.</li> +<li>Good mathematical writings should be deep, and expositions of non-original results are viewed as inferior work and do not add to (and in some cases may even damage) one's reputation.</li> +</ul> +<p>All these customs potentially discourage public participations in mathematical research, and I do not see them easily go away unless an open source community gains momentum.</p> +<p>To solve the above problems, I propose a open source model of mathematical research, which has high levels of openness and transparency and also has some added benefits listed in the last section of this essay. This model tries to achieve two major goals:</p> +<ul> +<li>Open and public discussions and collaborations of mathematical research projects online</li> +<li>Open review to validate results, where author name, reviewer name, comments and responses are all publicly available online.</li> +</ul> +<p>To this end, a Github model is fitting. Let me first describe how open source collaboration works on Github.</p> +<h2 id="open-source-collaborations-on-github">open source collaborations on Github</h2> +<p>On <a href="https://github.com">Github</a>, every project is publicly available in a repository (we do not consider private repos). The owner can update the project by "committing" changes, which include a message of what has been changed, the author of the changes and a timestamp. Each project has an issue tracker, which is basically a discussion forum about the project, where anyone can open an issue (start a discussion), and the owner of the project as well as the original poster of the issue can close it if it is resolved, e.g. bug fixed, feature added, or out of the scope of the project. Closing the issue is like ending the discussion, except that the thread is still open to more posts for anyone interested. People can react to each issue post, e.g. upvote, downvote, celebration, and importantly, all the reactions are public too, so you can find out who upvoted or downvoted your post.</p> +<p>When one is interested in contributing code to a project, they fork it, i.e. make a copy of the project, and make the changes they like in the fork. Once they are happy with the changes, they submit a pull request to the original project. The owner of the original project may accept or reject the request, and they can comment on the code in the pull request, asking for clarification, pointing out problematic part of the code etc and the author of the pull request can respond to the comments. Anyone, not just the owner can participate in this review process, turning it into a public discussion. In fact, a pull request is a special issue thread. Once the owner is happy with the pull request, they accept it and the changes are merged into the original project. The author of the changes will show up in the commit history of the original project, so they get the credits.</p> +<p>As an alternative to forking, if one is interested in a project but has a different vision, or that the maintainer has stopped working on it, they can clone it and make their own version. This is a more independent kind of fork because there is no longer intention to contribute back to the original project.</p> +<p>Moreover, on Github there is no way to send private messages, which forces people to interact publicly. If say you want someone to see and reply to your comment in an issue post or pull request, you simply mention them by <code>@someone</code>.</p> +<h2 id="open-research-in-mathematics">open research in mathematics</h2> +<p>All this points to a promising direction of open research. A maths project may have a wiki / collection of notes, the paper being written, computer programs implementing the results etc. The issue tracker can serve as a discussion forum about the project as well as a platform for open review (bugs are analogous to mistakes, enhancements are possible ways of improving the main results etc.), and anyone can make their own version of the project, and (optionally) contribute back by making pull requests, which will also be openly reviewed. One may want to add an extra "review this project" functionality, so that people can comment on the original project like they do in a pull request. This may or may not be necessary, as anyone can make comments or point out mistakes in the issue tracker.</p> +<p>One may doubt this model due to concerns of credits because work in progress is available to anyone. Well, since all the contributions are trackable in project commit history and public discussions in issues and pull request reviews, there is in fact <em>less</em> room for cheating than the current model in academia, where scooping can happen without any witnesses. What we need is a platform with a good amount of trust like arXiv, so that the open research community honours (and can not ignore) the commit history, and the chance of mis-attribution can be reduced to minimum.</p> +<p>Compared to the academic model, open research also has the following advantages:</p> +<ul> +<li>Anyone in the world with Internet access will have a chance to participate in research, whether they are affiliated to a university, have the financial means to attend conferences, or are colleagues of one of the handful experts in a specific field.</li> +<li>The problem of replicating / understanding maths results will be solved, as people help each other out. This will also remove the burden of answering queries about one's research. For example, say one has a project "Understanding the fancy results in [paper name]", they write up some initial notes but get stuck understanding certain arguments. In this case they can simply post the questions on the issue tracker, and anyone who knows the answer, or just has a speculation can participate in the discussion. In the end the problem may be resolved without the authors of the paper being bothered, who may be too busy to answer.</li> +<li>Similarly, the burden of peer review can also be shifted from a few appointed reviewers to the crowd.</li> +</ul> +<h2 id="related-readings">related readings</h2> +<ul> +<li><a href="http://www.catb.org/esr/writings/cathedral-bazaar/">The Cathedral and the Bazaar by Eric Raymond</a></li> +<li><a href="http://michaelnielsen.org/blog/doing-science-online/">Doing sience online by Michael Nielson</a></li> +<li><a href="https://gowers.wordpress.com/2009/01/27/is-massively-collaborative-mathematics-possible/">Is massively collaborative mathematics possible? by Timothy Gowers</a></li> +</ul> +<section class="footnotes"> +<hr /> +<ol> +<li id="fn1"><p>Please send your comments to my email address - I am still looking for ways to add a comment functionality to this website.<a href="#fnref1" class="footnote-back">↩</a></p></li> +</ol> +</section> + + </div> + </div> + </body> +</html> diff --git a/templates/barepost.html b/templates/barepost.html new file mode 100644 index 0000000..4a7e2a3 --- /dev/null +++ b/templates/barepost.html @@ -0,0 +1,5 @@ +<div class="bodyitem"> + <a href="$url$"><h2> $title$ </h2></a> + <p>Posted on $date$</p> + $body$ +</div> diff --git a/templates/blog.html b/templates/blog.html new file mode 100644 index 0000000..442b5c1 --- /dev/null +++ b/templates/blog.html @@ -0,0 +1,26 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Yuchen's Blog</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="blog.html">Yuchen's Blog</a> + </span> + <nav> + <a href="postlist.html">All posts</a><a href="index.html">About</a><a href="blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + $body$ + <div class="bodyitem"> + <p><a href="postlist.html">older posts</a></p> + </div> + </div> + </body> +</html> diff --git a/templates/default.html b/templates/default.html new file mode 100644 index 0000000..7cd66f1 --- /dev/null +++ b/templates/default.html @@ -0,0 +1,26 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>$title$</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="index.html">Yuchen Pei</a> + </span> + <nav> + <a href="blog.html">Blog</a><a href="microblog.html">Microblog</a><a href="links.html">Links</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + $body$ + </div> + </div> + + </body> +</html> diff --git a/templates/microblog.html b/templates/microblog.html new file mode 100644 index 0000000..66ef130 --- /dev/null +++ b/templates/microblog.html @@ -0,0 +1,24 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>Yuchen's Microblog</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="microblog.html">Yuchen's Microblog</a> + </span> + <nav> + <a href="index.html">About</a><a href="microblog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + $body$ + </div> + + </body> +</html> diff --git a/templates/micropost.html b/templates/micropost.html new file mode 100644 index 0000000..0b60430 --- /dev/null +++ b/templates/micropost.html @@ -0,0 +1,4 @@ +<div class="bodyitem"> + <p>$date$</p> + $body$ +</div> diff --git a/templates/oldpost.html b/templates/oldpost.html new file mode 100644 index 0000000..92216fb --- /dev/null +++ b/templates/oldpost.html @@ -0,0 +1,27 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>$title$</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> $title$ </h2> + <p>Posted on $date$</p> + $body$ + </div> + </div> + </body> +</html> diff --git a/templates/post.html b/templates/post.html new file mode 100644 index 0000000..92216fb --- /dev/null +++ b/templates/post.html @@ -0,0 +1,27 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>$title$</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script> + </head> + <body> + <header> + <span class="logo"> + <a href="../blog.html">Blog</a> + </span> + <nav> + <a href="../index.html">About</a><a href="../postlist.html">All posts</a><a href="../blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <h2> $title$ </h2> + <p>Posted on $date$</p> + $body$ + </div> + </div> + </body> +</html> diff --git a/templates/postlist.html b/templates/postlist.html new file mode 100644 index 0000000..52a019b --- /dev/null +++ b/templates/postlist.html @@ -0,0 +1,30 @@ +<!doctype html> +<html lang="en"> + <head> + <meta charset="utf-8"> + <title>All posts</title> + <link rel="stylesheet" href="../assets/css/default.css" /> + <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.9.0/katex.min.css" integrity="sha384-TEMocfGvRuD1rIAacqrknm5BQZ7W7uWitoih+jMNFXQIbNl16bO8OZmylH/Vi/Ei" crossorigin="anonymous"> + <script src="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.9.0/katex.min.js" integrity="sha384-jmxIlussZWB7qCuB+PgKG1uLjjxbVVIayPJwi6cG6Zb4YKq0JIw+OMnkkEC7kYCq" crossorigin="anonymous"></script> + <script src="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.9.0/contrib/auto-render.min.js" integrity="sha384-IiI65aU9ZYub2MY9zhtKd1H2ps7xxf+eb2YFG9lX6uRqpXCvBTOidPRCXCrQ++Uc" crossorigin="anonymous"></script> + <script> document.addEventListener("DOMContentLoaded", function() { renderMathInElement(document.body); }); </script> + </head> + <body> + <header> + <span class="logo"> + <a href="blog.html">Yuchen's Blog</a> + </span> + <nav> + <a>All posts</a><a href="index.html">About</a><a href="blog-feed.xml">Feed</a> + </nav> + </header> + + <div class="main"> + <div class="bodyitem"> + <ul class="postlist"> + $body$ + </ul> + </div> + </div> + </body> +</html> diff --git a/templates/postlistitem.html b/templates/postlistitem.html new file mode 100644 index 0000000..eb8cb5f --- /dev/null +++ b/templates/postlistitem.html @@ -0,0 +1,3 @@ +<li class="postlistitem"> + <a href="$url$">$title$</a> - $date$ +</li> |
