I am very excited to announce that our newest product TrueShelf.org is now available to everybody. TrueShelf.org is a BlockChain powered social learning platform. Users on the platform get rewarded with EulerCoin (the platform’s cryptocurrency) for creating and curating quality education content. The platform creates new tokens at a rate determined by mathematical rules that align the incentives between content creators, researchers, educators, teachers and students.
Go ahead and signup, post an article explaining some concept in mathematics or computer science / open problem / multiple-choice question / exercise. Content creators earn EulerCoin proportional to the number of likes (aka upvotes) of their content. More details of the token allocation and its game-theoretic analysis are coming soon in our white paper. We are planning an ICO soon.
Here are some examples of user generated content from our beta version:
TrueShelf.org’s mission is to unleash the unlimited potential of such quality content creators, researchers, educators, teachers and students from all over world and make learning more engaging, efficient and effective.
At TrueShelf Inc, we now have two platforms:
Today’s post is about the following paper, a joint work with Qiuyi Zhang, one of my advisees. Qiuyi Zhang is now a graduate student in the Mathematics department of Berkeley.
- Shiva Kintali, Qiuyi Zhang. Forbidden Directed Minors and Directed Pathwidth. (Preprint is available on my publications page)
Undirected graphs of pathwidth at most one are characterized by two forbidden minors i.e., (i) the complete graph on three vertices and (ii) the spider graph with three legs of length two each (see the following figure).
Directed pathwidth is a natural generalization of pathwidth to digraphs. We proved that digraphs of directed pathwidth at most one are characterized by a finite number of forbidden directed minors. In particular, we proved that the number of vertices in any forbidden directed minor is at most 8*160000+7. Ahem !!
This paper falls in the “directed minors” part of my research interests. In an earlier theorem, proved in April 2013 (see this earlier post), we proved that partial 1-DAGs are characterized by three forbidden directed minors. In a similar vein, I conjectured that the digraphs with directed pathwidth at most 1 are characterized by a finite number of forbidden directed minors. I assumed that the number of forbidden directed minors is number is around 100. So we started this project in May 2013 and started making a list of carefully constructed forbidden directed minors and tried to extend our techniques from partial 1-DAGs. Here is an initial list of minors we found.
All the forbidden minors we found, looked very cute and we assumed that a proof is nigh. Soon, we realized that the list is growing quickly and none of our earlier techniques are applicable. After almost an year of patient efforts and roller coaster rides, we proved our finiteness theorem in May 2014, two weeks before Qiuyi Zhang’s thesis defense. It took us 10 more months to get the paper to its current status. So this is a two year long adventure.
I am hoping to prove more theorems in the “directed minors” area in the coming years. The current paper taught me that patience and focus are big factors to make consistent progress. There should be a nice balance between `proving new theorems’ and `writing up the existing results’.
This is a short post about the following paper in my directed minor series :
- Shiva Kintali. “Directed Minors III. Directed Linked Decompositions“. Preprint available on my publications page.
Thomas [Tho’90] proved that every undirected graph admits a linked tree decomposition of width equal to its treewidth. This theorem is a key technical tool for proving that every set of bounded treewidth graphs is well-quasi-ordered. An analogous theorem for branch-width was proved by Geelen, Gerards and Whittle [GGW’02]. They used this result to prove that all matroids representable over a fixed finite field and with bounded branch-width are well-quasi-ordered under minors. Kim and Seymour [KS’12] proved that every semi-complete digraph admits a linked directed path decomposition of width equal to its directed pathwidth. They used this result to show that all semi-complete digraphs are well-quasi-ordered under “strong” minors.
In this paper, we generalize Thomas’s theorem to all digraphs.
Theorem : Every digraph G admits a linked directed path decomposition and a linked DAG decomposition of width equal to its directed pathwidth and DAG-width respectively.
The above theorem is crucial to prove well-quasi-ordering of some interesting classes of digraphs. I will release Directed Minors IV soon. Stay tuned !!
This is a short post about the following paper :
- Shiva Kintali. “Directed Width Parameters and Circumference of Digraphs“. Preprint available on my publications page.
We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one. This generalizes a theorem of Birmele stating that the treewidth of an undirected graph is at most its circumference.
Theorem : Let G be a digraph of circumference l. Then the directed treewidth, DAG-width and Kelly-width of G are at most l + 1.
The above theorem can be seen as a mini mini mini directed grid minor theorem. I will be using this theorem in future papers to make progress towards a directed grid minor theorem. Stay tuned !!
Wish you all a Very Happy New Year. Here is a list of my 10 favorite open problems for 2014. They belong to several research areas inside discrete mathematics and theoretical computer science. Some of them are baby steps towards resolving much bigger open problems. May this new year shed new light on these open problems.
- 2. Optimization : Improve the approximation factor for the undirected graphic TSP. The best known bound is 7/5 by Sebo and Vygen.
- 3. Algorithms : Prove that the tree-width of a planar graph can be computed in polynomial time (or) is NP-complete.
- 4. Fixed-parameter tractability : Treewidth and Pathwidth are known to be fixed-parameter tractable. Are directed treewidth/DAG-width/Kelly-width (generalizations of treewidth) and directed pathwidth (a generalization of pathwidth) fixed-parameter tractable ? This is a very important problem to understand the algorithmic and structural differences between undirected and directed width parameters.
- 5. Space complexity : Is Planar ST-connectvity in logspace ? This is perhaps the most natural special case of the NL vs L problem. Planar ST-connectivity is known to be in . Recently, Imai, Nakagawa, Pavan, Vinodchandran and Watanabe proved that it can be solved simultaneously in polynomial time and approximately O(√n) space.
- 6. Metric embedding : Is the minor-free embedding conjecture true for partial 3-trees (graphs of treewidth 3) ? Minor-free conjecture states that “every minor-free graph can be embedded in with constant distortion. The special case of planar graphs also seems very difficult. I think the special case of partial 3-trees is a very interesting baby step.
- 7. Structural graph theory : Characterize pfaffians of tree-width at most 3 (i.e., partial 3-trees). It is a long-standing open problem to give a nice characterization of pfaffians and design a polynomial time algorithm to decide if an input graph is a pfaffian. The special of partial 3-trees is an interesting baby step.
- 8. Structural graph theory : Prove that every minimal brick has at least four vertices of degree three. Bricks and braces are defined to better understand pfaffians. The characterization of pfaffian braces is known (more generally characterization of bipartite pfaffians is known). To understand pfaffians, it is important to understand the structure of bricks. Norine,Thomas proved that every minimal brick has at least three vertices of degree three and conjectured that every minimal brick has at least cn vertices of degree three.
- 9. Communication Complexity : Improve bounds for the log-rank conjecture. The best known bound is
- 10. Approximation algorithms : Improve the approximation factor for the uniform sparsest cut problem. The best known factor is .
Here are my conjectures for 2014 🙂
- Weak Conjecture : at least one of the above 10 problems will be resolved in 2014.
- Conjecture : at least five of the above 10 problems will be resolved in 2014.
- Strong Conjecture : All of the above 10 problems will be resolved in 2014.
Have fun !!
Today’s post is about the following paper, a joint work with Qiuyi Zhang, one of my advisees. Qiuyi Zhang is an undergraduate (rising senior) in our mathematics department.
- Shiva Kintali, Qiuyi Zhang. Forbidden Directed Minors and Kelly-width. (Preprint available on my publications page)
It is well-known that an undirected graph is a partial 1-tree (i.e., a forest) if and only if it has no minor. We generalized this characterization to partial 1-DAGs. We proved that partial 1-DAGs are characterized by three forbidden directed minors, and , shown in the following figure. We named the last two graphs as and because their bidirected edges resemble the letters N and M.
Partial k-trees characterize bounded treewidth graphs. Similarly, partial k-DAGs characterize bounded Kelly-width digraphs. Kelly-width is the best known generalization of treewidth to digraphs.
As mentioned in the paper, I have a series of upcoming papers (called Directed Minors) making progress towards a directed graph minor theorem (i.e., all digraphs are well-quasi-ordered by the directed minor relation). For more details of the directed minor relation, read the current paper. I will post about the upcoming results as and when the preprints are ready.
One year back (on 6/6/12) I announced a beta version of TrueShelf, a social-network for sharing exercises and puzzles especially in mathematics and computer science. After an year of testing and adding new features, now I can say that TrueShelf is out of beta.
TrueShelf turned out to be a very useful website. When students ask me for practice problems (or books) on a particular topic, I simply point them to trueshelf and tell them the tags related to that topic. When I am advising students on research projects, I first tell them to solve all related problems (in the first couple of weeks) to prepare them to read research papers.
Here are the features in TrueShelf 1.0.
- Post an exercise (or) multiple-choice question (or) video (or) notes.
- Solve any multiple-choice question directly on the website.
- Add topic and tags to any post
- Add source or level (high-school/undergraduate/graduate/research).
- Show text-books related to a post
- Show related posts for every post.
- View printable version (or) LaTex version of any post.
- Email / Tweet / share on facebook (or) Google+ any post directly from the post.
- Add any post to your Favorites
- Like (a.k.a upvote) any post.
Feel free to explore TrueShelf, contribute new exercises and let me know if you have any feedback (or) new features you want to see. You can also follow TrueShelf on facebook, twitter and google+. Here is a screenshot highlighting the important features.