Sciweavers

5019 search results - page 9 / 1004
» Computing in Quotient Groups
Sort
View
ARITH
2011
IEEE
13 years 11 months ago
Short Division of Long Integers
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
David Harvey, Paul Zimmermann
CORR
2002
Springer
115views Education» more  CORR 2002»
14 years 11 months ago
Average-case complexity and decision problems in group theory
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
DM
2010
108views more  DM 2010»
14 years 11 months ago
Locally toroidal polytopes and modular linear groups
When the standard representation of a crystallographic Coxeter group G (with string diagram) is reduced modulo the integer d 2, one obtains a finite group Gd often the automorphi...
Barry Monson, Egon Schulte
41
Voted
JSYML
2007
36views more  JSYML 2007»
14 years 11 months ago
Groups definable in ordered vector spaces over ordered division rings
Let M = M, +, <, 0, {λ}λ∈D be an ordered vector space over an ordered division ring D, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is defin...
Pantelis E. Eleftheriou, Sergei Starchenko
ORDER
2002
107views more  ORDER 2002»
14 years 11 months ago
Order Dimension, Strong Bruhat Order and Lattice Properties for Posets
We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of D...
Nathan Reading