Related papers: Probabilistic construction of some extremal $p$-gr…

We construct maximal $\Lambda(p)$-subsets on a large class of curved manifolds, in an optimal range of Lebesgue exponents $p$. Our arguments combine restriction estimates and decoupling with old and new probabilistic estimates.

Quadratic conjecture is a strengthening of oliver's $p$-group conjecture. Let $G$ be a $p$-group of maximal class of order $p^n$. We prove that if $n\le 8$ or $n\ge \max\{2p-6,p+2\}$ then $G$ satisfies Quadratic Conjecture. Hence quadratic…

The graph G(p) associated with the p-groups of maximal class is a major tool in their classification. We introduce a subgraph of the graph G(p) called its frame. Its construction is based on the Lazard correspondence. We show that every…

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…

A group is called capable if it is a central factor group. For each prime $p$ and positive integer $c$, we prove the existence of a capable $p$-group of class $c$ minimally generated by an element of order $p$ and an element of order…

We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…

Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…

A finite $p$-group $G$ is called \textit{powerful} if either $p$ is odd and $[G,G]\subseteq G^p$ or $p=2$ and $[G,G]\subseteq G^4$. A {\em{cover}} for a group is a collection of subgroups whose union is equal to the entire group. We will…

The biclique partition number of a graph $G= (V,E)$, denoted $bp(G)$, is 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 $…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

We consider Arveson's problem on the maximality of subdiagonal algebras. We prove that a subdiagonal algebra is maximal if it is invariant under the modular group of a faithful normal state which is preserved by the conditional expectation…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

One of the aims of this paper is to obtain structural results showing that powerful subgroups are abundant in pro-$p$ groups admitting certain powerful quotients. In particular, we obtain an analogue of Baer's theorem for powerful pro-$p$…

We give a new computer-assisted proof of the classification of maximal subgroups of the simple group ${}^2E_6(2)$ and its extensions by any subgroup of the outer automorphism group $S_3$. This is not a new result, but no earlier proof…

We consider the near-critical Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ and provide a new probabilistic proof of the fact that, when $p$ is of the form $p=p(n)=1/n+\lambda/n^{4/3}$ and $A$ is large,…

We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…

In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G.…

We construct, for the first time, various types of specific non-special finite $p$-groups having abelian automorphism group. More specifically, we construct groups $G$ with abelian automorphism group such that $\gamma_2(G) < \mathrm{Z}(G) <…