Sciweavers

195 search results - page 13 / 39
» Bispectrum on finite groups
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Group representation design of digital signals and sequences
In this survey a novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, is described and studied. The new functions are p...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
GC
2006
Springer
13 years 9 months ago
Reconstructing under Group Actions
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
A. J. Radcliffe, Alex D. Scott
JSYML
2006
84views more  JSYML 2006»
13 years 9 months ago
Generix never gives up
We prove conjugacy and generic disjointness of generous Carter subgroups in groups of finite Morley rank. We elaborate on groups with a generous Carter subgroup and on a minimal c...
Eric Jaligot
DM
2008
129views more  DM 2008»
13 years 9 months ago
On association schemes all elements of which have valency 1 or 2
In the present note, we investigate schemes S in which each element s satisfies ns 2 and nss = 2. We show that such a scheme is schurian. More precisely, we show that it is isomor...
Mikhail E. Muzychuk, Paul-Hermann Zieschang
DCC
2006
IEEE
14 years 8 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey