Related papers: Some simplifications in the proof of the Sims conj…
In this paper we propose a refinement of Sims conjecture concerning the cardinality of the point stabilizers in finite primitive groups and we make some progress towards this refinement. In this process, when dealing with primitive groups…
A proof of Thompson's conjecture for real semi-simple Lie groups has been given by Kapovich, Millson, and Leeb. In this note, we give another proof of the conjecture by using a theorem of Alekseev, Meinrenken, and Woodward from symplectic…
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…
We prove several results regarding the simplicity of germs and multigerms obtained via the operations of augmentation, simultaneous augmentation and concatenation and generalised concatenation. We also give some results in the case where…
A very simple but useful almost sure convergence theorem of probability is given.
We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…
In this paper, we present a simple analytic proof of Siegel's theorem that concerns the lower bound of $L(1,\chi)$ for primitive quadratic $\chi$. Our new method compares an elementary lower bound with an analytic upper bound obtained by…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
We generalize a result of Sury and prove that uniform discreteness of cocompact lattices in higher rank semisimple Lie groups (first conjectured by Margulis) is equivalent to a weak form of Lehmer's conjecture. We include a short survey of…
This note presents an elementary version of Sims's algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate low-level data structures. Upper and lower bounds on…
We present a conjecture about partitions, with a very elementary formulation.
A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements. This…
We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…
We prove Cherlin's conjecture, concerning binary primitive permutation groups, for those groups with socle isomorphic to a sporadic simple group.
We develop a cohomological method to classify amalgams of groups. We generalize this to simplicial amalgams in any concrete category. We compute the non-commutative 1-cohomology for several examples of amalgams defined over small simplices.
In this paper, we prove a few lemmas concerning Fibonacci numbers modulo primes and provide a few statements that are equivalent to Wall-Sun-Sun Prime Conjecture. Further, we investigate the conjecture through heuristic arguments and…
We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our…
In this paper we propose a conjecture concerning partial sums of an arbitrary finite subset of an abelian group, that naturally arises investigating simple Heffter systems. Then, we show its connection with related open problems and we…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…