Journal of Combinatorial Theory Series A最新文献

英文中文

Neighborly partitions, hypergraphs and Gordon's identities 邻接分区、超图和戈登等式

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-10-04 DOI: 10.1016/j.jcta.2024.105963

Pooneh Afsharijoo , Hussein Mourtada

We prove a family of partition identities which is “dual” to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and “hypergraphs” and their proof uses combinatorial commutative algebra.

我们证明了与安德鲁斯-戈登（Andrews-Gordon）等价性系列 "对偶 "的分区等价性系列。这些等式的灵感来自于一种特殊类型的分区与 "超图 "之间的对应关系，它们的证明使用了组合交换代数。

引用次数: 0

On locally n × n grid graphs 在局部 n×n 网格图上

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-26 DOI: 10.1016/j.jcta.2024.105957

Carmen Amarra , Wei Jin , Cheryl E. Praeger

We investigate locally

n \times n

grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on n vertices. We consider the subclass of these graphs for which each pair of vertices at distance two is joined by sufficiently many paths of length 2. The number of such paths is known to be at most 2n by previous work of Blokhuis and Brouwer. We show that if each pair is joined by at least

2 (n - 1)

such paths then the diameter is at most 3 and we give a tight upper bound on the order of the graphs. We show that graphs meeting this upper bound are distance-regular antipodal covers of complete graphs. We exhibit an infinite family of such graphs which are locally

n \times n

grid for odd prime powers n, and apply these results to locally

5 \times 5

grid graphs to obtain a classification for the case where either all μ-graphs (induced subgraphs on the set of common neighbours of two vertices at distance two) have order at least 8 or all μ-graphs have order c for some constant c.

我们研究的是局部 n×n 网格图，即任何顶点的邻域都是 n 个顶点上两个完整图的笛卡尔乘积的图。我们考虑的是这些图的子类，其中距离为 2 的每对顶点都有足够多的长度为 2 的路径相连。根据 Blokhuis 和 Brouwer 以前的研究，已知此类路径的数量最多为 2n。我们证明，如果每对图都至少有 2(n-1) 条这样的路径连接，那么直径最多为 3，并且我们给出了图的阶数的严格上限。我们证明，符合这一上限的图是完整图的距离规则反顶盖。我们展示了此类图的一个无穷族，它们在奇素数 n 的情况下是局部 n×n 网格图，并将这些结果应用于局部 5×5 网格图，从而获得了一种分类，即所有 μ 图（距离为 2 的两个顶点的公共相邻集合上的诱导子图）的阶数至少为 8，或者所有 μ 图的阶数为某个常数 c。

{"title":"On locally n × n grid graphs","authors":"Carmen Amarra , Wei Jin , Cheryl E. Praeger","doi":"10.1016/j.jcta.2024.105957","DOIUrl":"10.1016/j.jcta.2024.105957","url":null,"abstract":"<div><div>We investigate locally <math><mi>n</mi><mo>×</mo><mi>n</mi></math> grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on n vertices. We consider the subclass of these graphs for which each pair of vertices at distance two is joined by sufficiently many paths of length 2. The number of such paths is known to be at most 2n by previous work of Blokhuis and Brouwer. We show that if each pair is joined by at least <math><mn>2</mn><mo>(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></math> such paths then the diameter is at most 3 and we give a tight upper bound on the order of the graphs. We show that graphs meeting this upper bound are distance-regular antipodal covers of complete graphs. We exhibit an infinite family of such graphs which are locally <math><mi>n</mi><mo>×</mo><mi>n</mi></math> grid for odd prime powers n, and apply these results to locally <math><mn>5</mn><mo>×</mo><mn>5</mn></math> grid graphs to obtain a classification for the case where either all μ-graphs (induced subgraphs on the set of common neighbours of two vertices at distance two) have order at least 8 or all μ-graphs have order c for some constant c.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"209 ","pages":"Article 105957"},"PeriodicalIF":0.9,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322889","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}

引用次数: 0

On power monoids and their automorphisms 论幂单子及其自动形态

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-25 DOI: 10.1016/j.jcta.2024.105961

Salvatore Tringali, Weihao Yan

Endowed with the binary operation of set addition, the family

P_{fin, 0} (N)

of all finite subsets of

N

containing 0 forms a monoid, with the singleton {0} as its neutral element.

We show that the only non-trivial automorphism of

P_{fin, 0} (N)

is the involution

X \mapsto \max X - X

. The proof leverages ideas from additive number theory and proceeds through an unconventional induction on what we call the boxing dimension of a finite set of integers, that is, the smallest number of (discrete) intervals whose union is the set itself.

我们证明，Pfin,0(N)的唯一非难自变量是内卷X↦maxX-X。证明利用了加法数论的思想，通过对我们所说的有限整数集合的拳数维度（即其结合为集合本身的最小（离散）区间数）的非常规归纳来进行。

引用次数: 0

On non-empty cross-t-intersecting families 关于非空交叉相交族

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-24 DOI: 10.1016/j.jcta.2024.105960

Anshui Li , Huajun Zhang

Let

A_{1}, A_{2}, \dots, A_{m}

be families of k-element subsets of a n-element set. We call them cross-t-intersecting if

| A_{i} \cap A_{j} | \geq t

for any

A_{i} \in A_{i}

and

A_{j} \in A_{j}

with

i \neq j

. In this paper we will prove that, for

n \geq 2 k - t + 1

, if

A_{1}, A_{2}, \dots, A_{m}

are non-empty cross-t-intersecting families, then

\sum_{1 \leq i \leq m} | A_{i} | \leq \max {(\begin{matrix} n \\ k \end{matrix}) - \sum_{1 \leq i \leq t - 1} (\begin{matrix} k \\ i \end{matrix}) (\begin{matrix} n - k \\ k - i \end{matrix}) + m - 1, m M (n, k, t)},

where

M (n, k, t)

is the size of the maximum t-intersecting family of

(\begin{matrix} [n] \\ k \end{matrix})

. Moreover, the extremal families attaining the upper bound are characterized.

设 A1,A2,...,Am 是 n 元素集合的 k 元素子集族。对于任意 Ai∈Ai 和 Aj∈Aj 且 i≠j 的情况，如果|Ai∩Aj|≥t，我们称它们为交叉-t-交集。本文将证明，对于 n≥2k-t+1，如果 A1，A2，...，Am 是非空跨 t 交集族，则∑1≤i≤m|Ai|≤max{(nk)-∑1≤i≤t-1(ki)(n-kk-i)+m-1,mM(n,k,t)}，其中 M(n,k,t) 是 ([n]k) 的最大 t 交集族的大小。此外，还描述了达到上限的极值族的特征。

引用次数: 0

Avoiding intersections of given size in finite affine spaces AG(n,2) 在有限仿射空间 AG(n,2) 中避免给定大小的交集

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-24 DOI: 10.1016/j.jcta.2024.105959

Benedek Kovács , Zoltán Lóránt Nagy

We study the set of intersection sizes of a k-dimensional affine subspace and a point set of size

m \in [0, 2^{n}]

of the n-dimensional binary affine space

AG (n, 2)

. Following the theme of Erdős, Füredi, Rothschild and T. Sós, we partially determine which local densities in k-dimensional affine subspaces are unavoidable in all m-element point sets in the n-dimensional affine space.

We also show constructions of point sets for which the intersection sizes with k-dimensional affine subspaces take values from a set of a small size compared to

2^{k}

. These are built up from affine subspaces and so-called subspace evasive sets. Meanwhile, we improve the best known upper bounds on subspace evasive sets and apply results concerning the canonical signed-digit (CSD) representation of numbers.

Keywords: unavoidable, affine subspaces, evasive sets, random methods, canonical signed-digit number system.

我们研究了 k 维仿射子空间与 n 维二元仿射空间 AG(n,2) 大小为 m∈[0,2n] 的点集的交集大小集。按照厄尔多斯、富雷迪、罗斯柴尔德和 T. 索斯的主题，我们部分确定了 k 维仿射子空间中的哪些局部密度在 n 维仿射空间的所有 m 元素点集中是不可避免的。这些都是由仿射子空间和所谓的子空间规避集建立起来的。同时，我们改进了关于子空间逃避集的已知上界，并应用了关于数字的规范带符号数字（CSD）表示的结果。关键词：不可避免、仿射子空间、逃避集、随机方法、规范带符号数字系统。

{"title":"Avoiding intersections of given size in finite affine spaces AG(n,2)","authors":"Benedek Kovács , Zoltán Lóránt Nagy","doi":"10.1016/j.jcta.2024.105959","DOIUrl":"10.1016/j.jcta.2024.105959","url":null,"abstract":"<div><div>We study the set of intersection sizes of a k-dimensional affine subspace and a point set of size <math><mi>m</mi><mo>∈</mo><mo>[</mo><mn>0</mn><mo>,</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>]</mo></math> of the n-dimensional binary affine space <math><mrow><mi>AG</mi></mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></math>. Following the theme of Erdős, Füredi, Rothschild and T. Sós, we partially determine which local densities in k-dimensional affine subspaces are unavoidable in all m-element point sets in the n-dimensional affine space.</div><div>We also show constructions of point sets for which the intersection sizes with k-dimensional affine subspaces take values from a set of a small size compared to <math><msup><mrow><mn>2</mn></mrow><mrow><mi>k</mi></mrow></msup></math>. These are built up from affine subspaces and so-called subspace evasive sets. Meanwhile, we improve the best known upper bounds on subspace evasive sets and apply results concerning the canonical signed-digit (CSD) representation of numbers.</div><div>Keywords: unavoidable, affine subspaces, evasive sets, random methods, canonical signed-digit number system.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"209 ","pages":"Article 105959"},"PeriodicalIF":0.9,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097316524000980/pdfft?md5=62687b67d599290d3f204041642a9a6a&pid=1-s2.0-S0097316524000980-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142314104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A rank two Leonard pair in Terwilliger algebras of Doob graphs Doob 图的特威里格代数中的二阶伦纳德对

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-23 DOI: 10.1016/j.jcta.2024.105958

John Vincent S. Morales

Let

Γ = Γ (n, m)

denote the Doob graph formed by the Cartesian product of the nth Cartesian power of the Shrikhande graph and the mth Cartesian power of the complete graph on four vertices. Let

T = T (x)

denote the Terwilliger algebra of Γ with respect to a fixed vertex x of Γ and let W denote an arbitrary non-thin irreducible T-module in the standard module of Γ. In (Morales and Palma, 2021 [25]), it was shown that there exists a Lie algebra embedding π from the special orthogonal algebra

{so}_{4}

into T and that W is an irreducible

π ({so}_{4})

-module. In this paper, we consider two Cartan subalgebras

h, \tilde{h}

{so}_{4}

such that

h, \tilde{h}

generate

{so}_{4}

. Using the embedding

π : {so}_{4} \to T

, we show that

π (h)

and

π (\tilde{h})

act on W as a rank two Leonard pair. We also obtain several direct sum decompositions of W akin to how split decompositions are obtained from Leonard pairs of rank one.

让Γ=Γ(n,m) 表示由四个顶点上的 Shrikhande 图的第 n 个笛卡尔幂和完整图的第 m 个笛卡尔幂的笛卡尔乘积形成的 Doob 图。让 T=T(x) 表示关于 Γ 的固定顶点 x 的 Γ 的特尔维利格代数，让 W 表示 Γ 的标准模块中的任意非薄不可还原 T 模块。莫拉莱斯和帕尔马，2021 [25]）中证明，存在一个从特殊正交代数 so4 到 T 的列代数嵌入 π，并且 W 是一个不可还原的 π(so4)- 模块。在本文中，我们考虑 so4 的两个 Cartan 子代数 h,h˜，使得 h,h˜ 产生 so4。利用嵌入π:so4→T，我们证明π(h)和π(h˜)作为秩二伦纳德对作用于 W。我们还得到了 W 的几个直接和分解，类似于从一阶伦纳德对得到分裂分解的方法。

{"title":"A rank two Leonard pair in Terwilliger algebras of Doob graphs","authors":"John Vincent S. Morales","doi":"10.1016/j.jcta.2024.105958","DOIUrl":"10.1016/j.jcta.2024.105958","url":null,"abstract":"<div><div>Let <math><mi>Γ</mi><mo>=</mo><mi>Γ</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>m</mi><mo>)</mo></math> denote the Doob graph formed by the Cartesian product of the nth Cartesian power of the Shrikhande graph and the mth Cartesian power of the complete graph on four vertices. Let <math><mi>T</mi><mo>=</mo><mi>T</mi><mo>(</mo><mi>x</mi><mo>)</mo></math> denote the Terwilliger algebra of Γ with respect to a fixed vertex x of Γ and let W denote an arbitrary non-thin irreducible T-module in the standard module of Γ. In (Morales and Palma, 2021 [25]), it was shown that there exists a Lie algebra embedding π from the special orthogonal algebra <math><msub><mrow><mi>so</mi></mrow><mrow><mn>4</mn></mrow></msub></math> into T and that W is an irreducible <math><mi>π</mi><mo>(</mo><msub><mrow><mi>so</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>)</mo></math>-module. In this paper, we consider two Cartan subalgebras <math><mi>h</mi><mo>,</mo><mover><mrow><mi>h</mi></mrow><mrow><mo>˜</mo></mrow></mover></math> of <math><msub><mrow><mi>so</mi></mrow><mrow><mn>4</mn></mrow></msub></math> such that <math><mi>h</mi><mo>,</mo><mover><mrow><mi>h</mi></mrow><mrow><mo>˜</mo></mrow></mover></math> generate <math><msub><mrow><mi>so</mi></mrow><mrow><mn>4</mn></mrow></msub></math>. Using the embedding <math><mi>π</mi><mo>:</mo><msub><mrow><mi>so</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>→</mo><mi>T</mi></math>, we show that <math><mi>π</mi><mo>(</mo><mi>h</mi><mo>)</mo></math> and <math><mi>π</mi><mo>(</mo><mover><mrow><mi>h</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>)</mo></math> act on W as a rank two Leonard pair. We also obtain several direct sum decompositions of W akin to how split decompositions are obtained from Leonard pairs of rank one.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"210 ","pages":"Article 105958"},"PeriodicalIF":0.9,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142312553","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}

引用次数: 0

Covering the set of p-elements in finite groups by proper subgroups 用适当的子群覆盖有限群中 p 元素的集合

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-20 DOI: 10.1016/j.jcta.2024.105954

Attila Maróti , Juan Martínez , Alexander Moretó

Let p be a prime and let G be a finite group which is generated by the set $G_{p}$ of its p-elements. We show that if G is solvable and not a p-group, then the minimal number $σ_{p} (G)$ of proper subgroups of G whose union contains $G_{p}$ is equal to 1 less than the minimal number of proper subgroups of G whose union is G. For p-solvable groups G, we always have $σ_{p} (G) \geq p + 1$ . We study the case of alternating and symmetric groups G in detail.

设 p 是素数，G 是有限群，由其 p 元素集 Gp 生成。我们证明，如果 G 是可解而非 p 群，那么其联合包含 Gp 的 G 的适当子群的最小数目 σp(G) 等于比其联合是 G 的 G 的适当子群的最小数目少 1。对于 p 可解群 G，我们总是有 σp(G)≥p+1。我们将详细研究交替群和对称群 G 的情况。

引用次数: 0

Proofs of some conjectures of Merca on truncated series involving the Rogers-Ramanujan functions 梅尔卡关于涉及罗杰斯-拉马努扬函数的截断数列的一些猜想的证明

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-19 DOI: 10.1016/j.jcta.2024.105956

Yongqiang Chen, Olivia X.M. Yao

In 2012, Andrews and Merca investigated the truncated version of the Euler pentagonal number theorem. Their work has opened up a new study on truncated theta series and has inspired several mathematicians to work on the topic. In 2019, Merca studied the Rogers-Ramanujan functions and posed three groups of conjectures on truncated series involving the Rogers-Ramanujan functions. In this paper, we present a uniform method to prove the three groups of conjectures given by Merca based on a result due to Pólya and Szegö.

2012 年，安德鲁斯和梅尔卡研究了欧拉五边形数定理的截断版本。他们的研究开启了截断θ级数的新研究，并激发了多位数学家对这一课题的研究。2019 年，Merca 研究了 Rogers-Ramanujan 函数，并就涉及 Rogers-Ramanujan 函数的截断数列提出了三组猜想。在本文中，我们根据 Pólya 和 Szegö 的一个结果，提出了证明 Merca 提出的三组猜想的统一方法。

引用次数: 0

On the proportion of metric matroids whose Jacobians have nontrivial p-torsion 关于雅各布有非三角 p 扭转的公因子矩阵的比例

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-16 DOI: 10.1016/j.jcta.2024.105953

Sergio Ricardo Zapata Ceballos

We study the proportion of metric matroids whose Jacobians have nontrivial p-torsion. We establish a correspondence between these Jacobians and the $F_{p}$ -rational points on configuration hypersurfaces, thereby relating their proportions. By counting points over finite fields, we prove that the proportion of these Jacobians is asymptotically equivalent to $1 / p$ .

我们研究了雅各布具有非难 p 扭转的度量矩阵的比例。我们在这些雅各布与配置超曲面上的 Fp 有理点之间建立了对应关系，从而将它们的比例联系起来。通过计算有限域上的点，我们证明这些雅各布的比例在渐近上等同于 1/p。

引用次数: 0

Approximate generalized Steiner systems and near-optimal constant weight codes 近似广义斯泰纳系统和近优恒定权重码

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2024-09-11 DOI: 10.1016/j.jcta.2024.105955

Miao Liu , Chong Shangguan

Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for all fixed odd distances, there exist near-optimal CWCs and CCCs asymptotically achieving the classic Johnson-type upper bounds.

Let $A_{q} (n, d, w)$ denote the maximum size of q-ary CWCs of length n with constant weight w and minimum distance d. One of our main results shows that for all fixed $q, w$ and odd d, one has $\lim_{n \to \infty} \frac{A_{q} (n, d, w)}{(\begin{matrix} n \\ t \end{matrix})} = \frac{{(q - 1)}^{t}}{(\begin{matrix} w \\ t \end{matrix})}$ , where $t = \frac{2 w - d + 1}{2}$ . This implies the existence of near-optimal generalized Steiner systems originally introduced by Etzion, and can be viewed as a counterpart of a celebrated result of Rödl on the existence of near-optimal Steiner systems. Note that prior to our work, very little is known about $A_{q} (n, d, w)$ for $q \geq 3$ . A similar result is proved for the maximum size of CCCs.

We provide different proofs for our two main results, based on two strengthenings of the well-known Frankl-Rödl-Pippenger theorem on the existence of near-optimal matchings in hypergraphs: the first proof follows by Kahn's linear programming variation of the above theorem, and the second follows by the recent independent work of Delcourt-Postle, and Glock-Joos-Kim-Kühn-Lichev on the existence of near-optimal matchings avoiding certain forbidden configurations.

We also present several intriguing open questions for future research.

恒重码（CWC）和恒组成码（CCC）是组合学和编码理论近六十年来广泛研究的两类重要编码。本文证明，对于所有固定奇数距离，存在近似达到经典约翰逊型上界的近优 CWC 和 CCC。让 Aq(n,d,w) 表示长度为 n、权重为 w、距离为 d 的 q-ary CWCs 的最大尺寸。我们的一个主要结果表明，对于所有固定的 q、w 和奇数 d，都有 limn→∞Aq(n,d,w)(nt)=(q-1)t(wt)，其中 t=2w-d+12。这意味着最初由埃齐昂提出的近优广义斯坦纳系统的存在，可以看作是罗德尔关于近优斯坦纳系统存在的著名结果的对应物。请注意，在我们的研究之前，人们对 q≥3 时的 Aq(n,d,w) 知之甚少。我们基于著名的弗兰克尔-罗德尔-皮彭格（Frankl-Rödl-Pippenger）超图中近优匹配存在性定理的两个加强版，为我们的两个主要结果提供了不同的证明：第一个证明基于卡恩（Kahn）对上述定理的线性规划变式，第二个证明基于德尔库特-波斯特尔（Delcourt-Postle）和格洛克-朱斯-金-金-利切夫（Glock-Joos-Kim-Kühn-Lichev）最近关于避免某些禁止配置的近优匹配存在性的独立工作。我们还为未来研究提出了几个引人入胜的开放性问题。

{"title":"Approximate generalized Steiner systems and near-optimal constant weight codes","authors":"Miao Liu , Chong Shangguan","doi":"10.1016/j.jcta.2024.105955","DOIUrl":"10.1016/j.jcta.2024.105955","url":null,"abstract":"<div>Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for all fixed odd distances, there exist near-optimal CWCs and CCCs asymptotically achieving the classic Johnson-type upper bounds.Let <math><msub><mrow><mi>A</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>w</mi><mo>)</mo></math> denote the maximum size of q-ary CWCs of length n with constant weight w and minimum distance d. One of our main results shows that for all fixed <math><mi>q</mi><mo>,</mo><mi>w</mi></math> and odd d, one has <math><msub><mrow><mi>lim</mi></mrow><mrow><mi>n</mi><mo>→</mo><mo>∞</mo></mrow></msub><mo>⁡</mo><mfrac><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>w</mi><mo>)</mo></mrow><mrow><mo>(</mo><mtable><mtr><mtd><mi>n</mi></mtd></mtr><mtr><mtd><mi>t</mi></mtd></mtr></mtable><mo>)</mo></mrow></mfrac><mo>=</mo><mfrac><mrow><msup><mrow><mo>(</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mi>t</mi></mrow></msup></mrow><mrow><mo>(</mo><mtable><mtr><mtd><mi>w</mi></mtd></mtr><mtr><mtd><mi>t</mi></mtd></mtr></mtable><mo>)</mo></mrow></mfrac></math>, where <math><mi>t</mi><mo>=</mo><mfrac><mrow><mn>2</mn><mi>w</mi><mo>−</mo><mi>d</mi><mo>+</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math>. This implies the existence of near-optimal generalized Steiner systems originally introduced by Etzion, and can be viewed as a counterpart of a celebrated result of Rödl on the existence of near-optimal Steiner systems. Note that prior to our work, very little is known about <math><msub><mrow><mi>A</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>w</mi><mo>)</mo></math> for <math><mi>q</mi><mo>≥</mo><mn>3</mn></math>. A similar result is proved for the maximum size of CCCs.We provide different proofs for our two main results, based on two strengthenings of the well-known Frankl-Rödl-Pippenger theorem on the existence of near-optimal matchings in hypergraphs: the first proof follows by Kahn's linear programming variation of the above theorem, and the second follows by the recent independent work of Delcourt-Postle, and Glock-Joos-Kim-Kühn-Lichev on the existence of near-optimal matchings avoiding certain forbidden configurations.We also present several intriguing open questions for future research.</div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"209 ","pages":"Article 105955"},"PeriodicalIF":0.9,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097316524000943/pdfft?md5=65eb96db9a426be78f5105ffe48c2ece&pid=1-s2.0-S0097316524000943-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142168936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Journal of Combinatorial Theory Series A

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀