نتایج جستجو برای: modified todd coxeter algorithm
تعداد نتایج: 986310 فیلتر نتایج به سال:
INTRODUCTION Group B streptococci (GBS) are transmitted from the mother to the newborn. Prevention of neonatal infection is achieved by intrapartum prophylaxis given to mothers colonized with GBS at 35 to 37 weeks of pregnancy. MATERIALS AND METHODS Liquid biphasic Granada medium (LB) and instant liquid biphasic Granada medium (ILB) were evaluated for GBS detection. Vaginal swabs obtained fro...
An element of a Coxeter group is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group is cyclically fully commutative if any of its cyclic shifts remains fully commutative. These elements were studied by Boothby et al. In particular the authors precisely identified the Coxeter groups ...
We demonstrate that Coxeter groups allow for complex PT -symmetric deformations across the boundaries of all Weyl chambers. We compute the explicit deformations for the A2 and G2-Coxeter group and apply these constructions to Calogero-MoserSutherland models invariant under the extended Coxeter groups. The eigenspecta for the deformed models are real and contain the spectra of the undeformed cas...
in this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. since cell formation problem is np-hard, two algorithms based on genetic and modified particle swarm optimization (mpso) algorithms are developed to solve the problem. for generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...
We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication in the Iwahori-Hecke algebra.
We give the first analysis of a systematic scan version of the Metropolis algorithm. Our examples include generating random elements of a Coxeter group with probability determined by the length function. The analysis is based on interpreting Metropolis walks in terms of the multiplication in the Iwahori-Hecke algebra.
In a seminal article, Todd (Journal of Experimental Psychology: Human Perception and Performance 7:795-810, 1981) reported a difference threshold of about 50 ms to discriminate the times of arrival of two differently sized objects that simultaneously approached head-on at constant but different velocities. Subsequent investigators, however, have often found much higher thresholds. We did one co...
The descent algebra Σ(W) is a subalgebra of the group algebra QW of a finite Coxeter group W, which supports a homomorphism with nilpotent kernel and commutative image in the character ring of W. Thus Σ(W) is a basic algebra, and as such it has a presentation as a quiver with relations. Here we construct Σ(W) as a quotient of a subalgebra of the path algebra of the Hasse diagram of the Boolean ...
(1) The Poincar e polynomials of the nite irreducible Coxeter groups and the Poincar e series of the aane Coxeter groups on three generators are derived by an elementary combinatorial method avoiding the use of Lie theory and invariant theory. (2) Non-recursive methods for the computation of`standard reduced words' for (signed) permutations are described. The algebraic basis for both (1) and (2...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید