English
Related papers

Related papers: An asymptotic for the Hall--Paige conjecture

200 papers

We show that every complete $n$-vertex simple topological graph contains a topological subgraph on at least $(\log n)^{1/4 - o(1)}$ vertices that is weakly isomorphic to the complete convex geometric graph or the complete twisted graph.…

Combinatorics · Mathematics 2022-09-08 Andrew Suk , Ji Zeng

Let $\pi$ be a set of primes containing $2$ and an odd prime $p$. It is proved that if a finite group $G$ has a Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The…

Group Theory · Mathematics 2026-05-12 Evgeny Khukhro , Pavel Shumyatsky

Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…

Logic · Mathematics 2023-08-29 James S. Barnes , Jun Le Goh , Richard A. Shore

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

Combinatorics · Mathematics 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

In 1962, V.A. Belonogov proved that if a finite group $G$ contains two maximal subgroups of coprime orders, then either $G$ is one of known solvable groups or $G$ is simple. In this short note based on results by M. Liebeck and J. Saxl on…

Group Theory · Mathematics 2023-08-08 N. V. Maslova

A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…

Combinatorics · Mathematics 2020-02-25 Richard Montgomery , Alexey Pokrovskiy , Benny Sudakov

We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…

Group Theory · Mathematics 2014-01-07 Vladimir L. Popov

We obtain necessary and sufficient conditions for pure infiniteness of the path groupoid $C^*$-algebra of a row-finite graph without sinks. In particular we show that for such a path groupoid $\mathcal{G}_E$, the properties of being…

Operator Algebras · Mathematics 2019-07-12 Francesca Arici , Baukje Debets , Karen R. Strung

The Hilbert-Smith conjecture states, for any connected topological manifold $M$, any locally compact subgroup of $\mathrm{Homeo}(M)$ is a Lie group. We generalize basic results of Segal-Kosniowski-tomDieck (2.6), James-Segal (2.12), G…

Geometric Topology · Mathematics 2022-02-23 Qayum Khan

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Group Theory · Mathematics 2024-02-29 Hung P. Tong-Viet

Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…

Number Theory · Mathematics 2017-10-25 Joachim König , François Legrand

For any undirected and simple graph G = (V;E), where V denotes the vertex set and E the edge set of G. G is called hamiltonian if it contains a cycle that visits each vertex of G exactly once. Ore (1960) proved that G is hamiltonian if…

Combinatorics · Mathematics 2018-05-15 Hsiu-Chunj Pan , Hsun Su , Shin-Shin Kao

In the paper we consider the following conjecture: if a finite group $G$ possesses a solvable $\pi$-Hall subgroup $H$, then there exist elements $x,y,z,t\in G$ such that the identity $H\cap H^x\cap H^y\cap H^z\cap H^t=O_\pi(G)$ holds. The…

Group Theory · Mathematics 2010-08-17 E. P. Vdovin , V. I. Zenkov

Let $G$ be a finite group with a Sylow $p$-subgroup $P$. We prove that the principal $p$-blocks of $G$ and $N_G(P)$ are perfectly isometric under the assumption $G$ has a cyclic $p$-hyperfocal subgroup.

Representation Theory · Mathematics 2016-11-09 Hiroshi Horimoto , Atumi Watanabe

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

Group Theory · Mathematics 2018-08-02 Morteza Baniasad Azad , Behrooz Khosravi

We generalize the theory of the second invariant cohomology group $H^2_{\rm inv}(G)$ for finite groups $G$, developed in [Da2,Da3,GK], to the case of affine algebraic groups $G$, using the methods of [EG1,EG2,G]. In particular, we show that…

Quantum Algebra · Mathematics 2017-10-12 Pavel Etingof , Shlomo Gelaki

In 1959, P. Hall introduced the locally finite group $\mathcal{U}$, today known as Hall's universal group. This group is countable, universal, simple, and any two finite isomorphic subgroups are conjugate in $\mathcal{U}$. It can be…

Group Theory · Mathematics 2019-02-12 Igor Dolinka , Robert D. Gray

We prove that for any prime p there exist infinitely many finite simple groups G with a coset xP of a Sylow p-subgroup P of G such that every element of xP has order divisible by p. John Thompson proved this for p=2 in 1967 answering a…

Group Theory · Mathematics 2012-08-28 Daniel Goldstein , Robert M. Guralnick

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

Probability · Mathematics 2011-11-10 Alex Gamburd , Shlomo Hoory , Mehrdad Shahshahani , Aner Shalev , Balint Virag

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

‹ Prev 1 3 4 5 6 7 10 Next ›