Sign in

Nutan Limaye

@nutanlimaye.bsky.social
313 followers 169 following 142 posts
PostsRepliesMedia
Nutan Limaye @nutanlimaye.bsky.social · 28/09/2026
@lionellevine.bsky.social has a guestbook for AI gents. I am so amazed and intrigued by reading it! It sounds very surreal. As if I am watching the matrix. lionellevine.github.io/guestbook/
lionellevine.github.io
Lionel Levine's Guestbook
If you're an AI (or a human) visiting Lionel Levine's homepage, you're invited to sign this guestbook. Every entry is approved by a human before it appears. There is also an open research challenge fo...
100
Nutan Limaye @nutanlimaye.bsky.social · 23/09/2026
OpenAI has solved 100-odd long-standing open problems. openai.com/index/adviso... Now they are wondering how to release them. The best mind of today are now deciding on policy of release rather than thinking about the problems and solutions. I never saw this coming. agmai.org
openai.com
Advisory Group on Mathematics and Artificial Intelligence
OpenAI is working with an independent Advisory Group on Mathematics and Artificial Intelligence to guide the review and communication of emerging AI results.
100
Nutan Limaye @nutanlimaye.bsky.social · 17/09/2026
Just looked up something out of curiosity. 2023, 2024, 2025: number of papers on ECCC till around mid-September was around 140. 2026: the number is 192.
030
Nutan Limaye @nutanlimaye.bsky.social · 16/09/2026
Oded Goldreich wrote this in 2025, but this resonates with me. |https://www.wisdom.weizmann.ac.il/~oded/on-proofs-t2.html What I agree with: Achievements are a proxy for understanding. Achievements without understanding do not matter. My take: +
141
Nutan Limaye @nutanlimaye.bsky.social · 14/09/2026
This is not where I expected TCS to be in 2026! The last line in the abstract is distressing. :( Is this how we need to work when we get a big result? As if someone is always chasing us?
0412
Reposted by Nutan Limaye
Ali @alisouthhams.bsky.social · 12/08/2026
Courtesy of Hats on Cats 🤣 #solareclipse
25577391417
Nutan Limaye @nutanlimaye.bsky.social · 13/08/2026
"Even a broken clock is right twice a day". An idiom that will be lost on the next generation! :D
static.klipy.com
Pressing Button on Wooden Digital Clock
ALT: Pressing Button on Wooden Digital Clock
030
Reposted by Nutan Limaye
Clément Canonne @ccanonne.github.io · 01/08/2026
- be there for the junior researchers, and be generous with your funding/opportunities. Again, You (we? I feel old) have more stability, more of a cushion. Go out of your way to ease the path of the next generation and shield them. 4/ (end of personal, biased advice for senior TCS researchers)
1402
Nutan Limaye @nutanlimaye.bsky.social · 29/07/2026
The WAVE (Women in Algorithms, Venture into Exploration) 2026 workshop will take place on Friday, 11 September 2026, at the University of Copenhagen, Denmark. Website: wave-workshop.github.io Registration free but mandatory. Register now!! Please spread the word. Write to us if you have queries.
072
Nutan Limaye @nutanlimaye.bsky.social · 20/07/2026
Thore Husfeldt and I wrote a guest post on @lance.fortnow.com and Bill Gasarch’s blog trying to explain the recent result that bipartite perfect matching allows *deterministic* efficient parallel algorithms (“BPM belong to NC”). blog.computationalcomplexity.org/2026/07/bipa...
blog.computationalcomplexity.org
Bipartite Perfect Matching in Deterministic NC
Nutan Limaye and Thore Husfeldt guest post on the new deterministic parallel algorithm for bipartite perfect matching by Abhranil Chatterje...
081
Nutan Limaye @nutanlimaye.bsky.social · 03/07/2026
Heading to ICALP 2026. From Copenhagen to London by bus!!! 🚌
390
Nutan Limaye @nutanlimaye.bsky.social · 29/06/2026
Here is yet another episode of Life of a researcher. open.spotify.com/episode/4M3T... This episode is really special. The picture says it all, I suppose. But read the comments to know more! Pro tip for listening: we are much more fun and snappy at 1.5x or 2x speed. So speed up the audio!!
180
Nutan Limaye @nutanlimaye.bsky.social · 15/06/2026
Now it's official!! I already finished reading the introduction. Working out the proof is what I'm looking forward to next! Highest on my to-do. eccc.weizmann.ac.il/report/2026/... Paper number 100. Love it!! :D
eccc.weizmann.ac.il
ECCC - TR26-100
050
Reposted by Nutan Limaye
Joshua Grochow @joshuagrochow.bsky.social · 14/06/2026
The preprint is out! Bipartite Perfect Matching is in NC, by Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, Thomas Thierauf eccc.weizmann.ac.il/report/2026/... #MathSky
eccc.weizmann.ac.il
ECCC - TR26-100
2265
Nutan Limaye @nutanlimaye.bsky.social · 11/06/2026
If you know it you know it. www.kva.se/en/event/cel...
010
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
We are ending with a lovely talk by Tuukka Korhonen who is telling us about lower bounds on tropical circuits, circuits that work over the (max, +) semiring.
020
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
Pietro Posta is telling us how to count interesting representation theoretical quantities using quantum algorithms. Specifically, he provides #BQP algorithms for counting these quantities.
030
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
The first talk in the final session of the final day of the workshop Julian Dörfler is telling us about local combinatorial interpretations. This is like a close cousin of what Igor Pak told us about the first day.
010
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
Pravesh Kothari is taking us on a tour through the two worlds of algorithms for tensor decomposition.
080
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
In the talk just before the lunch break Théo Fabris is telling us about strong separation between monotone and non-monotone circuits. There is a polynomial that has cubic size depth-3 circuit but requires exp(n) size monotone circuit.
010
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
Next, Magnus Hansen talked about the non-closure of roABPs under factoring. This is in contrast to previous results presented in the session.
010
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
Shanthanu Rai talked about the complexity of a fundamental problem, namely GCD. This is a problem I can explain to my nephew who is in 5th grade. It is fascinating that we have a new upper bound for it since 2024 and it has been made field independent in the work he presented. The talk was online.
030
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
The day started with a talk by Mrinal Kumar who presented one of my favorite recent results. The result is about the complexity of the factors of easy polynomials. It states that the factors are as easy as the polynomial. It subsumes all previous results of this kind.
030
Nutan Limaye @nutanlimaye.bsky.social · 05/06/2026
Rohit Gurjar describes the result about Bipartite Perfect Matching is in NC to Avi Wigderson.
050
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
Prahladh Harsha is telling us about how to obtain near linear time algorithms for the list deciding problem. The main bottleneck is to design a near linear time algorithm for the interpolation step that shows up in previous polynomial time algorithms.
120
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
Roshan Raj presented a randomized polynomial time algorithm for a natural problem called Black-box Principal Minor Assignment. A definition called rank one extensions seem very interesting. I wonder whether it has any geometric interpretation.
020
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
Computing the order of an element is an important step in integer factorization. Ben Lee Volk have an improvement to this algorithmic question.
020
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
In the afternoon session we started with a talk by Josh Alman who is telling us about Faster Walsh-Hadamard Transform from Matrix Non-Rigidity.
030
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
Since today Bipartite Perfect Matching is in NC. The proof uses connections between coding theory and Hall's theorem. Presented at WACT 2026. Yay!!!
2498
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
The talk before lunch is by Anakin Dey. He is telling us about how to deborder a result of Andrews and Forbes about IPS lower bounds. The main ingredient, surprisingly, is the isolation lemma.
010
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
The next talk in the session is by Prerona Chatterjee who is telling us about a variant of the IPS that is motivated by a previous result of Li, Tzameret, and Wang regarding the non-commutative IPS.
020
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
First talk in the session after the coffee break was by Tuomas Hakoniemi who presented our recent result (with Iddo Tzameret) on IPS proof systems which gives a CNF hard instance.
020
Nutan Limaye @nutanlimaye.bsky.social · 04/06/2026
The first session today (Jun 4) is about proof complexity. The first talk is by Susanna de Rezende and Kilian Risse about Algebraic Proof Systems. Susanna introduced NZ and PC proof systems and Kilian is telling us about some recent results about PC.
050
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
An auditorium full of complexity theorists!
0120
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
The talk before the poster session was by Tim Seppelt. He told us about the exciting new work on separation results for symmetric algebraic complexity classes.
020
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
The afternoon session on day 2 started with an introduction to symmetric circuits and lower bound techniques for these by Anuj Dawar. The symmetric model is one of the rare models that distinguishes the non-identical twins Det and Perm.
021
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
The two talks before lunch continue the derandomization-PIT-reconstruction theme. Zeyu Guo talked about how techniques from function fields and PIT can be used for constructing explicit lossless rank extractors. Whereas Devansh is talking about their recent work on depth-3 reconstruction problem.
040
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
The next talk is by C. Ramya, who unfortunately could not be there in person. However, the technology seems to work fine. She is telling us about PIT algorithms for non-associativite polynomials.
010
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
Today (Jun 3) Rafael Oliveira is telling us about Sylvester-Gallai configurations and connections to PIT. He will also dare to introduce us to algebraic geometry (as per the abstract)! Let's see how much I understand.
020
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
The afternoon session started with a talk by Igor Pak. He took us on a personal journey about his quest for formalizing the notion of combinatorial interpretation. I really enjoyed his tongue and cheek remarks about complexity theory. Do check it out! www.youtube.com/live/_3tgo6e...
youtube.com
YouTube
Share your videos with friends, family, and the world
010
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
Sanyam Agrawal (continuing the pre-lunch morning session) spoke about a variant of the Hilbert Nullstellensatz called Approximate Polynomial Satisfiability. As he encouragingly pointed out "almost all questions [related to the problem] are open. Note to self: I need to talk to the authors today. :)
020
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
Robert Andrews presented his recent result about an unconditional upper bound on the fundamental problem called "Hilbert Nullstellensatz". The bound improves from PSPACE to CH! The core idea is that the resultant can be computed by uniform constant-depth circuits.
040
Nutan Limaye @nutanlimaye.bsky.social · 03/06/2026
In the following session we had talks by Rahul Santhanam, Robert Andrews, and Sanyam Agrawal. Rahul Santhanam showed how bounded arithmetic can be used to argue about provability of algebraic lower bounds.
030
Nutan Limaye @nutanlimaye.bsky.social · 02/06/2026
Extremely lucky to have Avi Wigderson as the first speaker (en.wikipedia.org/wiki/Avi_Wig...). He talked about the non-identical twin polynomials Determinant and Permanent.
080
Nutan Limaye @nutanlimaye.bsky.social · 02/06/2026
Srikanth Srinivasan (Organizer) started with an introduction to the event and Amir Yehudayoff (Organizer) introduced the first speaker, Avi Wigderson.
050
Nutan Limaye @nutanlimaye.bsky.social · 02/06/2026
WACT 2026 in Copenhagen from Jun 2 to Jun 5 (started today!). Webpage: sites.google.com/view/wact202... YouTube channel: www.youtube.com/@WACT2026/pl...
1154
Nutan Limaye @nutanlimaye.bsky.social · 11/03/2026
I got interviewed for my podcast in Bulletin of the EATCS! I am really delighted by this so, sharing it with you. eatcs.org/images/bulle... Thank you @eatcs.bsky.social and @neumannstefan.com. Here is a link to one of the episodes of my podcast. open.spotify.com/episode/3RNO...
eatcs.org
082
Nutan Limaye @nutanlimaye.bsky.social · 19/02/2026
Postdoc position(s) in my section. Exciting opportunity to work as a postdoc in a Danish university with fantastic colleagues and enriching research atmosphere! Please spread the word. candidate.hr-manager.net/ApplicationI...
candidate.hr-manager.net
Postdoc position for Algebraic Complexity Theory and Theoretical Computer Science at the IT University of Copenhagen
The IT University of Copenhagen invites highly motivated individuals to apply for a Postdoc position starting in September 2026 or soon thereafter. The position
087
Nutan Limaye @nutanlimaye.bsky.social · 11/02/2026
We are organizing WACT 2026! Come to the lovely city of Copenhagen and enjoy Algebraic Complexity by the kanals! sites.google.com/view/wact2026/ Register before February 28!
sites.google.com
WACT 2026
Algebraic Complexity Theory investigates the computational complexity of algebraic problems, focusing on arithmetic circuits, polynomial computation, and algebraic models of computation. The goal is t...
151
Reposted by Nutan Limaye
IT-Universitetet i København @itu.dk · 04/02/2026
Hvor går grænserne for, hvad vi kan beregne? Det skal ITU-professor @nutanlimaye.bsky.social udforske i et nyt stort projekt støttet af @carlsbergfondet.dk 👇
itu.dk
Nutan Limaye får 12,8 millioner kroner til at udforske beregningernes grænseområde
Carlsbergfondet har tildelt professor ved IT-Universitetet, Nutan Limaye, 12,8 millioner kroner til at udvikle en ny teori om algoritmernes grænser.
0133