6 papers
A note on the Björner--Kalai theorem
Xiongfeng Zhan, Xueyi Huang
In 1988, Björner and Kalai used combinatorial shadow functions to characterize the maximal Betti sequence for a given -vector and the minimal -vector for a given Betti seque…
Eigenvalue bounds for combinatorial Laplacians and an application to random complexes
Xiongfeng Zhan, Xueyi Huang, Jin-Xin Zhou
This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes…
Combinatorial Laplacians and Relative Homology of Complex Pairs
Xiongfeng Zhan, Xueyi Huang, Lu Lu
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians…
Fractional revival on quasi-abelian Cayley graphs
Yi Fang, Xueyi Huang, Xiaogang Liu +1
Fractional revival, a quantum transport phenomenon critical to entanglement generation in quantum spin networks, generalizes the notion of perfect state transfer on graphs. A Cayle…
An Extension of Pólya's Enumeration Theorem
Xiongfeng Zhan, Xueyi Huang
In combinatorics, Pólya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds…
Fourier analysis on distance-regular Cayley graphs over abelian groups
Xiongfeng Zhan, Xueyi Huang, Lu Lu
The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past hal…