<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">44585555X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145427.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00026-011-0079-4</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00026-011-0079-4</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Abboud</subfield>
   <subfield code="D">Elias</subfield>
   <subfield code="u">Beit Berl College, 44905, Doar Beit Berl, Israel</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Algorithms for Producing and Ordering Lexical and Nonlexical Sequences out of One Element</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Elias Abboud]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of &quot;elementary operations” on positive α-sequences is introduced. Our main theorem answers the question of when two lexical sequences are adjacent. Given any lexical sequence, α ∈ L n, we can produce its adjacent successor as follows; apply one elementary operation on the tail of the longest left sequence, of even length, which gives a lexical successor α′ ∈ L n, then compute the fundamental sequence $${f = \alpha \wedge \alpha\prime \in L_{m}}$$ and conclude for $${m \nmid n}$$ that α is adjacent to α′ in L n. Whereas for m | n, the sequence α is adjacent to a sequence by f and the least element of L d, where $${{d = \frac{n}{m}}}$$. Thus, while right sequences control the lexicality property of an α-sequence, it turns out that left sequences control the adjacency property of lexical and nonlexical sequences.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Basel AG, 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">elementary operations</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">splitting of a cell</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">conjugation of a cell</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">lexical sequences</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">adjacent</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Annals of Combinatorics</subfield>
   <subfield code="d">SP Birkhäuser Verlag Basel</subfield>
   <subfield code="g">15/1(2011-03-01), 1-17</subfield>
   <subfield code="x">0218-0006</subfield>
   <subfield code="q">15:1&lt;1</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">15</subfield>
   <subfield code="o">26</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00026-011-0079-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00026-011-0079-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Abboud</subfield>
   <subfield code="D">Elias</subfield>
   <subfield code="u">Beit Berl College, 44905, Doar Beit Berl, Israel</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Annals of Combinatorics</subfield>
   <subfield code="d">SP Birkhäuser Verlag Basel</subfield>
   <subfield code="g">15/1(2011-03-01), 1-17</subfield>
   <subfield code="x">0218-0006</subfield>
   <subfield code="q">15:1&lt;1</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">15</subfield>
   <subfield code="o">26</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
