Related papers: Khintchine inequalities, trace monoids and Tur\'an…

Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…

Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…

We investigate two conjectured spectral graph theoretic strengthenings of Tur\'an's theorem. Let $\mu_1 \ge \ldots \ge \mu_n$ denote the eigenvalues of a graph $G$ with $n$ vertices, $m$ edges and clique number $\omega(G)$. The concise…

A seminal open question of Pisier and Mendel--Naor asks whether every degree-regular graph which satisfies the classical discrete Poincar\'e inequality for scalar functions, also satisfies an analogous inequality for functions taking values…

We study when local reduced density operators, viewed as quantum marginals, can be assembled into a global quantum state with a prescribed Markov structure. The starting point is a canonical logarithmic construction $T(\mathcal R)$, the…

Using the Gille-Merkurjev norm principle we compute in a uniform way the image of the degree map for quadrics (Springer's theorem), for twisted forms of maximal orthogonal Grassmannians (theorem of Bayer-Fluckiger and Lenstra), for E6-…

The paper establishes the Krein and Koplienko trace formulas for multivariable operator functions on symmetrically normed ideals of bounded operators. Results are proved for self-adjoint and maximal dissipative operators. They cover both…

We consider an infinite version of the bipartite Tur\'{a}n problem. Let $G$ be an infinite graph with $V(G) = \mathbb{N}$ and let $G_n$ be the $n$-vertex subgraph of $G$ induced by the vertices $\{1,2, \dots, n \}$. We show that if $G$ is…

A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…

Motivated by recent progress in quantum information theory, this article aims at optimizing trace polynomials, i.e., polynomials in noncommuting variables and traces of their products. A novel Positivstellensatz certifying positivity of…

For given graphs $G$ and $F$, the Tur\'an number $ex(G,F)$ is defined to be the maximum number of edges in an $F$-free subgraph of $G$. Foucaud, Krivelevich and Perarnau and later independently Briggs and Cox introduced a dual version of…

We prove several trace inequalities that extend the Araki Lieb Thirring (ALT) inequality, Golden Thompson (GT) inequality and logarithmic trace inequality to arbitrary many tensors. Our approaches rely on complex interpolation theory as…

Statistical topography of two-dimensional interfaces in the presence of quenched disorder is studied utilizing combinatorial optimization algorithms. Finite-size scaling is used to measure geometrical exponents associated with contour loops…

We investigate quantised maps of the torus whose classical analogues are ergodic but not mixing. Their quantum spectral statistics shows non-generic behaviour, i.e.it does not follow random matrix theory (RMT). By coupling the map to a spin…

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a…

This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…

Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle, or (ii) without an oriented triangle. We give an answer to…

Let $G$ be a graph of order $n$, and let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_\alpha (G)$ of $A (G)$ and $D (G) $ by $$A_\alpha (G)=\alpha…

Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem, maximizing the number of cliques of a fixed order in a graph with fixed number of vertices and…

Given $p\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\ldots,d_n$, let $e_p(G)=\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\'an-type problem for $e_p(G)$: given $p\geq 0$, how large can $e_p(G)$ be if $G$ has no…