Related papers: The Global Cohen-Lenstra Heuristic

We define a group with local data over a number field $K$ as a group $G$ together with homomorphisms from decomposition groups ${\rm Gal}(\overline{K}_p/K_p)\to G$. Such groups resemble Galois groups, just without global information.…

We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a…

We extend the Cohen-Lenstra heuristics to the setting of ray class groups of imaginary quadratic number fields, viewed as exact sequences of Galois modules. By asymptotically estimating the mixed moments governing the distribution of a…

Kac's lemma determines the expected return time to a set of positive measure under iterations of an ergodic probability preserving transformations. We introduce the notion of an \emph{allocation} for a probability preserving action of a…

In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…

Boston, Bush, and Hajir have developed heuristics, extending the Cohen-Lenstra heuristics, that conjecture the distribution of the Galois groups of the maximal unramified pro-p extensions of imaginary quadratic number fields for p an odd…

The predictability of a sequence is defined as the asymptotic performance of the best performing predictor in a given class. The value of the predictability of a sequence will in general depend on the choice of this predictor class. The…

Ellenberg, Venkatesh, and Westerland have established a weak form of the function field analogue of the Cohen--Lenstra heuristic, on the distribution of imaginary number fields with $\ell$-parts of their class groups isomorphic to a fixed…

We give a new geometric description of when an element of the class group of a quadratic field, thought of as a quadratic form $q$, is $n$-torsion. We show that $q$ corresponds to an $n$-torsion element if and only if there exists a degree…

A random set is a generalisation of a random variable, i.e. a set-valued random variable. The random set theory allows a unification of other uncertainty descriptions such as interval variable, mass belief function in Dempster-Shafer theory…

We prove the bulk universality of the $\beta$-ensembles with non-convex regular analytic potentials for any $\beta>0$. This removes the convexity assumption appeared in our earlier work. The convexity condition enabled us to use the…

It is conjectured that within the class group of any number field, for every integer $\ell \geq 1$, the $\ell$-torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the…

For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it is cyclic. This includes the probability that…

For a Galois extension $K/\mathbb{F}_q(t)$ of Galois group $\Gamma$ with $\gcd(q,|\Gamma|)=1$, we define an invariant $\omega_K$, and show that it determines the Weil pairing of the curve corresponding to $K$ and it descends to the…

In non-relativistic as well as in special relativistic quantum theory, {\em mass} and {\em charge} are {\em pure numbers} appearing in various (quantum) operators and admit {\em any values}, {\it ie}, values for these quantities are to be…

We examine the existence of universal elements in classes of infinite abelian groups. The main method is using group invariants which are defined relative to club guessing sequences. We prove, for example: Theorem: For $n\ge 2$, there is a…

Multi-class classification methods that produce sets of probabilistic classifiers, such as ensemble learning methods, are able to model aleatoric and epistemic uncertainty. Aleatoric uncertainty is then typically quantified via the Bayes…

The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…

Is it a good idea to use the frequency of events in the past, as a guide to their frequency in the future (as we all do anyway)? In this paper the question is attacked from the perspective of universal prediction of individual sequences. It…

We observe that Anzanello's work on the proportion of derangements in affine classical groups over finite fields is related to symplectic and orthogonal Cohen-Lenstra type distributions on integer partitions. This leads to a proof of three…