Results 281 to 290 of about 7,570 (298)
Some of the next articles are maybe not open access.
Bases for Coinvariants and Cyclic Permutations
201028.1.1. In this chapter we assume that (I, ·) is of finite type. Let \(\lambda \in X^ + \). For any sequence i = (i1,i 2 ,…, i N ) in I such that \({\rm{s}}_{i_1 } {\rm{s}}_{i_2 } \cdots {\rm{s}}_{i_N } \) is a reduced expression of an element w\( \in \)W, we consider the element \(\theta {\rm{(i,}}\,\lambda {\rm{)}}\,{\rm{ = }}\theta _{i_1 }^{(a_1 )} \
openaire +1 more source
Max-plus-based mathematical formulation for cyclic permutation flow-shops
International Journal of Mathematical Modelling and Numerical Optimisation, 2011R P Judd
exaly
A transform approach to permutation groups of cyclic codes over Galois rings
IEEE Transactions on Information Theory, 2000D K Ray-Chaudhuri
exaly
On factorisations of cyclic permutations into transpositions.
Ars Comb., 2010MEROLA, FRANCESCA, DANIELE A. GEWURZ
openaire +1 more source
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
IEEE Transactions on Information Theory, 2004M P C Fossorier
exaly

