نتایج جستجو برای: group order

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

Journal: :Bulletin of Symbolic Logic 2007
André Nies

Two ways of describing a group are considered. 1. A group is finiteautomaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order senten...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز 1381

‏‎this study investigated the effect of prior knowledge on the listening comprehension performance of fl learners. twenty students, male and female, drawn from the two intact groups of the senior and junior english language and literature majors were chosen as the participants of this study . the two groups were then randomly assigned into the experimental and control group. the experimental gr...

Journal: :iranian journal of fuzzy systems 2013
ju-mok oh

bentea and tu{a}rnu{a}uceanu~(an. c{s}tiinc{t}. univ. al. i.cuza iac{s}, ser. nouv{a}, mat., {bf 54(1)} (2008), 209-220)proposed the following problem: find an explicit formula for thenumber of fuzzy subgroups of a finite hamiltonian group of type$q_8times mathbb{z}_n$ where $q_8$ is the quaternion group oforder $8$ and $n$ is an arbitrary odd integer. in this paper weconsider more general grou...

2010
Mark Powell

Let Knots be the abelian monoid of isotopy classes of knots S ⊂ S under connected sum, and let C be the topological knot concordance group of knots modulo slice knots. Cochran-OrrTeichner [COT03] defined a filtration of C: C ⊃ F(0) ⊃ F(0.5) ⊃ F(1) ⊃ F(1.5) ⊃ F(2) ⊃ . . . The quotient C/F(0.5) is isomorphic to Levine’s algebraic concordance group AC1 [Lev69]; F(0.5) is the algebraically slice kn...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز - دانشکده علوم ریاضی 1387

فرض کنید g یک گروه متناهی باشد به طوری که مربع هر درجه کاراکتر تحویل ناپذیر آن اندیس مرکز گروه را عاد می کند. آیا می توان نتیجه گرفت که گروه پوچتوان یا حتی حلپذیر است؟ همچنین در مورد بعضی از تعمیمهای فوقالذکر بحث خواهیم کرد. همچنین، تا چه اندازه ساختار یک گروه حلپذیر توسط بزرگترین درجه کاراکتر تحویل ناپذیر گروه تحت تاثیر قرار میگیرد مورد بحث قرار خواهد گرفت. let g be a finite group such tha...

2009
Myrto Kallipoliti

The absolute order on the hyperoctahedral group Bn is investigated. Using a poset fiber theorem, it is proved that the order ideal of this poset generated by the Coxeter elements is homotopy Cohen–Macaulay. This method results in a new proof of Cohen–Macaulayness of the absolute order on the symmetric group. Moreover, it is shown that every closed interval in the absolute order on Bn is shellab...

1998
Henry Prakken Thomas F. Gordon

This paper reports on an ongoing research project, consisting of formalizing rules of order for group decision making, and implementing them as a procedural component of automated mediation systems for group decision making. The component should ultimately assist a human mediator in maintaining order at electronic meetings, and in giving advice to the participants on their options, rights and o...

1995
Raimundo José de Araújo

Group communication (or multicast) is a powerful abstraction that can be used whenever groups of distributed processes cooperate for the execution of a given task. Due to the uncertainties inherent to distributed systems (emerging from communication or process failures), multicast messages may arrive in an inconsistent order at different destination processes. Further complications will arise w...

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

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