Transactions of the American Mathematical Society, Vol. 349, No. 3 (Mar., 1997), pp. 903-934 (32 pages) For every finitely generated, congruence modular variety V of finite type we find a finite ...

The new functionality added in ticket #11422 makes it possible to manipulate arbitrary finite index (not necessarily congruence) subgroups of SL2Z. This massively extends my old code which only worked ...

An algebra is congruence modular (or CM for short) if its lattice of congruence relations is modular lattices|modular. A class of algebras is congruence modular if each of its members is congruence ...

We often want to talk about whether two elements of a given set are related in a particular way, e.g. whether one real number is smaller or larger than the other, whether two integers have the same ...

Using “refreshingly old” tools, mathematicians resolved a 50-year-old conjecture about how to categorize important functions called modular forms, with consequences for number theory and theoretical ...

Abstract: This paper presents a method of designing the required reference signals' phases for a group of frequency synthesizers based on the congruence modulo. The resultant adjacent synthesizers' ...

In this paper, we present a new method using Fibonacci sequences to obtain real IID sequences of random numbers 1. To have random number two methods exists : 1) use of pseudo-random generators (for ...