Related papers: When Do Random Subsets Decompose a Finite Group?

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Consider two urns, $A$ and $B$, where initially $A$ contains a large number $n$ of balls and $B$ is empty. At each step, with equal probability, either we pick a ball at random in $A$ and place it in $B$, or vice-versa (provided of course…

Let C be a non-empty finite set, and Gamma a subgroup of the symmetric group S(C). Given a bijection f:A cross C to B cross C, the problem of Gamma-equivariant division is to find a quotient bijection h:A to B respecting whatever symmetries…

We consider the analogy between the topological phase transition which occurs as a function of spatial coordinate on a surface of a non-trivial insulator, and the one which occurs in the bulk due to the change of internal parameters (such…

This is a summarising investigation of the events of the phase transition of the first order that occur in the critical region below the liquid-gas critical point. The grand partition function has been completely integrated in the…

In the canonical formalism of statistical physics, a signature of a first order phase transition for finite systems is the bimodal distribution of an order parameter. Previous thermodynamical studies of nuclear sources produced in heavy-ion…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with…

The dipole-coupled two-level atoms(qubits) in a single-mode resonant cavity is studied by extended bosonic coherent states. The numerically exact solution is presented. For finite systems, the first-order quantum phase transitions occur at…

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…

Given two subgroups $H,K$ of a finite group $G$, the probability that a pair of random elements from $H$ and $K$ commutes is denoted by $Pr(H,K)$. Suppose that a finite group $G$ admits a group of coprime automorphisms $A$ and let…

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…

We first obtain explicit upper bounds for the proportion of elements in a finite classical group G with a given characteristic polynomial. We use this to complete the proof that the proportion of elements of a finite classical group G which…

We study the probability that a real stationary Gaussian process has at least $\eta T$ zeros in $[0,T]$ (overcrowding), or at most this number (undercrowding). We show that if the spectral measure of the process is supported on $\pm[B,A]$,…

We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…

Let $G$ be a $\sigma$-finite abelian group, i.e. $G=\bigcup_{n\geq 1} G_n$ where $(G_n)_{n\geq 1}$ is a non decreasing sequence of finite subgroups. For any $A\subset G$, let $\underline{\mathrm{d}}(A):=\liminf_{n\to\infty}\frac{|A\cap…

A group is $G$ commutative transitive or CT if commuting is transitive on nontrivial elements. A group $G$ is CSA or conjugately separated abelian if maximal abelian subgroups are malnormal. These concepts have played a prominent role in…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…