{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreicucyslkdyx2pkedudajpznbjg4dqwlm5plyu7pxhlj6kaumra7se",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mk57z5swpbk2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.20575v1",
  "publishedAt": "2026-04-23T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Pratik Shastri"
  ],
  "textContent": "**Authors:** Pratik Shastri\n\nWe prove that every fan-in $2$ noncommutative arithmetic circuit computing the palindrome polynomial has size $Ω(n^2)$. The proof builds on and refines a previous work of the author. The new ingredients in the proof were generated by Gemini 3.1 Pro.",
  "title": "A Quadratic Lower Bound for Noncommutative Circuits"
}