2 citations · 2 across the 6 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CA2025
On a problem of Erdős and Ingham
Fredy Yip
We give a short and elementary argument answering a question of Erdős and Ingham negatively. Erdős and Ingham showed that a Tauberian estimate they considered was equivalent to the…
quant-ph2025
Combinatorial foundations for solvable chaotic local Euclidean quantum circuits in two dimensions
Fredy Yip
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph is said to be a boun…
math.CO2025
On the sum of the largest and smallest eigenvalues of graphs with high odd girth
Fredy Yip
The sum of the maximum and minimum eigenvalues, and the odd girth of a graph both measure bipartiteness. We seek to relate these measures. In particular, for an odd int…