Journal of Combinatorial Theory Series A最新文献

{"title":"Near triple arrays","authors":"Alexey Gordeev,&nbsp;Klas Markström,&nbsp;Lars-Daniel Öhman","doi":"10.1016/j.jcta.2025.106121","DOIUrl":"10.1016/j.jcta.2025.106121","url":null,"abstract":"<div><div>We introduce <em>near triple arrays</em> as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near triple arrays form a common generalization of such well-studied classes of designs as triple arrays, (near) Youden rectangles and Latin squares.</div><div>We enumerate near triple arrays for a range of small parameter sets and show that they exist in the vast majority of the cases considered. As a byproduct, we obtain the first complete enumerations of <span><math><mn>6</mn><mo>×</mo><mn>10</mn></math></span> triple arrays on 15 symbols, <span><math><mn>7</mn><mo>×</mo><mn>8</mn></math></span> triple arrays on 14 symbols and <span><math><mn>5</mn><mo>×</mo><mn>16</mn></math></span> triple arrays on 20 symbols.</div><div>Next, we give several constructions for families of near triple arrays, and e.g. show that near triple arrays with 3 rows and at least 6 columns exist for any number of symbols. Finally, we investigate a duality between row and column intersection sizes of a row-column design, and covering numbers for pairs of symbols by rows and columns. These duality results are used to obtain necessary conditions for the existence of near triple arrays. This duality also provides a new unified approach to earlier results on triple arrays and balanced grids.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"219 ","pages":"Article 106121"},"PeriodicalIF":1.2,"publicationDate":"2025-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"k-Adjoint of hyperplane arrangements","authors":"Weikang Liang ,&nbsp;Suijie Wang ,&nbsp;Chengdong Zhao","doi":"10.1016/j.jcta.2025.106120","DOIUrl":"10.1016/j.jcta.2025.106120","url":null,"abstract":"<div><div>In this paper, we introduce the <em>k</em>-adjoint of a given hyperplane arrangement <span><math><mi>A</mi></math></span> associated with rank-<em>k</em> elements in the intersection lattice <span><math><mi>L</mi><mo>(</mo><mi>A</mi><mo>)</mo></math></span>, which generalizes the classical adjoint proposed by Bixby and Coullard. The <em>k</em>-adjoint of <span><math><mi>A</mi></math></span> induces a decomposition of the Grassmannian, which we call the <span><math><mi>A</mi></math></span>-adjoint decomposition. Inspired by the work of Gelfand, Goresky, MacPherson, and Serganova, we generalize the matroid decomposition and refined Schubert decomposition of the Grassmannian from the perspective of <span><math><mi>A</mi></math></span>. Furthermore, we prove that these three decompositions are exactly the same decomposition. A notable application involves providing a combinatorial classification of all the <em>k</em>-dimensional restrictions of <span><math><mi>A</mi></math></span>. Consequently, we establish the antitonicity of some combinatorial invariants, such as Whitney numbers of the first kind and the independence numbers.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"219 ","pages":"Article 106120"},"PeriodicalIF":1.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved asymptotics for moments of reciprocal sums for partitions into distinct parts","authors":"Kathrin Bringmann ,&nbsp;Byungchan Kim ,&nbsp;Eunmi Kim","doi":"10.1016/j.jcta.2025.106119","DOIUrl":"10.1016/j.jcta.2025.106119","url":null,"abstract":"<div><div>In this paper we strongly improve asymptotics for <span><math><msub><mrow><mi>s</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> (respectively <span><math><msub><mrow><mi>s</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span>) which sums reciprocals (respectively squares of reciprocals) of parts throughout all the partitions of <em>n</em> into distinct parts. The methods required are much more involved than in the case of usual partitions since the generating functions are not modular and also do not possess product expansions.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"219 ","pages":"Article 106119"},"PeriodicalIF":1.2,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dimension identities, almost self-conjugate partitions, and BGG complexes for Hermitian symmetric pairs","authors":"William Q. Erickson,&nbsp;Markus Hunziker","doi":"10.1016/j.jcta.2025.106118","DOIUrl":"10.1016/j.jcta.2025.106118","url":null,"abstract":"<div><div>An <em>almost self-conjugate</em> (ASC) partition has a Young diagram in which each arm along the diagonal is exactly one box longer than its corresponding leg. Classically, the ASC partitions and their conjugates appear in two of Littlewood's symmetric function identities. These identities can be viewed as Euler characteristics of BGG complexes of the trivial representation, for classical Hermitian symmetric pairs. In this paper, we consider partitions in which the arm–leg difference is an arbitrary constant <em>m</em>. By viewing these partitions as highest weights, we establish an infinite family of dimension identities between <span><math><msub><mrow><mi>gl</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>- and <span><math><msub><mrow><mi>gl</mi></mrow><mrow><mi>n</mi><mo>+</mo><mi>m</mi></mrow></msub></math></span>-modules. We then interpret this result in the context of blocks in parabolic category <span><math><mi>O</mi></math></span>: in particuar, we exhibit six infinite families of congruent blocks whose corresponding posets of highest weights consist of the partitions in question. These posets, in turn, lead to generalizations of the Littlewood identities and their corresponding BGG complexes. Our results in this paper shed light on the surprising combinatorics underlying the work of Enright and Willenbring (2004).</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"219 ","pages":"Article 106118"},"PeriodicalIF":1.2,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145128159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Schur polynomials in all primitive nth roots of unity","authors":"Masaki Hidaka,&nbsp;Minoru Itoh","doi":"10.1016/j.jcta.2025.106107","DOIUrl":"10.1016/j.jcta.2025.106107","url":null,"abstract":"<div><div>We show that the Schur polynomials in all primitive <em>n</em>th roots of unity are 1, 0, or −1, if <em>n</em> has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the cyclotomic polynomial and its multiplicative inverse. The key to the proof is the concept of a unimodular system of vectors. Namely, this result can be reduced to the unimodularity of the tensor product of two maximal circuits (here we call a vector system a maximal circuit, if it can be expressed as <span><math><mi>B</mi><mo>∪</mo><mo>{</mo><mo>−</mo><mo>∑</mo><mi>B</mi><mo>}</mo></math></span> with some basis <em>B</em>).</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106107"},"PeriodicalIF":1.2,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145094910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Existences of semiregular automorphisms of edge-transitive graphs of odd prime valency","authors":"Wenjuan Luo,&nbsp;Jing Xu","doi":"10.1016/j.jcta.2025.106117","DOIUrl":"10.1016/j.jcta.2025.106117","url":null,"abstract":"<div><div>The Polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism whose cycles all have the same length. Similarly, in <span><span>[11]</span></span> the authors asked if every connected regular edge-transitive graph admits a semiregular automorphism. In this paper we prove that edge-transitive graphs of odd prime valency have a semiregular automorphism.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106117"},"PeriodicalIF":1.2,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145094909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Arithmetic properties of MacMahon-type sums of divisors: The odd case","authors":"James A. Sellers ,&nbsp;Roberto Tauraso","doi":"10.1016/j.jcta.2025.106105","DOIUrl":"10.1016/j.jcta.2025.106105","url":null,"abstract":"<div><div>A century ago, P. A. MacMahon introduced two families of generating functions,<span><span><span><math><munder><mo>∑</mo><mrow><mn>1</mn><mo>≤</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>&lt;</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>&lt;</mo><mo>⋯</mo><mo>&lt;</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>t</mi></mrow></msub></mrow></munder><munderover><mo>∏</mo><mrow><mi>k</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>t</mi></mrow></munderover><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac><mspace></mspace><mtext> and </mtext><munder><mo>∑</mo><mrow><mtable><mtr><mtd><mn>1</mn><mo>≤</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>&lt;</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>&lt;</mo><mo>⋯</mo><mo>&lt;</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>t</mi></mrow></msub></mtd></mtr><mtr><mtd><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>t</mi></mrow></msub><mtext> odd</mtext></mrow></mtd></mtr></mtable></mrow></munder><munderover><mo>∏</mo><mrow><mi>k</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>t</mi></mrow></munderover><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac><mo>,</mo></math></span></span></span> which connect sum-of-divisors functions and integer partitions. These have recently drawn renewed attention. In particular, Amdeberhan, Andrews, and Tauraso extended the first family above by defining<span><span><span><math><msub><mrow><mi>U</mi></mrow><mrow><mi>t</mi></mrow></msub><mo>(</mo><mi>a</mi><mo>,</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>1</mn><mo>≤</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>&lt;</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>&lt;</mo><mo>⋯</mo><mo>&lt;</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>t</mi></mrow></msub></mrow></munder><munderover><mo>∏</mo><mrow><mi>k</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>t</mi></mrow></munderover><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup></mrow><mrow><mn>1</mn><mo>+</mo><mi>a</mi><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup><mo>+</mo><msup><mrow><m","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106105"},"PeriodicalIF":1.2,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144924919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Congruences for the smallest parts function associated with ω(q)","authors":"Renrong Mao","doi":"10.1016/j.jcta.2025.106106","DOIUrl":"10.1016/j.jcta.2025.106106","url":null,"abstract":"<div><div>Let <span><math><msub><mrow><mtext>spt</mtext></mrow><mrow><mi>ω</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> denote the smallest parts function associated with <span><math><mi>ω</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>. Congruences for <span><math><msub><mrow><mtext>spt</mtext></mrow><mrow><mi>ω</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> modulo 5 are first obtained by Andrews, Dixit and Yee. Later, Wang and Yang established two families of congruences for <span><math><msub><mrow><mtext>spt</mtext></mrow><mrow><mi>ω</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> modulo powers of 5. More recently, Smoot provided another proof of these congruences and both of the two proofs utilize the Atkin operator <span><math><msub><mrow><mi>U</mi></mrow><mrow><mn>5</mn></mrow></msub></math></span>. In this paper, applying the Hecke operators, we obtain congruences for <span><math><msub><mrow><mtext>spt</mtext></mrow><mrow><mi>ω</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> modulo powers of primes <span><math><mi>ℓ</mi><mo>≥</mo><mn>5</mn></math></span>.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"217 ","pages":"Article 106106"},"PeriodicalIF":1.2,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144924719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Step-constrained self-avoiding walks on finite grids","authors":"Hacène Belbachir ,&nbsp;László Major ,&nbsp;László Németh ,&nbsp;László Szalay","doi":"10.1016/j.jcta.2025.106104","DOIUrl":"10.1016/j.jcta.2025.106104","url":null,"abstract":"<div><div>The study of self-avoiding walks (SAWs) on integer lattices has been an area of active research for several decades. In this paper, we investigate the number of SAWs between two diagonally opposite corners in a finite rectangular subgraph of the integer lattice, subject to certain constraints. In the two–dimensional case, we provide an explicit formula for the number of SAWs of a prescribed length, restricted to three-step directions. In addition, we develop an algorithm that produces faster computational results than the explicit formula. For some special cases, we present detailed counts of the SAWs in question. For rectangular grid graphs of higher dimensions, we provide a formula to count the number of SAWs that are exactly two steps longer than the shortest walks.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106104"},"PeriodicalIF":1.2,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144913210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Combinatorial interpretation of the Schlesinger–Zudilin stuffle product","authors":"Benjamin Brindle","doi":"10.1016/j.jcta.2025.106103","DOIUrl":"10.1016/j.jcta.2025.106103","url":null,"abstract":"<div><div>We derive an explicit formula for the quasi–shuffle product satisfied by Schlesinger–Zudilin Multiple <em>q</em>-Zeta Values, expressed in terms of partition data. To achieve this, we interpret Schlesinger–Zudilin Multiple <em>q</em>-Zeta Values as generating series of distinguished marked partitions, which are partitions whose Young diagrams have certain rows and columns marked. Together with the description of duality using marked partitions in <span><span>[4]</span></span>, and Bachmann's conjecture (<span><span>[1]</span></span>) that all linear relations among Multiple <em>q</em>-Zeta Values are implied by duality and the stuffle product, this paper completes the description of the conjectural structure of Multiple <em>q</em>-Zeta Values using marked partitions.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106103"},"PeriodicalIF":1.2,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144908606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}