3 papers
math.NT2026
A statistical model for points expanding in higher dimensions while being tied to bijective involutions
Cristian Cobeli, The Nguyen, Alexandru Zaharescu
Let be a set with elements, let be a bijective involution, and let~ be the set of sequences $(x_1,\dot…
math.CO2025
Improving Uniquely Decodable Codes in Binary Adder Channels
József Balogh, The Nguyen, Patric R. J. Ostergard +2
We present a general method to modify existing uniquely decodable codes in the -user binary adder channel. If at least one of the original constituent codes does not have averag…
math.CO2024
Clique covers and decompositions of cliques of graphs
József Balogh, Jialin He, Robert A. Krueger +2
In 1966, ErdÅs, Goodman, and Pósa showed that if is an -vertex graph, then at most cliques of are needed to cover the edges of , and the bou…