Related papers: The probability that a character value is zero for…

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

We show that the probability that a random graph $G\sim G(n,p)$ contains no Hamilton cycle is $(1+o(1))Pr(\delta (G) < 2)$ for all values of $p = p(n)$. We also prove an analogous result for perfect matchings.

We show that for any $n\geq 2$, two elements selected uniformly at random from a \emph{symmetrized} Euclidean ball of radius $X$ in $\textrm{SL}_n(\mathbb Z)$ will generate a thin free group with probability tending to $1$ as $X\rightarrow…

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the…

Shelah Spencer [ShSp:304] proved the 0-1 law for the random graphs G(n,p_n), p_n=n^{- alpha}, alpha in (0,1) irrational (set of nodes in [n]= {1, ...,n}, the edges are drawn independently, probability of edge is p_n). One may wonder what…

For $G={\rm GL}(n,q)$, the proportion $P_{n,q}$ of pairs $(\chi,g)$ in ${\rm Irr}(G)\times G$ with $\chi(g)\neq 0$ satisfies $P_{n,q}\to 0$ as $n\to\infty$.

Given a sequence $(X_n)$ of symmetrical random variables taking values in a Hilbert space, an interesting open problem is to determine the conditions under which the series $\sum_{n=1}^\infty X_n$ is almost surely convergent. For…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

We prove the following exponential inequality: Let $n\geq 1$ and let $X_1,...,X_n$ be $n$ independent identically distributed symmetric real-valued random variables. For any $x,y>0$, we have \[\mathbb{P}\big({X_1+...+X_n}\geq x,\,…

We study the singularity probability of random integer matrices. Concretely, the probability that a random $n \times n$ matrix, with integer entries chosen uniformly from $\{-m,\ldots,m\}$, is singular. This problem has been well studied in…

We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…

We give the classification of thick representations and dense representations of the symmetric group over a field of characteristic zero.

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…

Fix a positive integer $N$. Select an additive composition $\xi$ of $N$ uniformly out of $2^{N-1}$ possibilities. The interplay between the number of parts in $\xi$ and the maximum part in $\xi$ is our focus. It is not surprising that…

Let $G$ be a finite symmetric, general linear, or general unitary group defined over a field of characteristic coprime to $3$. We construct a canonical correspondence between irreducible characters of degree coprime to $3$ of $G$ and those…

Let $q$ be a prime power, and $d$ a positive integer. We study the proportion of irreducible characters of $\mathrm{GL}(n,q)$ whose values evaluated on a fixed matrix $g$ are divisible by $d$. As $n$ approaches infinity, this proportion…

In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.

We determine what are the fields of values of the irreducible $p$-height zero characters of all finite groups for $p=2$; we conjecture what they should be for odd primes, and reduce this statement to a problem on blocks of quasi-simple…

Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…