Jensen Functional, Quasi-Arithmetic Mean and Sharp Converses of Hölder’s Inequalities

In this article, we give sharp two-sided bounds for the generalized Jensen functional Jn(f,g,h;p,x). Assuming convexity/concavity of the generating function h, we give exact bounds for the generalized quasi-arithmetic mean An(h;p,x). In particular, exact bounds are determined for the generalized power means in terms from the class of Stolarsky means. As a consequence, some sharp converses of the famous Hölder’s inequality are obtained.

Global Bounds for the Generalized Jensen Functional with Applications

In this article we give sharp global bounds for the generalized Jensen functional Jn(g,h;p,x). In particular, exact bounds are determined for the generalized power mean in terms from the class of Stolarsky means. As a consequence, we obtain the best possible global converses of quotients and differences of the generalized arithmetic, geometric and harmonic means.

Dispersion relations and exact bounds on CFT correlators

We derive new crossing-symmetric dispersion formulae for CFT correlators restricted to the line. The formulae are equivalent to the sum rules implied by what we call master functionals, which are analytic extremal functionals which act on the crossing equation. The dispersion relations provide an equivalent formulation of the constraints of the Polyakov bootstrap and hence of crossing symmetry on the line. The built in positivity properties imply simple and exact lower and upper bounds on the values of general CFT correlators on the Euclidean section, which are saturated by generalized free fields. Besides bounds on correlators, we apply this technology to determine new universal constraints on the Regge limit of arbitrary CFTs and obtain very simple and accurate representations of the 3d Ising spin correlator.

Exponential multivalued forbidden configurations

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory. Recently, this function was extended to $r$-matrices, whose entries lie in $\{0,1,\dots,r-1\}$. The combinatorics of the generalized forbidden number is less well-studied. In this paper, we provide exact bounds for many $(0,1)$-matrices $F$, including all $2$-rowed matrices when $r > 3$. We also prove a stability result for the $2\times 2$ identity matrix. Along the way, we expose some interesting qualitative differences between the cases $r=2$, $r = 3$, and $r > 3$. Comment: 12 pages; v3: formatted for DMTCS; v2: Corollary 3.2 added, typos fixed, some proofs clarified

Solovay–Kitaev Approximations of Special Orthogonal Matrices

The circuit-gate framework of quantum computing relies on the fact that an arbitrary quantum gate in the form of a unitary matrix of unit determinant can be approximated to a desired accuracy by a fairly short sequence of basic gates, of which the exact bounds are provided by the Solovay–Kitaev theorem. In this work, we show that a version of this theorem is applicable to orthogonal matrices with unit determinant as well, indicating the possibility of using orthogonal matrices for efficient computation. We further develop a version of the Solovay–Kitaev algorithm and discuss the computational experience.

Tight typings and split bounds, fully developed

Multi types – aka non-idempotent intersection types – have been used. to obtain quantitative bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the same time the number of evaluation steps and the size of the result. Recent results show that the number of steps can be taken as a reasonable time complexity measure. At the same time, however, these results suggest that multi types provide quite lax complexity bounds, because the size of the result can be exponentially bigger than the number of steps. Starting from this observation, we refine and generalise a technique introduced by Bernadet and Graham-Lengrand to provide exact bounds. Our typing judgements carry counters, one measuring evaluation lengths and the other measuring result sizes. In order to emphasise the modularity of the approach, we provide exact bounds for four evaluation strategies, both in the λ-calculus (head, leftmost-outermost, and maximal evaluation) and in the linear substitution calculus (linear head evaluation). Our work aims at both capturing the results in the literature and extending them with new outcomes. Concerning the literature, it unifies de Carvalho and Bernadet & Graham-Lengrand via a uniform technique and a complexity-based perspective. The two main novelties are exact split bounds for the leftmost strategy – the only known strategy that evaluates terms to full normal forms and provides a reasonable complexity measure – and the observation that the computing device hidden behind multi types is the notion of substitution at a distance, as implemented by the linear substitution calculus.