Page Not Found
Page not found. Your pixels are in another canvas.
Sitemap
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Pages
Page not in menu
This is a page not in th emain menu
Posts
Future Blog Post
Published:
This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.
Blog Post number 4
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 3
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 2
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 1
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
portfolio
Portfolio item number 1
Short description of portfolio item number 1
Portfolio item number 2
Short description of portfolio item number 2
publications
Maximum determinant and permanent of sparse 0-1 matrices
Published in Linear Algebra and its Applications, 2022
We prove that the maximum determinant of an n by n matrix, with entries in {0,1} and at most n+k non-zero entries, is at most 2^{k/3}, which is best possible when k is a multiple of 3.
Recommended citation: Araujo, Igor, József Balogh, and Yuzhou Wang. "Maximum determinant and permanent of sparse 0-1 matrices." Linear Algebra and its Applications 645 (2022): 194-228. https://www.sciencedirect.com/science/article/abs/pii/S0024379522001215?via%3Dihub
On the hardness of finding balanced independent sets in random bipartite graphs
Published in SODA 2024, 2024
We give evidence of a statistical-computational gap for finding balanced independent sets in random bipartite graphs of average degree d, where d is a large constant. While balanced independent sets of density (2+o_d(1)) log d/d exist whp in such graphs, ther best known efficient algorithm (which is very simple) can only find balanced independent sets of half this size. We show that neither local algorithms nor low-degree algorithms can do better.
Recommended citation: Perkins, Will, and Yuzhou Wang. "On the hardness of finding balanced independent sets in random bipartite graphs." arXiv preprint arXiv:2307.13921 (2023). https://arxiv.org/abs/2307.13921
talks
Talk 1 on Relevant Topic in Your Field
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Conference Proceeding talk 3 on Relevant Topic in Your Field
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
teaching
Teaching experience 1
Undergraduate course, University 1, Department, 2014
This is a description of a teaching experience. You can use markdown like any other post.
Teaching experience 2
Workshop, University 1, Department, 2015
This is a description of a teaching experience. You can use markdown like any other post.