activity
20212026
most citedEvent knowledge in large language models: the gap between the impossible and the unlikely

6 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2026

Uniformly Weighted Graphical Designs

Zawad Chowdhury, Rekha R. Thomas

A graphical design is a subset of vertices of a graph, along with a weight for each chosen vertex, that can perfectly average chosen subspaces of functions on the graph. A design i…

math.CO2025

Obtaining the Chamanara Surface from the van der Corput sequence

Zawad Chowdhury, Francois Clement, Max Horwitz

We investigate a family of -regular graphs constructed to test for the presence of combinatorial structure in a sequence of distinct real numbers. We show that the graphs constr…

math.CO2025

Graphical Designs find Combinatorial Structures

Zawad Chowdhury, Stefan Steinerberger, Rekha R. Thomas

Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphic…

cs.CL2022★ 6 cited

Event knowledge in large language models: the gap between the impossible and the unlikely

Carina Kauf, Anna A. Ivanova, Giulia Rambelli +5

Word co-occurrence patterns in language corpora contain a surprising amount of conceptual knowledge. Large language models (LLMs), trained to predict words in context, leverage the…

math.DS2021★ 1 cited

Computing Periodic Points on Veech Surfaces

Zawad Chowdhury, Samuel Everett, Sam Freedman +1

A non-square-tiled Veech surface has finitely many periodic points, i.e., points with finite orbit under the affine automorphism group. We present an algorithm that inputs a non-sq…