Sciweavers

195 search results - page 3 / 39
» Bispectrum on finite groups
Sort
View
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 5 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
APAL
1999
72views more  APAL 1999»
13 years 5 months ago
Lattices of Modal Logics and Their Groups of Automorphisms
The present paper investigates the groups of automorphisms for some lattices of modal logics. The main results are the following. The lattice of normal extensions of S4.3, NExt S4....
Marcus Kracht
IJCM
2008
102views more  IJCM 2008»
13 years 5 months ago
Combinatorial method in the coset enumeration of symmetrically generated groups
We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free products of cyclic groups by a group of monomial auto...
Mohamed Sayed
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 5 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...