Related papers: A Coupling, and the Darling-Erdos Conjectures

For $x\in [0,1],$ the run-length function $r_n(x)$ is defined as the length of the longest run of $1$'s amongst the first $n$ dyadic digits in the dyadic expansion of $x.$ Erd\H{o}s and R\'enyi proved that…

We show that the state with the highest known average two-particle von Neumann entanglement entropy proposed by Sudbery and one of the authors gives a local maximum of this entropy. We also show that this is not the case for an alternative…

For 24 years, it has been an open problem to obtain improved bounds, for the maximal function over a sparse sequence of discrete spherical averages, going beyond the range for the full discrete spherical maximal function. I formulate a…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

We revisit the elementary problem of moving a particle in a harmonic trap in finite time with minimal work cost, and extend it to the case of an active particle. By comparing the Gaussian case of an Active Ornstein-Uhlenbeck particle and…

We study the maximum of a Brownian motion with a parabolic drift; this is a random variable that often occurs as a limit of the maximum of discrete processes whose expectations have a maximum at an interior point. We give series expansions…

A family of sets is intersecting if every pair of its members has an element in common. Such a family of sets is called a star if some element is in every set of the family. Given a graph $G$, let $\mu(G)$ denote the size of the smallest…

A novel approach is proposed to establish a sharp upper bound on the expected supremum of a separable martingale random field, serving as an alternative to classical universal chaining-based methods. The proposed approach begins by deriving…

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

We give Sir James Jeans's notion of 'normal state' a mathematically precise definition. We prove that normal cells of trajectories exist in the Hamiltonian heat-bath model of an assembly of linearly coupled oscillators that generates the…

Using recent couplings we provide counterexamples to monotonicity properties of percolation models related to graphical representations of the Ising model. We further prove a new coupling of the double random current model to the…

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

The coexistence of infinitely many attractors is called extreme multistability in dynamical systems. In coupled systems, this phenomenon is closely related to partial synchrony and characterized by the emergence of a conserved quantity. We…

The superconducting phase of the 2D one-band Hubbard model is studied within the FLEX approximation and by using an Eliashberg theory. We investigate the doping dependence of $T_c$, of the gap function $\Delta ({\bf k},\omega)$ and of the…

We expose the information flow capabilities of pure bipartite entanglement as a theorem -- which embodies the exact statement on the `seemingly acausal flow of information' in protocols such as teleportation. We use this theorem to…

We resolve a long-standing conjecture of Wilson (2004), reiterated by Oliveira (2016), asserting that the mixing-time of the unit-rate Interchange Process on the $n$-dimensional hypercube is of order $n$. This follows from a sharp…

In this work, we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin-Iosifescu…

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

First, we give a closed-form formula for first passage time of a reflected Brownian motion with drift. This modifies a formula by Perry et al (2004). Second, we show that the maximum before a fixed drawdown is exponentially distributed for…

The notion of "paired" fermions is central to important condensed matter phenomena such as superconductivity and superfluidity. While the concept is widely used and its physical meaning is clear there exists no systematic and mathematical…