Translation and modulation invariant Hilbert spaces

Let $$\mathcal H$$ H be a Hilbert space of distributions on $$\mathbf{R}^{d}$$ R d which contains at least one non-zero element of the Feichtinger algebra $$S_0$$ S 0 and is continuously embedded in $$\mathscr {D}'$$ D ′ . If $$\mathcal H$$ H is translation and modulation invariant, also in the sense of its norm, then we prove that $$\mathcal H= L^2$$ H = L 2 , with the same norm apart from a multiplicative constant.

Clique Is Hard on Average for Regular Resolution

We prove that for k ≪ 4√ n regular resolution requires length n Ω( k ) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k -clique. This lower bound is optimal up to the multiplicative constant in the exponent and also implies unconditional n Ω( k ) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.

Quantum Random Access Codes for Boolean Functions

An n↦pm random access code (RAC) is an encoding of n bits into m bits such that any initial bit can be recovered with probability at least p, while in a quantum RAC (QRAC), the n bits are encoded into m qubits. Since its proposal, the idea of RACs was generalized in many different ways, e.g. allowing the use of shared entanglement (called entanglement-assisted random access code, or simply EARAC) or recovering multiple bits instead of one. In this paper we generalize the idea of RACs to recovering the value of a given Boolean function f on any subset of fixed size of the initial bits, which we call f-random access codes. We study and give protocols for f-random access codes with classical (f-RAC) and quantum (f-QRAC) encoding, together with many different resources, e.g. private or shared randomness, shared entanglement (f-EARAC) and Popescu-Rohrlich boxes (f-PRRAC). The success probability of our protocols is characterized by the noise stability of the Boolean function f. Moreover, we give an upper bound on the success probability of any f-QRAC with shared randomness that matches its success probability up to a multiplicative constant (and f-RACs by extension), meaning that quantum protocols can only achieve a limited advantage over their classical counterparts.

Uniform point variance bounds in classical beta ensembles

In this paper, we give bounds on the variance of the number of points of the Circular and the Gaussian [Formula: see text] Ensemble in arcs of the unit circle or intervals of the real line. These bounds are logarithmic with respect to the renormalized length of these sets, which is expected to be optimal up to a multiplicative constant depending only on [Formula: see text].

A MATSUMOTO–MOSTOW RESULT FOR ZIMMER’S COCYCLES OF HYPERBOLIC LATTICES

Following the philosophy behind the theory of maximal representations, we introduce the volume of a Zimmer’s cocycle Γ × X → PO° (n, 1), where Γ is a torsion-free (non-)uniform lattice in PO° (n, 1), with n > 3, and X is a suitable standard Borel probability Γ-space. Our numerical invariant extends the volume of representations for (non-)uniform lattices to measurable cocycles and in the uniform setting it agrees with the generalized version of the Euler number of self-couplings. We prove that our volume of cocycles satisfies a Milnor–Wood type inequality in terms of the volume of the manifold Γ\ℍn. Additionally this invariant can be interpreted as a suitable multiplicative constant between bounded cohomology classes. This allows us to define a family of measurable cocycles with vanishing volume. The same interpretation enables us to characterize maximal cocycles for being cohomologous to the cocycle induced by the standard lattice embedding via a measurable map X → PO° (n, 1) with essentially constant sign.As a by-product of our rigidity result for the volume of cocycles, we give a different proof of the mapping degree theorem. This allows us to provide a complete characterization of maps homotopic to local isometries between closed hyperbolic manifolds in terms of maximal cocycles.In dimension n = 2, we introduce the notion of Euler number of measurable cocycles associated to a closed surface group and we show that it extends the classic Euler number of representations. Our Euler number agrees with the generalized version of the Euler number of self-couplings up to a multiplicative constant. Imitating the techniques developed in the case of the volume, we show a Milnor–Wood type inequality whose upper bound is given by the modulus of the Euler characteristic of the associated closed surface. This gives an alternative proof of the same result for the generalized version of the Euler number of self-couplings. Finally, using the interpretation of the Euler number as a multiplicative constant between bounded cohomology classes, we characterize maximal cocycles as those which are cohomologous to the one induced by a hyperbolization.

Black Holes and Complexity via Constructible Universe

The relation of randomness and classical algorithmic computational complexity is a vast and deep subject by itself. However, already, 1-randomness sequences call for quantum mechanics in their realization. Thus, we propose to approach black hole’s quantum computational complexity by classical computational classes and randomness classes. The model of a general black hole is proposed based on formal tools from Zermelo–Fraenkel set theory like random forcing or minimal countable constructible model Lα. The Bekenstein–Hawking proportionality rule is shown to hold up to a multiplicative constant. Higher degrees of randomness and algorithmic computational complexity are derived in the model. Directions for further studies are also formulated. The model is designed for exploring deep quantum regime of spacetime.

Mixing and average mixing times for general Markov processes

Yuval Peres and Perla Sousi showed that the mixing times and average mixing times of reversible Markov chains on finite state spaces are equal up to some universal multiplicative constant. We use tools from nonstandard analysis to extend this result to reversible Markov chains on compact state spaces that satisfy the strong Feller property.

Supersaturation of even linear cycles in linear hypergraphs

A classical result of Erdős and, independently, of Bondy and Simonovits [3] says that the maximum number of edges in an n-vertex graph not containing C2k, the cycle of length 2k, is O(n1+1/k). Simonovits established a corresponding supersaturation result for C2k’s, showing that there exist positive constants C,c depending only on k such that every n-vertex graph G with e(G)⩾ Cn1+1/k contains at least c(e(G)/v(G))2k copies of C2k, this number of copies tightly achieved by the random graph (up to a multiplicative constant).In this paper we extend Simonovits' result to a supersaturation result of r-uniform linear cycles of even length in r-uniform linear hypergraphs. Our proof is self-contained and includes the r = 2 case. As an auxiliary tool, we develop a reduction lemma from general host graphs to almost-regular host graphs that can be used for other supersaturation problems, and may therefore be of independent interest.

Stein’s method of normal approximation for dynamical systems

We present an adaptation of Stein’s method of normal approximation to the study of both discrete- and continuous-time dynamical systems. We obtain new correlation-decay conditions on dynamical systems for a multivariate central limit theorem augmented by a rate of convergence. We then present a scheme for checking these conditions in actual examples. The principal contribution of our paper is the method, which yields a convergence rate essentially with the same amount of work as the central limit theorem, together with a multiplicative constant that can be computed directly from the assumptions.