Related papers: On a Cohen-Lenstra Heuristic for Jacobians of Rand…

In this paper, we study the combinatorial relations between the cokernels $\text{cok}(A_n+px_iI_n)$ ($1 \le i \le m$) where $A_n$ is an $n \times n$ matrix over the ring of $p$-adic integers $\mathbb{Z}_p$, $I_n$ is the $n \times n$…

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

This paper considers random matrices distributed according to Haar measure in different classical compact groups. Utilizing the determinantal point structures of their nontrivial eigenangles, with respect to the $L_1$-Wasserstein distance,…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

We give effective estimates for the $l^1$-distance between the corank distribution of $r \times r$ R\'edei matrices and the measure predicted by the Cohen--Lenstra heuristics. To this end we pinpoint a class of stochastic processes, which…

We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…

Ensembles of complex symmetric, and complex self dual random matrices are known to exhibit local statistical properties distinct from those of the non-Hermitian Ginibre ensembles. On the other hand, in distinction to the latter, the joint…

We determine the large-genus limiting distribution of the 4-rank of the Picard group of hyperelliptic curves over a fixed finite field $\mathbb F_q$ of odd characteristic. This is a function field analogue of a result of Fouvry and…

For random integer matrices $M_1,\ldots,M_k \in \operatorname{Mat}_n(\mathbb{Z})$ with independent entries, we study the distribution of the cokernel $\operatorname{cok}(M_1 \cdots M_k)$ of their product. We show that this distribution…

The Jacobi ensemble is one of the classical ensembles of random matrix theory. Prominent in applications are properties of the eigenvalues at the spectrum edge, specifically the distribution of the largest (e.g. Roy's largest root test in…

A Kronecker product model is the set of visible marginal probability distributions of an exponential family whose sufficient statistics matrix factorizes as a Kronecker product of two matrices, one for the visible variables and one for the…

Let $C$ be a smooth projective curve of genus $g \ge 1$ over a finite field $\F$ of cardinality $q$. In this paper, we first study $\#\J_C$, the size of the Jacobian of $C$ over $\F$ in case that $\F(C)/\F(X)$ is a geometric Galois…

Most graph kernels are an instance of the class of $\mathcal{R}$-Convolution kernels, which measure the similarity of objects by comparing their substructures. Despite their empirical success, most graph kernels use a naive aggregation of…

A smooth complex variety satisfies the Generalized Jacobian Conjecture if all its \'etale endomorphisms are proper. We study the conjecture for $\mathbb{Q}$-acyclic surfaces of negative Kodaira dimension. We show that $G$-equivariant…

We suggest a relatively simple and totally geometric conjectural description of uncolored DAHA superpolynomials of arbitrary algebraic knots (conjecturally coinciding with the reduced stable Khovanov-Rozansky polynomials) via the flagged…

Given a principally polarized abelian variety $A$ of dimension $g$ over an algebraically closed field $k$ of characteristic $p$, the $p$ torsion $A[p]$ is a finite flat $p$-torsion group scheme of rank $p^{2g}$. There are exactly $2^g$…

Estimating the probability that the Erd\H{o}s-R\'enyi random graph $G(n,m)$ is $H$-free, for a fixed graph $H$, is one of the fundamental problems in random graph theory. If $m$ is such that each edge of $G(n,m)$ belongs to a copy of $H'$…

This paper provides a probabilistic algorithm to determine generators of the m-torsion subgroup of the Jacobian of a hyperelliptic curve of genus two.

Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…

Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…