Journal of Combinatorial Theory Series A最新文献

英文中文

Truncated forms of MacMahon's q-series MacMahon q级数的截短形式

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106020

Mircea Merca

<div><div>In 1920, Percy Alexander MacMahon defined the partition generating functions<math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><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>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><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>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><mn>1</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><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></mrow></math> and<math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><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>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mi>k</mi></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></math> which have since played an important rol

1920 年，珀西-亚历山大-麦克马洪定义了分区生成函数 Ak(q)：=∑0<n1<n2<⋯<nkqn1+n2+⋯+nk(1-qn1)2(1-qn2)2⋯(1-qnk)2 和 Ck(q)：=∑0<n1<n2<⋯<nkq2n1+2n2+⋯+2nk-k(1-q2n1-1)2(1-q2n2-1)2⋯(1-q2nk-1)2，它们在组合数学中发挥了重要作用。对于每一个非负整数 k，乔治-安德鲁斯（George E. Andrews）和西蒙-罗斯（Simon C. F. Rose）证明了 Ak(q)可以用分区的生成函数来表示，其中每一部分可以用三种不同颜色中的一种来着色，而 Ck(q)可以用过分区的生成函数来表示。最近，对于每个非负整数 k，Ken Ono 和 Ajit Singh 证明了 Ak(q)、Ak+1(q)、Ak+2(q)......给出了每个部分可以用三种不同颜色中的一种着色的 n 的分区数的生成函数，而 Ck(q)、Ck+1(q)、Ck+2(q)......给出了 n 的过度分区数的生成函数。本文还介绍了一些悬而未决的问题。

引用次数: 0

Simple geometric mitosis 简单几何有丝分裂

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106022

Valentina Kiritchenko

We construct simple geometric operations on faces of the Cayley sum of two polytopes. These operations can be thought of as convex geometric counterparts of divided difference operators in Schubert calculus. We show that these operations give a uniform construction of Knutson–Miller mitosis in the type A and Fujita mitosis in the type C on Kogan faces of Gelfand–Zetlin polytopes.

在两个多面体的Cayley和的面上构造了简单的几何运算。这些操作可以被认为是舒伯特微积分中差除算子的凸几何对应物。我们证明了这些操作在Gelfand-Zetlin多面体的Kogan面上给出了a型的Knutson-Miller有丝分裂和C型的Fujita有丝分裂的统一结构。

引用次数: 0

On common energies and sumsets 在共同的能量和日落

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106026

Shkredov I.D.

We obtain a polynomial criterion for a set to have a small doubling in terms of the common energy of its subsets.

我们得到了一个多项式标准，即一个集合在其子集合的公共能量方面有一个小的加倍。

引用次数: 0

On recursive constructions for 2-designs over finite fields 有限域上2-设计的递归结构

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-07-01 Epub Date: 2025-01-20 DOI: 10.1016/j.jcta.2025.106006

Xiaoran Wang, Junling Zhou

This paper concentrates on recursive constructions for 2-designs over finite fields. In 1998, Itoh presented a powerful recursive construction: for certain index λ, if there exists a Singer cycle invariant 2-

{(l, 3, λ)}_{q}

design, then there also exists an SL

(m, q^{l})

invariant 2-

{(m l, 3, λ)}_{q}

design for all integers

m \geq 3

. We investigate the

GL (m, q^{l})

-incidence matrix between 2-subspaces and k-subspaces of

GF {(q)}^{m l}

with

m \geq 2

and

k \geq 3

in this work. As a generalization of Itoh's construction, the important case of

m = 2

is supplemented and a doubling construction is established for 2-

{(l, 3, λ)}_{q}

designs over finite fields. As a further generalization, a product construction is developed for q-analogs of group divisible designs (q-GDDs). For general block dimension

k \geq 3

, several new infinite families of q-GDDs are constructed. As applications, plenty of new infinite families of 2-designs over finite fields are constructed.

本文主要研究有限域上2-设计的递归结构。1998年，Itoh提出了一个强大的递归构造：对于某些指标λ，如果存在Singer循环不变量2-(l,3,λ)q设计，那么对于所有整数m≥3，也存在SL（m,ql）不变量2-(ml,3,λ)q设计。本文研究了GF(q)ml中m≥2和k≥3的2-子空间和k-子空间之间的GL(m,ql)-关联矩阵。作为Itoh构造的推广，补充了m=2的重要情况，并建立了有限域上2-(1,3,λ)q设计的双重构造。作为进一步推广，提出了群可分设计q-类似物的产品结构。对于一般块维数k≥3，构造了几个新的q- gdd无限族。作为应用，在有限域上构造了许多新的2-设计无限族。

{"title":"On recursive constructions for 2-designs over finite fields","authors":"Xiaoran Wang, Junling Zhou","doi":"10.1016/j.jcta.2025.106006","DOIUrl":"10.1016/j.jcta.2025.106006","url":null,"abstract":"<div><div>This paper concentrates on recursive constructions for 2-designs over finite fields. In 1998, Itoh presented a powerful recursive construction: for certain index λ, if there exists a Singer cycle invariant 2-<math><msub><mrow><mo>(</mo><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math> design, then there also exists an SL<math><mo>(</mo><mi>m</mi><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup><mo>)</mo></math> invariant 2-<math><msub><mrow><mo>(</mo><mi>m</mi><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math> design for all integers <math><mi>m</mi><mo>≥</mo><mn>3</mn></math>. We investigate the <math><mrow><mi>GL</mi></mrow><mo>(</mo><mi>m</mi><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup><mo>)</mo></math>-incidence matrix between 2-subspaces and k-subspaces of <math><mi>GF</mi><mspace></mspace><msup><mrow><mo>(</mo><mi>q</mi><mo>)</mo></mrow><mrow><mi>m</mi><mi>l</mi></mrow></msup></math> with <math><mi>m</mi><mo>≥</mo><mn>2</mn></math> and <math><mi>k</mi><mo>≥</mo><mn>3</mn></math> in this work. As a generalization of Itoh's construction, the important case of <math><mi>m</mi><mo>=</mo><mn>2</mn></math> is supplemented and a doubling construction is established for 2-<math><msub><mrow><mo>(</mo><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math> designs over finite fields. As a further generalization, a product construction is developed for q-analogs of group divisible designs (q-GDDs). For general block dimension <math><mi>k</mi><mo>≥</mo><mn>3</mn></math>, several new infinite families of q-GDDs are constructed. As applications, plenty of new infinite families of 2-designs over finite fields are constructed.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106006"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143103356","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

Structure of Terwilliger algebras of quasi-thin association schemes 拟薄关联格式的Terwilliger代数的结构

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106024

Zhenxian Chen , Changchang Xi

We show that the Terwilliger algebra of a quasi-thin association scheme over a field is always a quasi-hereditary cellular algebra in the sense of Cline-Parshall-Scott and of Graham-Lehrer, respectively, and that the basic algebra of the Terwilliger algebra is the dual extension of a star with all arrows pointing to its center if the field has characteristic 2. Thus many homological and representation-theoretic properties of these Terwilliger algebras can be determined completely. For example, the Nakayama conjecture holds true for Terwilliger algebras of quasi-thin association schemes.

我们证明了场上的拟薄关联格式的Terwilliger代数分别是Cline-Parshall-Scott和Graham-Lehrer意义上的拟遗传元代数，并且如果场具有特征2，则Terwilliger代数的基本代数是一颗所有箭头都指向其中心的星的对偶扩展。从而可以完全确定这些Terwilliger代数的许多同调性质和表示论性质。例如，Nakayama猜想对拟薄关联格式的Terwilliger代数成立。

引用次数: 0

Regular ovoids and Cameron-Liebler sets of generators in polar spaces 极空间中的正则卵圆和Cameron-Liebler生成集

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-07-01 Epub Date: 2025-02-25 DOI: 10.1016/j.jcta.2025.106029

Maarten De Boeck , Jozefien D'haeseleer , Morgan Rodgers

Cameron-Liebler sets of generators in polar spaces were introduced a few years ago as natural generalisations of the Cameron-Liebler sets of subspaces in projective spaces. In this article we present the first two constructions of non-trivial Cameron-Liebler sets of generators in polar spaces. Also regular m-ovoids of k-spaces are introduced as a generalization of m-ovoids of polar spaces. They are used in one of the aforementioned constructions of Cameron-Liebler sets.

极空间中的卡梅隆-利伯勒生成器集是几年前作为投影空间中子空间的卡梅隆-利伯勒集的自然广义而提出的。在这篇文章中，我们首次提出了极空间中非难卡梅隆-利伯勒生成器集的两个构造。此外，还介绍了 k 空间的正则 m-ovoids 作为极空间 m-ovoids 的广义。它们被用于上述卡梅隆-利伯勒集合的一个构造中。

引用次数: 0

Cayley extensions of maniplexes and polytopes 复形和多面体的Cayley扩展

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-05-01 Epub Date: 2024-12-18 DOI: 10.1016/j.jcta.2024.106000

Gabe Cunningham , Elías Mochán , Antonio Montero

A map on a surface whose automorphism group has a subgroup acting regularly on its vertices is called a Cayley map. Here we generalize that notion to maniplexes and polytopes. We define

M

to be a Cayley extension of

K

if the facets of

M

are isomorphic to

K

and if some subgroup of the automorphism group of

M

acts regularly on the facets of

M

. We show that many natural extensions in the literature on maniplexes and polytopes are in fact Cayley extensions. We also describe several universal Cayley extensions. Finally, we examine the automorphism group and symmetry type graph of Cayley extensions.

曲面上的自同构群在其顶点上有规则作用的子群的映射称为Cayley映射。这里我们把这个概念推广到复形和多面体。如果M的面与K同构，并且M的自同构群的某子群规律地作用于M的面，我们定义M是K的Cayley扩展。我们证明了文献中许多关于复形和多面体的自然扩展实际上是Cayley扩展。我们还描述了几个通用的Cayley扩展。最后，我们研究了Cayley扩展的自同构群和对称型图。

引用次数: 0

Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions 西顿集，瘦集，和向量布尔函数的非线性

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-05-01 Epub Date: 2024-12-19 DOI: 10.1016/j.jcta.2024.106001

Gábor P. Nagy

The vectorial nonlinearity of a vector-valued function is its distance from the set of affine functions. In 2017, Liu, Mesnager, and Chen conjectured a general upper bound for the vectorial linearity. Recently, Carlet established a lower bound in terms of differential uniformity. In this paper, we improve Carlet's lower bound. Our approach is based on the fact that the level sets of a vectorial Boolean function are thin sets. In particular, level sets of APN functions are Sidon sets, hence the Liu-Mesnager-Chen conjecture predicts that in

F_{2}^{n}

, there should be Sidon sets of size at least

2^{n / 2} + 1

for all n. This paper provides an overview of the known large Sidon sets in

F_{2}^{n}

, and examines the completeness of the large Sidon sets derived from hyperbolas and ellipses of the finite affine plane.

向量值函数的向量非线性是它到仿射函数集合的距离。2017年，Liu、Mesnager和Chen推测了向量线性的一般上界。最近，Carlet建立了微分均匀性的下界。本文改进了Carlet下界。我们的方法是基于这样一个事实，即向量布尔函数的水平集是瘦集。特别是，APN函数的水平集是Sidon集，因此，Liu-Mesnager-Chen猜想预测，在F2n中，对于所有n，应该存在大小至少为2n/2+1的Sidon集。本文概述了F2n中已知的大Sidon集，并检验了由有限仿射平面的双曲线和椭圆导出的大Sidon集的完备性。

引用次数: 0

Diametric problem for permutations with the Ulam metric (optimal anticodes) 具有Ulam度量的置换的直径问题（最优反码）

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-05-01 Epub Date: 2024-12-19 DOI: 10.1016/j.jcta.2024.106002

Pat Devlin, Leo Douhovnikoff

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let

S_{n}

denote the set of permutations on n symbols, and for each

σ, τ \in S_{n}

, define their Ulam distance as the number of distinct symbols that must be deleted from each until they are equal. We obtain a near-optimal upper bound on the size of the intersection of two balls in this space, and as a corollary, we prove that a set of diameter at most k has size at most

2^{k + C k^{2 / 3}} n! / (n - k)!

, compared to the best known construction of size

n! / (n - k)!

我们研究了在Ulam距离下排列空间中的直径问题（即最优反码问题）。也就是说，令Sn表示n个符号的排列集合，对于每个σ，τ∈Sn，定义它们的Ulam距离为必须从每个符号中删除直至相等的不同符号的数目。在此空间中，我们得到了两个球的交点大小的一个近似最优上界，并作为推论，证明了一个直径不超过k的集合的大小不超过2k+Ck2/3n!/(n−k)！，与最著名的尺寸为n!/(n−k)!的结构相比。

{"title":"Diametric problem for permutations with the Ulam metric (optimal anticodes)","authors":"Pat Devlin, Leo Douhovnikoff","doi":"10.1016/j.jcta.2024.106002","DOIUrl":"10.1016/j.jcta.2024.106002","url":null,"abstract":"<div><div>We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let <math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math> denote the set of permutations on n symbols, and for each <math><mi>σ</mi><mo>,</mo><mi>τ</mi><mo>∈</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math>, define their Ulam distance as the number of distinct symbols that must be deleted from each until they are equal. We obtain a near-optimal upper bound on the size of the intersection of two balls in this space, and as a corollary, we prove that a set of diameter at most k has size at most <math><msup><mrow><mn>2</mn></mrow><mrow><mi>k</mi><mo>+</mo><mi>C</mi><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn><mo>/</mo><mn>3</mn></mrow></msup></mrow></msup><mi>n</mi><mo>!</mo><mo>/</mo><mo>(</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>)</mo><mo>!</mo></math>, compared to the best known construction of size <math><mi>n</mi><mo>!</mo><mo>/</mo><mo>(</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>)</mo><mo>!</mo></math>.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"212 ","pages":"Article 106002"},"PeriodicalIF":0.9,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143095724","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 a conjecture concerning the r-Euler-Mahonian statistic on permutations 关于r-Euler-Mahonian排列统计量的一个猜想

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A

Pub Date : 2025-05-01 Epub Date: 2025-01-17 DOI: 10.1016/j.jcta.2025.106008

Kaimei Huang , Zhicong Lin , Sherry H.F. Yan

A pair

(s t_{1}, s t_{2})

of permutation statistics is said to be r-Euler-Mahonian if

(s t_{1}, s t_{2})

and (rdes, rmaj) are equidistributed over the set

S_{n}

of all permutations of

{1, 2, \dots, n}

, where rdes denotes the r-descent number and rmaj denotes the r-major index introduced by Rawlings. The main objective of this paper is to prove that

({exc}_{r}, {den}_{r})

and (rdes, rmaj) are equidistributed over

S_{n}

, thereby confirming a recent conjecture posed by Liu. When

r = 1

, the result recovers the equidistribution of

(des, maj)

and

(exc, den)

, which was first conjectured by Denert and proved by Foata and Zeilberger.

如果（st1,st2）和（rdes, rmaj）在{1,2，…，n}的所有排列的集合Sn上是等分布的，我们称一对（st1,st2）排列统计量为r-Euler-Mahonian，其中rdes表示r-下降数，rmaj表示罗林斯引入的r-主指数。本文的主要目的是证明（excr,denr）和（rdes, rmaj）在Sn上是均匀分布的，从而证实Liu最近提出的一个猜想。当r=1时，结果恢复了（des,maj）和（exc,den）的均一分布，该均一分布最早由Denert推测，并由Foata和Zeilberger证明。

引用次数: 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.

﹀