Algebra / Number Theory / Combinatorics Seminar

In this talk we will consider some notions of `robustness' of graph/hypergraph properties. We will survey some existing results and will try to emphasize the following new result (joint with Adva Mond and Kaarel Haenni): The binomial random digraph $D_{n,p}$ typically contains the minimum between the minimum out- and in-degrees many edge-disjoint Hamilton cycles, given […]

Given a prime p, let P(t) be a non-constant monic polynomial in t over the ring of p-adic integers. Let X(n) be an n x n uniformly random (0,1)-matrix over the same ring. We compute the asymptotic distribution of the cokernel of P(X(n)) as n goes to infinity. When P(t) is square-free modulo p, this […]