Related papers: Notes on switching lemmas

We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…

Proof formats for SAT solvers have diversified over the last decade, enabling new features such as extended resolution-like capabilities, very general extension-free rules, inclusion of proof hints, and pseudo-boolean reasoning.…

Formal reasoning about hashing-based probabilistic data structures often requires reasoning about random variables where when one variable gets larger (such as the number of elements hashed into one bucket), the others tend to be smaller…

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…

Beck's distributive laws provide sufficient conditions under which two monads can be composed, and monads arising from distributive laws have many desirable theoretical properties. Unfortunately, finding and verifying distributive laws, or…

We establish statistical limit theorems for equilibrium states of Axiom A diffeomorphisms, derived from the spectral gap of the Ruelle transfer operator established in Part I (Thiam2026a) and transferred to smooth dynamics through the…

It was proved by Maksimova in 1977 that exactly eight varieties of Heyting algebras have the amalgamation property, and hence exactly eight axiomatic extensions of intuitionistic propositional logic have the deductive interpolation…

Let $B(n,p)$ denote a binomial random variable with parameters $n$ and $p$. Chv\'{a}tal's theorem says that for any fixed $n\geq 2$, as $m$ ranges over $\{0,1,\ldots,n\}$, the probability $q_m:=P(B(n,m/n)\leq m)$ is the smallest when $m$ is…

This paper consists of a proof of a multivariate Central Limit Theorem for "rectangular" sums of dependent complex-valued, rho-prime-mixing random variables indexed by Z^d.

Let $\{T_{k}\}_{k=1}^{\infty}$ be a family of *--free identically distributed operators in a finite von Neumann algebra. In this work we prove a multiplicative version of the free central limit Theorem. More precisely, let…

Selective classification enhances the reliability of predictive models by allowing them to abstain from making uncertain predictions. In this work, we revisit the design of optimal selection functions through the lens of the Neyman--Pearson…

Testing for regime switching when the regime switching probabilities are specified either as constants (`mixture models') or are governed by a finite-state Markov chain (`Markov switching models') are long-standing problems that have also…

We analyze the average behavior of various arithmetic functions at the values of degree $d$ binary forms ordered by height, with probability $1$. This approach yields averaged versions of the Chowla conjecture and the Bateman-Horn…

Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…

In this paper we use the Lyndon-Shirshov basis to study the shuffle type polynomials. We give a free noncommutative binomial (or multinomial) theorem in terms of the Lyndon-Shirshov basis. Another noncommutative binomial theorem given by…

This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the…

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

In this paper we present a study about minima among random variables, about the context of voting theory, and about paradoxes related with such topics. In the field of reliability theory, the term load-sharing model is commonly used to…

We prove the following analogue of the classical Skitovich--Darmois theorem for complex random variables. Let $\alpha=a+ib$ be a nonzero complex number. Then the following statements hold. $1$. Let either $b\ne 0$, or $b=0$ and $a>0$. Let…