{"title":"交替奇偶校验弱排序","authors":"Simone Costa, Stefano Della Fiore","doi":"10.1002/jcd.21936","DOIUrl":null,"url":null,"abstract":"<p>A subset <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n </mrow>\n <annotation> $S$</annotation>\n </semantics></math> of a group <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>G</mi>\n \n <mo>,</mo>\n \n <mo>+</mo>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n <annotation> $(G,+)$</annotation>\n </semantics></math> is <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n </mrow>\n <annotation> $t$</annotation>\n </semantics></math>-<i>weakly sequenceable</i> if there is an ordering <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mrow>\n <msub>\n <mi>y</mi>\n \n <mn>1</mn>\n </msub>\n \n <mo>,</mo>\n \n <mi>…</mi>\n \n <mo>,</mo>\n \n <msub>\n <mi>y</mi>\n \n <mi>k</mi>\n </msub>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n <annotation> $({y}_{1},{\\rm{\\ldots }},{y}_{k})$</annotation>\n </semantics></math> of its elements such that the partial sums <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>s</mi>\n \n <mn>0</mn>\n </msub>\n \n <mo>,</mo>\n \n <msub>\n <mi>s</mi>\n \n <mn>1</mn>\n </msub>\n \n <mo>,</mo>\n \n <mi>…</mi>\n \n <mo>,</mo>\n \n <msub>\n <mi>s</mi>\n \n <mi>k</mi>\n </msub>\n </mrow>\n <annotation> ${s}_{0},{s}_{1},{\\rm{\\ldots }},{s}_{k}$</annotation>\n </semantics></math>, given by <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>s</mi>\n \n <mn>0</mn>\n </msub>\n \n <mo>=</mo>\n \n <mn>0</mn>\n </mrow>\n <annotation> ${s}_{0}=0$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>s</mi>\n \n <mi>i</mi>\n </msub>\n \n <mo>=</mo>\n \n <msubsup>\n <mo>∑</mo>\n <mrow>\n <mi>j</mi>\n \n <mo>=</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mi>i</mi>\n </msubsup>\n \n <msub>\n <mi>y</mi>\n \n <mi>j</mi>\n </msub>\n </mrow>\n <annotation> ${s}_{i}={\\sum }_{j=1}^{i}{y}_{j}$</annotation>\n </semantics></math> for <span></span><math>\n <semantics>\n <mrow>\n <mn>1</mn>\n \n <mo>≤</mo>\n \n <mi>i</mi>\n \n <mo>≤</mo>\n \n <mi>k</mi>\n </mrow>\n <annotation> $1\\le i\\le k$</annotation>\n </semantics></math>, satisfy <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>s</mi>\n \n <mi>i</mi>\n </msub>\n \n <mo>≠</mo>\n \n <msub>\n <mi>s</mi>\n \n <mi>j</mi>\n </msub>\n </mrow>\n <annotation> ${s}_{i}\\ne {s}_{j}$</annotation>\n </semantics></math> whenever and <span></span><math>\n <semantics>\n <mrow>\n <mn>1</mn>\n \n <mo>≤</mo>\n \n <mo>∣</mo>\n \n <mi>i</mi>\n \n <mo>−</mo>\n \n <mi>j</mi>\n \n <mo>∣</mo>\n \n <mo>≤</mo>\n \n <mi>t</mi>\n </mrow>\n <annotation> $1\\le | i-j| \\le t$</annotation>\n </semantics></math>. By Costa et al., it was proved that if the order of a group is <span></span><math>\n <semantics>\n <mrow>\n <mi>p</mi>\n \n <mi>e</mi>\n </mrow>\n <annotation> $pe$</annotation>\n </semantics></math> then all sufficiently large subsets of the nonidentity elements are <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n </mrow>\n <annotation> $t$</annotation>\n </semantics></math>-weakly sequenceable when <span></span><math>\n <semantics>\n <mrow>\n <mi>p</mi>\n \n <mo>></mo>\n \n <mn>3</mn>\n </mrow>\n <annotation> $p\\gt 3$</annotation>\n </semantics></math> is prime, <span></span><math>\n <semantics>\n <mrow>\n <mi>e</mi>\n \n <mo>≤</mo>\n \n <mn>3</mn>\n </mrow>\n <annotation> $e\\le 3$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n \n <mo>≤</mo>\n \n <mn>6</mn>\n </mrow>\n <annotation> $t\\le 6$</annotation>\n </semantics></math>. Inspired by this result, we show that, if <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> is the semidirect product of <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>Z</mi>\n \n <mi>p</mi>\n </msub>\n </mrow>\n <annotation> ${{\\mathbb{Z}}}_{p}$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>Z</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n <annotation> ${{\\mathbb{Z}}}_{2}$</annotation>\n </semantics></math> and the subset <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n </mrow>\n <annotation> $S$</annotation>\n </semantics></math> is balanced, then <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n </mrow>\n <annotation> $S$</annotation>\n </semantics></math> admits, regardless of its size, an <i>alternating parity</i> <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n </mrow>\n <annotation> $t$</annotation>\n </semantics></math>-weak sequencing whenever <span></span><math>\n <semantics>\n <mrow>\n <mi>p</mi>\n \n <mo>></mo>\n \n <mn>3</mn>\n </mrow>\n <annotation> $p\\gt 3$</annotation>\n </semantics></math> is prime and <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n \n <mo>≤</mo>\n \n <mn>8</mn>\n </mrow>\n <annotation> $t\\le 8$</annotation>\n </semantics></math>. A subset of <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> is balanced if it contains the same number of even elements and odd elements and an alternating parity ordering alternates even and odd elements. Then using a hybrid approach that combines both Ramsey theory and the probabilistic method we also prove, for groups <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> that are semidirect products of a generic (nonnecessarily abelian) group <span></span><math>\n <semantics>\n <mrow>\n <mi>N</mi>\n </mrow>\n <annotation> $N$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>Z</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n <annotation> ${{\\mathbb{Z}}}_{2}$</annotation>\n </semantics></math>, that all sufficiently large balanced subsets of the nonidentity elements admit an alternating parity <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n </mrow>\n <annotation> $t$</annotation>\n </semantics></math>-weak sequencing. The same procedure works also for studying the weak sequenceability for generic sufficiently large (not necessarily balanced) sets. Here we have been able to prove that, if the size of a subset <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n </mrow>\n <annotation> $S$</annotation>\n </semantics></math> of a group <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> is large enough and if <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n </mrow>\n <annotation> $S$</annotation>\n </semantics></math> does not contain 0, then <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n </mrow>\n <annotation> $S$</annotation>\n </semantics></math> is <span></span><math>\n <semantics>\n <mrow>\n <mi>t</mi>\n </mrow>\n <annotation> $t$</annotation>\n </semantics></math>-weakly sequenceable.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 6","pages":"308-327"},"PeriodicalIF":0.5000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Alternating parity weak sequencing\",\"authors\":\"Simone Costa, Stefano Della Fiore\",\"doi\":\"10.1002/jcd.21936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A subset <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n </mrow>\\n <annotation> $S$</annotation>\\n </semantics></math> of a group <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>G</mi>\\n \\n <mo>,</mo>\\n \\n <mo>+</mo>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n <annotation> $(G,+)$</annotation>\\n </semantics></math> is <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $t$</annotation>\\n </semantics></math>-<i>weakly sequenceable</i> if there is an ordering <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <msub>\\n <mi>y</mi>\\n \\n <mn>1</mn>\\n </msub>\\n \\n <mo>,</mo>\\n \\n <mi>…</mi>\\n \\n <mo>,</mo>\\n \\n <msub>\\n <mi>y</mi>\\n \\n <mi>k</mi>\\n </msub>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n <annotation> $({y}_{1},{\\\\rm{\\\\ldots }},{y}_{k})$</annotation>\\n </semantics></math> of its elements such that the partial sums <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>s</mi>\\n \\n <mn>0</mn>\\n </msub>\\n \\n <mo>,</mo>\\n \\n <msub>\\n <mi>s</mi>\\n \\n <mn>1</mn>\\n </msub>\\n \\n <mo>,</mo>\\n \\n <mi>…</mi>\\n \\n <mo>,</mo>\\n \\n <msub>\\n <mi>s</mi>\\n \\n <mi>k</mi>\\n </msub>\\n </mrow>\\n <annotation> ${s}_{0},{s}_{1},{\\\\rm{\\\\ldots }},{s}_{k}$</annotation>\\n </semantics></math>, given by <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>s</mi>\\n \\n <mn>0</mn>\\n </msub>\\n \\n <mo>=</mo>\\n \\n <mn>0</mn>\\n </mrow>\\n <annotation> ${s}_{0}=0$</annotation>\\n </semantics></math> and <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>s</mi>\\n \\n <mi>i</mi>\\n </msub>\\n \\n <mo>=</mo>\\n \\n <msubsup>\\n <mo>∑</mo>\\n <mrow>\\n <mi>j</mi>\\n \\n <mo>=</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mi>i</mi>\\n </msubsup>\\n \\n <msub>\\n <mi>y</mi>\\n \\n <mi>j</mi>\\n </msub>\\n </mrow>\\n <annotation> ${s}_{i}={\\\\sum }_{j=1}^{i}{y}_{j}$</annotation>\\n </semantics></math> for <span></span><math>\\n <semantics>\\n <mrow>\\n <mn>1</mn>\\n \\n <mo>≤</mo>\\n \\n <mi>i</mi>\\n \\n <mo>≤</mo>\\n \\n <mi>k</mi>\\n </mrow>\\n <annotation> $1\\\\le i\\\\le k$</annotation>\\n </semantics></math>, satisfy <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>s</mi>\\n \\n <mi>i</mi>\\n </msub>\\n \\n <mo>≠</mo>\\n \\n <msub>\\n <mi>s</mi>\\n \\n <mi>j</mi>\\n </msub>\\n </mrow>\\n <annotation> ${s}_{i}\\\\ne {s}_{j}$</annotation>\\n </semantics></math> whenever and <span></span><math>\\n <semantics>\\n <mrow>\\n <mn>1</mn>\\n \\n <mo>≤</mo>\\n \\n <mo>∣</mo>\\n \\n <mi>i</mi>\\n \\n <mo>−</mo>\\n \\n <mi>j</mi>\\n \\n <mo>∣</mo>\\n \\n <mo>≤</mo>\\n \\n <mi>t</mi>\\n </mrow>\\n <annotation> $1\\\\le | i-j| \\\\le t$</annotation>\\n </semantics></math>. By Costa et al., it was proved that if the order of a group is <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>p</mi>\\n \\n <mi>e</mi>\\n </mrow>\\n <annotation> $pe$</annotation>\\n </semantics></math> then all sufficiently large subsets of the nonidentity elements are <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $t$</annotation>\\n </semantics></math>-weakly sequenceable when <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>p</mi>\\n \\n <mo>></mo>\\n \\n <mn>3</mn>\\n </mrow>\\n <annotation> $p\\\\gt 3$</annotation>\\n </semantics></math> is prime, <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>e</mi>\\n \\n <mo>≤</mo>\\n \\n <mn>3</mn>\\n </mrow>\\n <annotation> $e\\\\le 3$</annotation>\\n </semantics></math> and <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n \\n <mo>≤</mo>\\n \\n <mn>6</mn>\\n </mrow>\\n <annotation> $t\\\\le 6$</annotation>\\n </semantics></math>. Inspired by this result, we show that, if <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> is the semidirect product of <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>Z</mi>\\n \\n <mi>p</mi>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\mathbb{Z}}}_{p}$</annotation>\\n </semantics></math> and <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>Z</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\mathbb{Z}}}_{2}$</annotation>\\n </semantics></math> and the subset <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n </mrow>\\n <annotation> $S$</annotation>\\n </semantics></math> is balanced, then <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n </mrow>\\n <annotation> $S$</annotation>\\n </semantics></math> admits, regardless of its size, an <i>alternating parity</i> <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $t$</annotation>\\n </semantics></math>-weak sequencing whenever <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>p</mi>\\n \\n <mo>></mo>\\n \\n <mn>3</mn>\\n </mrow>\\n <annotation> $p\\\\gt 3$</annotation>\\n </semantics></math> is prime and <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n \\n <mo>≤</mo>\\n \\n <mn>8</mn>\\n </mrow>\\n <annotation> $t\\\\le 8$</annotation>\\n </semantics></math>. A subset of <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> is balanced if it contains the same number of even elements and odd elements and an alternating parity ordering alternates even and odd elements. Then using a hybrid approach that combines both Ramsey theory and the probabilistic method we also prove, for groups <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> that are semidirect products of a generic (nonnecessarily abelian) group <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>N</mi>\\n </mrow>\\n <annotation> $N$</annotation>\\n </semantics></math> and <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>Z</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\mathbb{Z}}}_{2}$</annotation>\\n </semantics></math>, that all sufficiently large balanced subsets of the nonidentity elements admit an alternating parity <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $t$</annotation>\\n </semantics></math>-weak sequencing. The same procedure works also for studying the weak sequenceability for generic sufficiently large (not necessarily balanced) sets. Here we have been able to prove that, if the size of a subset <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n </mrow>\\n <annotation> $S$</annotation>\\n </semantics></math> of a group <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> is large enough and if <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n </mrow>\\n <annotation> $S$</annotation>\\n </semantics></math> does not contain 0, then <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n </mrow>\\n <annotation> $S$</annotation>\\n </semantics></math> is <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $t$</annotation>\\n </semantics></math>-weakly sequenceable.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"32 6\",\"pages\":\"308-327\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21936\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21936","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
A subset of a group is -weakly sequenceable if there is an ordering of its elements such that the partial sums , given by and for , satisfy whenever and . By Costa et al., it was proved that if the order of a group is then all sufficiently large subsets of the nonidentity elements are -weakly sequenceable when is prime, and . Inspired by this result, we show that, if is the semidirect product of and and the subset is balanced, then admits, regardless of its size, an alternating parity -weak sequencing whenever is prime and . A subset of is balanced if it contains the same number of even elements and odd elements and an alternating parity ordering alternates even and odd elements. Then using a hybrid approach that combines both Ramsey theory and the probabilistic method we also prove, for groups that are semidirect products of a generic (nonnecessarily abelian) group and , that all sufficiently large balanced subsets of the nonidentity elements admit an alternating parity -weak sequencing. The same procedure works also for studying the weak sequenceability for generic sufficiently large (not necessarily balanced) sets. Here we have been able to prove that, if the size of a subset of a group is large enough and if does not contain 0, then is -weakly sequenceable.
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.