We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where the groups are abelian. Moreover, when specialized to the abelian case, our proof is more streamlined and gives a better constant in the exponent of the list size. The constant is improved from ...

a positive integer $n$ is called a clt number if every group of order $n$ satisfies the converse of lagrange's theorem. in this note, we find all clt and supersolvable numbers up to $1000$. we also formulate some questions about the distribution of these numbers.

For G a finite group and p a prime this paper proves two theorems under hypotheses that restrict the index of the subgroup generated by every p-element x in certain subgroups generated by pairs of its conjugates. Under one set of hypotheses G is shown to be supersolvable. Simple groups satisfying a complementary fusion-theoretic hypothesis are classified.

We show that the subgroup lattice of any finite group satisfies Frankl’s UnionClosed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common technical result used to prove both may be of some independent interest.

In 1994, Edelman and Reiner characterized free and supersolvable hyperplane arrangements in the restricted interval [An−1, Bn]. In this paper, we give a characterization of inductively factored arrangements in this interval, and show that the same characterization also describes factored arrangements in this interval. These results use the compact notation of signed graphs introduced by Zaslavsky.

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We ...

Finite point configurations in projective spaces are combinatorially described by matroids, where full (finite) projective spaces correspond to connected modular matroids. Every representable matroid can in fact be extended to a modular one. However, we show that some matroids do not even have a modularly complemented extension. Enlarging the class of “ambient spaces” under consideration, we sh...

a positive integer $n$ is called a clt number if every group of order $n$ satisfies the converse of lagrange's theorem‎. ‎in this note‎, ‎we find all clt and supersolvable numbers up to $1000$‎. ‎we also formulate some questions about the distribution of these numbers‎.

Let [Formula: see text] be a finite group and text]. In this paper, we prove that if text], then is supersolvable. particular, some new characterizations of the well-known groups are obtained. We also show does not imply supersolvability for no constant