64 citations · 436 across the 35 of their papers we have counts for
41 papers
Asymptotic completions of preordered semirings
Péter Vrana
The study of preordered semirings is motivated by applications in computer science, graph theory, and information theory, and provides tools for understanding the asymptotic preord…
Asymptotic tensor rank is characterized by polynomials
Matthias Christandl, Koen Hoeberechts, Harold Nieuwboer +2
Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the matrix multiplication tensor would determine the matrix multiplicati…
Explicit error bounds for entanglement transformations between sparse multipartite states
Dávid Bugár, Péter Vrana
The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle…
Interpolating between Rényi entanglement entropies for arbitrary bipartitions via operator geometric means
Dávid Bugár, Péter Vrana
The asymptotic restriction problem for tensors can be reduced to finding all parameters that are normalized, monotone under restrictions, additive under direct sums and multiplicat…
Asymptotic equipartition property for a Markov source having ambiguous alphabet
Tamás Tasnádi, Péter Vrana
We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sourc…
Noncommutative extensions of parameters in the asymptotic spectrum of graphs
Péter Vrana
The zero-error capacity of a classical channel is a parameter of its confusability graph, and is equal to the minimum of the values of graph parameters that are additive under the…