نتایج جستجو برای: quotient system

تعداد نتایج: 2242260  

2008
XIUPING SU

We define a generic multiplication in quantised Schur algebras and thus obtain a new algebra structure in the Schur algebras. We prove that via a modified version of the map from quantum groups to quantised Schur algebras, defined in [1], a subalgebra of this new algebra is a quotient of the monoid algebra in Hall algebras studied in [10]. We also prove that the subalgebra of the new algebra gi...

Journal: :General Topology and its Applications 1972

Journal: :Pflüger, Archiv für die Gesammte Physiologie des Menschen und der Thiere 1901

Journal: :Transactions of the American Mathematical Society 1967

2010
CARL FAITH

Let R be an associative ring in which an identity element is not assumed. A right quotient ring of P is an overring 5 such that for each aQS there corresponds rQR such that arQR and ar 9*0. A theorem of R. E. Johnson [l ] states that R possesses a right quotient ring S which is a (von Neumann) regular ring if and only if P has vanishing right singular ideal. In this case P possesses a unique (u...

2005
Alexander Hulpke Alice C. Niemeyer

We describe an algorithm which takes as input a finitely presented group F, a finite confluent rewriting system for a quotient G and a prime p, and returns as output a finite confluent rewriting system for the largest extension of an elementary abelian group in characteristic p by G which is still an epimorphic image of F.

2004

Notes: 1) The modular diagonal quotient surfaces as defined above may be viewed as a special case of the general diagonal quotient surfaces studied in Kani/Schanz[7]. 2) The inclusions of subsgroups {1} ≤ ∆αε ≤ G × G induce finite morphisms (both of degree m = |G|) YN Φ → ZN,ε Ψ → Y1 ' P × P. Moreover, by using Shimura’s canonical model X(N)/Q, it can be shown that all these varieties have cano...

Journal: :PVLDB 2011
Michael A. Bender Martin Farach-Colton Rob Johnson Russell Kraner Bradley C. Kuszmaul Dzejla Medjedovic Pablo Montes Pradeep Shetty Richard P. Spillane Erez Zadok

This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has found wide application in databases, storage systems, and networks. Because the Bloom filter performs frequent random reads and writes, it is used almost exclusively in RAM, limiting the size of the sets it can repres...

Journal: :Journal of Symbolic Computation 1998

Journal: :Proceedings of the American Mathematical Society 1976

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید