Related papers: Khintchine inequalities, trace monoids and Tur\'an…
Normalized free semi-circular random variables satisfy an upper Khintchine inequality in $L_\infty$. We show that this implies the corresponding upper Khintchine inequality in any noncommutative Banach function space. As applications, we…
Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of size $t$ in a graph of a fixed order that does not contain…
We study the spectra of quantum graphs with the method of trace identities (sum rules), which are used to derive inequalities of Lieb-Thirring, Payne-P\'olya-Weinberger, and Yang types, among others. We show that the sharp constants of…
It is well known that spectral Tur\'{a}n type problem is one of the most classical {problems} in graph theory. In this paper, we consider the spectral Tur\'{a}n type problem. Let $G$ be a graph and let $\mathcal{G}$ be a set of graphs, we…
A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent…
A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…
We investigate natural Tur\'an problems for mixed graphs, generalizations of graphs where edges can be either directed or undirected. We study a natural \textit{Tur\'an density coefficient} that measures how large a fraction of directed…
Classical questions in extremal graph theory concern the asymptotics of $\operatorname{ex}(G, \mathcal{H})$ where $\mathcal{H}$ is a fixed family of graphs and $G=G_n$ is taken from a `standard' increasing sequence of host graphs $(G_1,…
We prove disjointification inequalities due to Johnson and Schechtman for noncommutative random variables independent in the sense of Junge and Xu. In the same setting, we also prove noncommutative Khinchine inequalities. These inequalities…
Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…
We exhibit several bounds for operator norms of the sum of $\epsilon$-free semicircular random variables introduced in the paper of Speicher and Wysocza\'{n}ski. In particular, using the first and second largest eigenvalues of the adjacency…
Alon, Balogh, Keevash and Sudakov proved that the $(k-1)$-partite Tur\'an graph maximizes the number of distinct $r$-edge-colorings with no monochromatic $K_k$ for all fixed $k$ and $r=2,3$, among all $n$-vertex graphs. In this paper, we…
The Tur\'an problem asks for the largest number of edges in an $n$-vertex graph not containing a fixed forbidden subgraph $F$. We construct a new family of graphs not containing $K_{s,t}$, for $t= C^s$, with $\Omega(n^{2-1/s})$ edges…
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…
The classical spectral Tur\'{a}n problem is to determine the maximum spectral radius of an $\mathcal{F}$-free graph of order $n$. Zhai and Wang [Linear Algebra Appl, 437 (2012) 1641-1647] determined the maximum spectral radius of…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
We prove a noncommutative $(p,p)$-Poincar\'e inequality for trace-symmetric quantum Markov semigroups on tracial von Neumann algebras, assuming only the existence of a spectral gap. Extending semi-commutative results of Huang and Tropp, our…
We investigate the extremal values of partial traces of matrix tensors under operator norm constraints. To evaluate these multi-linear quantities, we develop a comprehensive graphical formalism that encodes multi-leg partial traces, partial…
A classical Tur\'an problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph $H$ as a subgraph. It is well-known that the chromatic number of $H$ is the graph parameter which…
Let E be a separable (or the dual of a separable) symmetric function space, let M be a semifinite von Neumann algebra and let E(M) be the associated noncommutative function space. Let $(\epsilon_k)_k$ be a Rademacher sequence, on some…