نتایج جستجو برای: quasi permutation

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

A. Hasankhani, N. Shajareh-Poursalavati,

In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.

2008
GREG KUPERBERG RICHARD LYONS MICHAEL E. ZIEVE

Let G be a transitive group of permutations of a finite set Ω, and suppose that some element of G has at most two orbits on Ω. We prove that any two maximal chains of groups between G and a point-stabilizer of G have the same length, and the same sequence of relative indices between consecutive groups (up to permutation). We also deduce the same conclusion when G has a transitive quasi-Hamilton...

2013
HUNG P. TONG-VIET

Let G be a transitive permutation group acting on a finite set E and let P be the stabilizer in G of a point in E. We say that G is primitive rank 3 on E if P is maximal in G and P has exactly three orbits on E. For any subgroup H of G, we denote by 1H the permutation character (or permutation module) over C of G on the cosets G/H. Let H and K be subgroups of G. We say 1H 6 1 G K if 1 G K − 1 G...

Journal: :Electr. J. Comb. 2012
Derek H. Smith Roberto Montemanni

In recent years the detailed study of the construction of constant weight codes has been extended from length at most 28 to lengths less than 64. Andries Brouwer maintains web pages with tables of the best known constant weight codes of these lengths. In many cases the codes have more codewords than the best code in the literature, and are not particularly easy to improve. Many of the codes are...

Journal: :CoRR 2005
Oscar Y. Takeshita

A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudorandom nature, and the new codes are quasi-cyclic. Graph isomorphisms and automorphisms are identified and used in an efficient search for good codes. Graphs with girth as large as 12 wer...

2008
Jon Magne Leinaas

In two space dimensions the possibilities of fractional spin as well as fractional statistics exist. I examine the relation between fractional spin and statistics for Laughlin quasi-particles in a two-dimensional electron system with spherical geometry. The relevance of this for quasi-particles in a planar system is discussed. 1 Statistics and spin in two dimensions I would like to begin by rem...

Journal: :Eur. J. Comb. 2010
Florent Hivert Jean-Christophe Novelli Jean-Yves Thibon

The algebra of Free Quasi-Symmetric Functions FQSym [5] is a graded algebra of noncommutative polynomials whose bases are parametrized by permutations. Under commutative image, it is mapped onto Gessel’s algebra of quasi-symmetric functions, whence its name. Quasi-symmetric functions generalize symmetric functions in a natural way, and many classical results admit quasi-symmetric extensions or ...

1999
FRANÇOIS JAEGER KAZUMASA NOMURA

We study spin models as introduced in [20]. Such a spin model can be defined as a square matrix satisfying certain equations, and can be used to compute an associated link invariant. The link invariant associated with a symmetric spin model depends only trivially on link orientation. This property also holds for quasi-symmetric spin models, which are obtained from symmetric spin models by certa...

Journal: :Journal of Algebra and Its Applications 2021

There is a local ring [Formula: see text] of order without identity for the multiplication, defined by generators and relations as We study recursive construction self-orthogonal codes over classify, up to permutation equivalence, length size (called here quasi self-dual or QSD) text]. In particular, we classify Type IV (QSD with even weights)

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

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