If you find any of the papers below difficult to understand, please let me know. This suggests that the paper may be poorly written, rather than the result itself being inherently difficult.

On symmetric hollow integer matrices with eigenvalues bounded from below

Zilin Jiang

arXiv preprint · 2024

Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult

Hricha Acharya, Zilin Jiang

arXiv preprint · 2024

Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below

Zilin Jiang, Alexandr Polyanskii

arXiv preprint · 2021

On the binary adder channel with complete feedback, with an application to quantitative group testing

Sam H. Florin, Matthew H. Ho, Zilin Jiang

IEEE Transactions on Information Theory · 2022 · DOI

Negligible obstructions and Turán exponents

Tao Jiang, Zilin Jiang, Jie Ma

Annals of Applied Mathematics · 2022 · DOI

An isoperimetric inequality for Hamming balls and local expansion in hypercubes

Zilin Jiang, Amir Yehudayoff

The Electronic Journal of Combinatorics · 2022 · DOI

On the metric dimension of Cartesian powers of a graph

Zilin Jiang, Nikita Polyanskii

Journal of Combinatorial Theory, Series A · 2019 · DOI

On spectral radii of unraveled balls

Zilin Jiang

Journal of Combinatorial Theory, Series B · 2019 · DOI

Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines

Zilin Jiang, Alexandr Polyanskii

Israel Journal of Mathematics · 2020 · DOI

Finding a best approximation pair of points for two polyhedra

Ron Aharoni, Yair Censor, Zilin Jiang

Computational Optimization and Applications · 2018 · DOI

Bipartite algebraic graphs without quadrilaterals

Boris Bukh, Zilin Jiang

Discrete Mathematics · 2018 · DOI

A slight improvement to the colored Bárány's theorem

Zilin Jiang

The Electronic Journal of Combinatorics · 2014 · DOI

A bound on the number of edges in graphs without an even cycle

Boris Bukh, Zilin Jiang

Combinatorics, Probability and Computing · 2017 · DOI · ERRATUM