We translate inequalities and conjectures for immanants and generalized matrix functions into inequalities in the Löwner order. These have the form of trace polynomials and generalize the inequalities from [FH, J. Math. Phys. 62 (2021), 2, 022203].

Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense graphs, two such properties known as spectral expansion and uniformity were shown to be equivalent in seminal 1989 work of Chung, Graham and Wilson. Recently, Conlon and Zhao extended this equivalence to the case of sparse vertex transitive graphs using the famous Grothendieck …

The entropic uncertainty relation proven by Maassen and Uffink for arbitrary pairs of two observables is known to be nonoptimal. Here, we call an uncertainty relation optimal, if the lower bound can be attained for any value of either of the corresponding uncertainties. In this work, we establish optimal uncertainty relations by characterizing the optimal lower bound in scenarios similar to the Maassen–Uffink type. We disprove a conjecture by Englert et al. and generalize various previous results. However, we are …