Combinatorial designs and finite group theory form a rich intersection of discrete mathematics and algebra, where structured arrangements of elements are studied alongside the algebraic properties ...

We show that two abelian-by-finite groups are elementarily equivalent if and only if they satisfy the same sentences with two alternations of quantifiers. We also prove that abelian-by-finite groups ...

, L. Longhi, M. Perlstadt, Differential Operators Commuting with Finite Convolution Integral Operators: Some Non-Abelian Examples, SIAM Journal on Applied Mathematics ...