Sciweavers

5019 search results - page 3 / 1004
» Computing in Quotient Groups
Sort
View
IJAC
2008
116views more  IJAC 2008»
14 years 9 months ago
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
Laurent Bartholdi, Bettina Eick, René Hartu...
APAL
2006
63views more  APAL 2006»
14 years 9 months ago
Satisfaction of existential theories in finitely presented groups and some embedding theorems
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
Abderezak Ould Houcine
ARITH
2003
IEEE
15 years 2 months ago
Revisiting SRT Quotient Digit Selection
The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a r...
Peter Kornerup
ECCV
2006
Springer
15 years 1 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
JCT
2011
83views more  JCT 2011»
14 years 4 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine