Publications (5)
Generating Symbolic World Models via Test-time Scaling of Large Language Models
Zhouliang Yu, Yuhuan Yuan, Tim Z. Xiao +5
Solving complex planning problems requires Large Language Models (LLMs) to explicitly model the state transition to avoid rule violations, comply with constraints, and ensure optim…
All eigenvalues of the blowup of a graph
Ge Lin, Changjiang Bu
The -blowup of a graph () is the -uniform hypergraph obtained by replacing each vertex with a set of size and preserving the adjacency relation. In this paper, w…
The characteristic polynomial of sunflowers
Changjiang Bu, Lixiang Chen, Ge Lin
A uniform hypergraph is called a sunflower if all of its hyperedges intersect in the same set of vertices. In this paper, we determine the eigenvalues and spectral moments of a sun…
The multiplicity of the zero Laplacian eigenvalue of uniform hypertrees
Ge Lin, Changjiang Bu
In this paper, the Laplacian characteristic polynomial of uniform hypergraphs with cut vertices or pendant edges and the Laplacian matching polynomial of uniform hypergraphs are ch…
Generalized k-Means in GLMs with Applications to the Outbreak of COVID-19 in the United States
Tonglin Zhang, Ge Lin
Generalized -means can be incorporated with any similarity or dissimilarity measure for clustering. By choosing the dissimilarity measure as the well known likelihood ratio or $…