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

A characterization is given of finite groups $H$ that have skew-morphisms of order coprime to the order $|H|$, and their skew-morphisms. A complete classification is then given of the automorphism groups and the underlying graphs of…

The bipartite independence number of a graph $G$, denoted as $\tilde\alpha(G)$, is the minimal number $k$ such that there exist positive integers $a$ and $b$ with $a+b=k+1$ with the property that for any two sets $A,B\subseteq V(G)$ with…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

Let $X$ be a smooth projective connected curve of genus $g\ge 2$ defined over an algebraically closed field $k$ of characteristic $p>0$. Let $G$ be a finite group, $P$ a Sylow $p$-subgroup of $G$ and $N_G(P)$ its normalizer in $G$. We show…

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

Let ${\cal K}_1(G)$ denote the inverse subsemigroup of ${\cal K}(G)$ consisting of all right cosets of all non-trivial subgroups of $G$. This paper concentrates on the study of the group $\Sigma({\cal K}_1(G))$ of all units of the…

The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word problem embeds in a finitely presented simple group. In this paper, we show that hyperbolic groups satisfy this conjecture, that is, each…

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 $…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

We show that there are at most $O_{n,\epsilon}(H^{n-2+\sqrt{2}+\epsilon})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973…

Let G be a connected real semi-simple Lie group and H a closed connected subgroup. Let P be a minimal parabolic subgroup of G. It is shown that H has an open orbit on the flag manifold G/P if and only if it has finitely many orbits on G/P.…

Let $G$ be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to exactly two of these perfect matchings. If answered in the…

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal…

Hans Zassenhaus conjectured that every torsion unit of the integral group ring of a finite group $G$ is conjugate within the rational group algebra to an element of the form $\pm g$ with $g\in G$. This conjecture has been disproved recently…

In 1981, Alspach conjectured that the complete graph $ K_{n} $ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This conjecture was proved completely by Bryant, Horsley and…

We solve two long standing open problems, one from probability theory formulated by Malyshev in 1970 and another one from a crossroad of geometry and dynamics, of Darboux from 1879. The Malyshev problem is of finding effective, explicit…

Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}) and conductor c = max(N \ S) + 1. Let P be the set of primitive elements of S, and let L be the set of elements of S which are smaller than c. A longstand-ing…

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most…

We show that for a Hecke pair $(G, \Gamma)$ the $C^*$-completions $C^*(L^1(G, \Gamma))$ and $pC^*(\bar{G})p$ of its Hecke algebra coincide whenever the group algebra $L^1(\bar{G})$ satisfies a spectral property which we call…