iiinova — where your digital self keeps evolving

Gülce

@gkardesd.bsky.social

PhD candidate at CU Boulder Theory, Graduate Fellow at the Santa Fe Institute

Gülce @gkardesd.bsky.social · 30/09/2026

I woke up to learn that a problem I really cared about & worked on now has a chatgpt-proof, and the proof is unsightly, full of combinatorial optimizations that teach me nothing new about the structure of the problem, regardless of the human author’s fantastic exposition. I was reminded of this poem

150

Gülce @gkardesd.bsky.social · 30/09/2026

Also, I learned recently that Or Meir gave a wonderfully accessible talk at Cambridge on a recent work of mine with Ben Rossman on chopping games (arxiv.org/abs/2609.01759), and brought together a few strands of top-down lower bounds.

youtube.com

Prof. Or Meir | On Top-Down Lower Bound Techniques for Constant-Depth Circuits

YouTube video by INI Seminar Room 1

093

Gülce @gkardesd.bsky.social · 30/09/2026

officially entered the autumn: in the back is a photo of dear Cormac (McCarthy), whom I miss talking to in particular at the beginning of every autumn; a goldfish plant; Gaddis' and other helpful books nearby; the most well-scented candle I have ever found.

111

Gülce @gkardesd.bsky.social · 29/08/2026

New on the low-depth complexity of Group Isomorphism: the first nontrivial circuit lower bounds and quasipoly-size depth-2 1/2 upper bounds -- departing from the generator-enumerator approach underlying prior low-depth work: instead we use composition series, group extensions, & short presentations.

arxiv.org

Group Isomorphism and the Polylogarithmic-Time Hierarchy: Depth-2$\frac{1}{2}$ Circuits and Lower Bounds

In this paper, we investigate the low-depth circuit complexity of Group Isomorphism in the multiplication (Cayley) table model. We prove the first circuit lower bounds for Group Isomorphism: namely, w...

2196