Search results

Jump to navigation Jump to search

Page title matches

  • The typical example of a '''cyclic order''' are people seated at a (round) table: This gives rise to a cyclic order if (and only if) for some element ''s'' the orbit under σ is the whol
    2 KB (361 words) - 21:13, 6 January 2011
  • 103 bytes (15 words) - 13:47, 5 January 2011
  • ...|chapter=Cyclic order |year=1894 |publisher=D. C. Heath & Co.}} Describes cyclic order with simple examples and exercises. ...books.google.com/books?id=jZfqK2sjI64C&pg=PA9 |pages=pp. 9 ''ff'' |chapter=Cyclic order |isbn=0262020696 |year=1974 |publisher=MIT Press}} Describes some more abst
    566 bytes (82 words) - 07:45, 7 January 2011
  • 187 bytes (26 words) - 13:43, 5 January 2011

Page text matches

  • ...|chapter=Cyclic order |year=1894 |publisher=D. C. Heath & Co.}} Describes cyclic order with simple examples and exercises. ...books.google.com/books?id=jZfqK2sjI64C&pg=PA9 |pages=pp. 9 ''ff'' |chapter=Cyclic order |isbn=0262020696 |year=1974 |publisher=MIT Press}} Describes some more abst
    566 bytes (82 words) - 07:45, 7 January 2011
  • The typical example of a '''cyclic order''' are people seated at a (round) table: This gives rise to a cyclic order if (and only if) for some element ''s'' the orbit under σ is the whol
    2 KB (361 words) - 21:13, 6 January 2011
  • ...|chapter=Cyclic order |year=1894 |publisher=D. C. Heath & Co.}} Describes cyclic order.
    585 bytes (83 words) - 10:01, 6 January 2011
  • ...k</sub> equals one if i,j,k = 1,2,3 or any permutation that keeps the same cyclic order, or minus one if the order is different, or zero if any two of the indices
    219 bytes (40 words) - 10:49, 2 January 2011
  • * equal to 1, if the indices are pairwise distinct and in [[cyclic order]],<!--<ref name=cyclic> ...ttp://books.google.com/books?id=0RMAAAAAYAAJ&pg=PA59 |pages=p. 59 |chapter=Cyclic order |year=1894 |publisher=D. C. Heath & Co.}}
    3 KB (390 words) - 11:35, 12 March 2011