FAEDKV compresses the KV cache by keeping the most important Fourier-frequency components of cached keys and values, reporting gains over eviction baselines on LongBench and position-flat retrieval on needle-in-a-haystack tests.
Quandle Coloring Quivers of general Torus links by dihedral quandles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We completely characterize the coloring quivers of general torus links by dihedral quandles by first exhausting all possible numbers of colorings, followed by determining the interconnections between colorings in each case. The quiver is obtained as function of the number of colorings. The quiver always contains complete subgraphs, in particular a complete subgraph corresponding to the trivial colorings, but the total number of subgraphs in the quiver and the weights of their edges varies depending on the number of colorings.
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression
FAEDKV compresses the KV cache by keeping the most important Fourier-frequency components of cached keys and values, reporting gains over eviction baselines on LongBench and position-flat retrieval on needle-in-a-haystack tests.