首页 > 最新文献

Advances in Applied Mathematics最新文献

英文 中文
Algebraic network reconstruction of discrete dynamical systems 离散动力系统的代数网络重构
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-09-04 DOI: 10.1016/j.aam.2024.102760
Heather A. Harrington , Mike Stillman , Alan Veliz-Cuba

We present a computational algebra solution to reverse engineering the network structure of discrete dynamical systems from data. We use pseudomonomial ideals to determine dependencies between variables that encode constraints on the possible wiring diagrams underlying the process generating the discrete-time, continuous-space data. Our work assumes that each variable is either monotone increasing or decreasing. We prove that with enough data, even in the presence of small noise, our method can reconstruct the correct unique wiring diagram.

我们提出了一种计算代数解决方案,用于从数据中逆向工程离散动力系统的网络结构。我们使用伪自治理想来确定变量之间的依赖关系,这些变量编码了对产生离散时间、连续空间数据的过程的可能线路图的约束。我们的工作假设每个变量都是单调递增或递减的。我们证明,只要有足够多的数据,即使存在较小的噪声,我们的方法也能重建正确的唯一布线图。
{"title":"Algebraic network reconstruction of discrete dynamical systems","authors":"Heather A. Harrington ,&nbsp;Mike Stillman ,&nbsp;Alan Veliz-Cuba","doi":"10.1016/j.aam.2024.102760","DOIUrl":"10.1016/j.aam.2024.102760","url":null,"abstract":"<div><p>We present a computational algebra solution to reverse engineering the network structure of discrete dynamical systems from data. We use pseudomonomial ideals to determine dependencies between variables that encode constraints on the possible wiring diagrams underlying the process generating the discrete-time, continuous-space data. Our work assumes that each variable is either monotone increasing or decreasing. We prove that with enough data, even in the presence of small noise, our method can reconstruct the correct unique wiring diagram.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bijections on pattern avoiding inversion sequences and related objects 避免反转序列和相关对象的模式双射
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-09-04 DOI: 10.1016/j.aam.2024.102771
JiSun Huh , Sangwook Kim , Seunghyun Seo , Heesung Shin

The number of inversion sequences avoiding two patterns 101 and 102 is known to be the same as the number of permutations avoiding three patterns 2341, 2431, and 3241. This sequence also counts the number of Schröder paths without triple descents, restricted bicolored Dyck paths, (101,021)-avoiding inversion sequences, and weighted ordered trees. We provide bijections to integrate them together by introducing F-paths. Moreover, we define three kinds of statistics for each of the objects and count the number of each object with respect to these statistics. We also discuss direct sums of each object.

已知避免 101 和 102 两种模式的反转序列数与避免 2341、2431 和 3241 三种模式的排列数相同。这个序列还计算了没有三重下降的施罗德路径、受限双色戴克路径、避免 (101,021) 反转序列和加权有序树的数量。通过引入 F 路径,我们提供了将它们整合在一起的双射。此外,我们还为每个对象定义了三种统计量,并计算了与这些统计量相关的每个对象的数量。我们还讨论了每个对象的直接和。
{"title":"Bijections on pattern avoiding inversion sequences and related objects","authors":"JiSun Huh ,&nbsp;Sangwook Kim ,&nbsp;Seunghyun Seo ,&nbsp;Heesung Shin","doi":"10.1016/j.aam.2024.102771","DOIUrl":"10.1016/j.aam.2024.102771","url":null,"abstract":"<div><p>The number of inversion sequences avoiding two patterns 101 and 102 is known to be the same as the number of permutations avoiding three patterns 2341, 2431, and 3241. This sequence also counts the number of Schröder paths without triple descents, restricted bicolored Dyck paths, <span><math><mo>(</mo><mn>101</mn><mo>,</mo><mn>021</mn><mo>)</mo></math></span>-avoiding inversion sequences, and weighted ordered trees. We provide bijections to integrate them together by introducing <em>F</em>-paths. Moreover, we define three kinds of statistics for each of the objects and count the number of each object with respect to these statistics. We also discuss direct sums of each object.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extended Schur functions and bases related by involutions 扩展舒尔函数和渐开线相关基数
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-09-03 DOI: 10.1016/j.aam.2024.102770
Spencer Daugherty

We introduce two new bases of QSym, the reverse extended Schur functions and the row-strict reverse extended Schur functions, as well as their duals in NSym, the reverse shin functions and row-strict reverse shin functions. These bases are the images of the extended Schur basis and shin basis under the involutions ρ and ω, which generalize the classical involution ω on the symmetric functions. In addition, we prove a Jacobi-Trudi rule for certain shin functions using creation operators. We define skew extended Schur functions and skew-II extended Schur functions based on left and right actions of NSym and QSym respectively. We then use the involutions ρ and ω to translate these and other known results to our reverse and row-strict reverse bases.

我们引入了 QSym 的两个新基,即反向扩展舒尔函数和行严格反向扩展舒尔函数,以及它们在 NSym 中的对偶基,即反向歆函数和行严格反向歆函数。这些基是扩展舒尔基和胫基在卷积 ρ 和 ω 下的映像,而卷积 ρ 和 ω 是对称函数上经典卷积 ω 的一般化。此外,我们还利用创造算子证明了某些歆函数的雅各比-特鲁迪法则。我们分别基于 NSym 和 QSym 的左作用和右作用定义了偏斜扩展舒尔函数和偏斜-II 扩展舒尔函数。然后,我们使用渐开线 ρ 和 ω 将这些结果和其他已知结果转化为我们的反向基和行严格反向基。
{"title":"Extended Schur functions and bases related by involutions","authors":"Spencer Daugherty","doi":"10.1016/j.aam.2024.102770","DOIUrl":"10.1016/j.aam.2024.102770","url":null,"abstract":"<div><p>We introduce two new bases of <span><math><mi>Q</mi><mi>S</mi><mi>y</mi><mi>m</mi></math></span>, the reverse extended Schur functions and the row-strict reverse extended Schur functions, as well as their duals in <em>NSym</em>, the reverse shin functions and row-strict reverse shin functions. These bases are the images of the extended Schur basis and shin basis under the involutions <em>ρ</em> and <em>ω</em>, which generalize the classical involution <em>ω</em> on the symmetric functions. In addition, we prove a Jacobi-Trudi rule for certain shin functions using creation operators. We define skew extended Schur functions and skew-II extended Schur functions based on left and right actions of <em>NSym</em> and <span><math><mi>Q</mi><mi>S</mi><mi>y</mi><mi>m</mi></math></span> respectively. We then use the involutions <em>ρ</em> and <em>ω</em> to translate these and other known results to our reverse and row-strict reverse bases.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Off-diagonally symmetric domino tilings of the Aztec diamond of odd order 奇数阶阿兹特克钻石的非对角对称多米诺倾斜图
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-28 DOI: 10.1016/j.aam.2024.102759
Yi-Lin Lee

We study the enumeration of off-diagonally symmetric domino tilings of odd-order Aztec diamonds in two directions: (1) with one boundary defect, and (2) with maximally-many zeroes on the diagonal. In the first direction, we prove a symmetry property which states that the numbers of off-diagonally symmetric domino tilings of the Aztec diamond of order 2n1 are equal when the boundary defect is at the kth position and the (2nk)th position on the boundary, respectively. This symmetry property proves a special case of a recent conjecture by Behrend, Fischer, and Koutschan.

In the second direction, a Pfaffian formula is obtained for the number of “nearly” off-diagonally symmetric domino tilings of odd-order Aztec diamonds, where the entries of the Pfaffian satisfy a simple recurrence relation. The numbers of domino tilings mentioned in the above two directions do not seem to have a simple product formula, but we show that these numbers satisfy simple matrix equations in which the entries of the matrix are given by Delannoy numbers. The proof of these results involves the method of non-intersecting lattice paths and a modification of Stembridge's Pfaffian formula for families of non-intersecting lattice paths. Finally, we propose conjectures concerning the log-concavity and asymptotic behavior of the number of off-diagonally symmetric domino tilings of odd-order Aztec diamonds.

我们从两个方向研究了奇数阶阿兹特克金刚石的对角线外对称多米诺倾斜的枚举:(1)有一个边界缺陷;(2)对角线上有最大数量的零。在第一个方向上,我们证明了一个对称性质,即当边界缺陷分别位于边界上的第 k 个位置和第 (2n-k)th 个位置时,2n-1 阶阿兹特克金刚石的对角线外对称多米诺倾斜图的数量相等。这一对称性证明了贝伦德、费舍尔和库茨昌最近猜想的一个特例。在第二个方向上,得到了奇数阶阿兹特克金刚石的 "近 "对角线外对称多米诺倾斜数的普法因子公式,其中普法因子的条目满足一个简单的递推关系。上述两个方向中提到的多米诺倾斜数似乎没有简单的乘积公式,但我们证明了这些数字满足简单的矩阵方程,其中矩阵的条目由 Delannoy 数给出。这些结果的证明涉及非相交网格路径的方法和对斯特姆布里奇的非相交网格路径族的普法公式的修改。最后,我们提出了关于奇阶阿兹特克钻石的非对角线对称多米诺倾斜数的对数凹性和渐近行为的猜想。
{"title":"Off-diagonally symmetric domino tilings of the Aztec diamond of odd order","authors":"Yi-Lin Lee","doi":"10.1016/j.aam.2024.102759","DOIUrl":"10.1016/j.aam.2024.102759","url":null,"abstract":"<div><p>We study the enumeration of off-diagonally symmetric domino tilings of odd-order Aztec diamonds in two directions: (1) with one boundary defect, and (2) with maximally-many zeroes on the diagonal. In the first direction, we prove a symmetry property which states that the numbers of off-diagonally symmetric domino tilings of the Aztec diamond of order <span><math><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></math></span> are equal when the boundary defect is at the <em>k</em>th position and the <span><math><mo>(</mo><mn>2</mn><mi>n</mi><mo>−</mo><mi>k</mi><mo>)</mo></math></span>th position on the boundary, respectively. This symmetry property proves a special case of a recent conjecture by Behrend, Fischer, and Koutschan.</p><p>In the second direction, a Pfaffian formula is obtained for the number of “nearly” off-diagonally symmetric domino tilings of odd-order Aztec diamonds, where the entries of the Pfaffian satisfy a simple recurrence relation. The numbers of domino tilings mentioned in the above two directions do not seem to have a simple product formula, but we show that these numbers satisfy simple matrix equations in which the entries of the matrix are given by Delannoy numbers. The proof of these results involves the method of non-intersecting lattice paths and a modification of Stembridge's Pfaffian formula for families of non-intersecting lattice paths. Finally, we propose conjectures concerning the log-concavity and asymptotic behavior of the number of off-diagonally symmetric domino tilings of odd-order Aztec diamonds.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142087152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stereologically adapted Crofton formulae for tensor valuations 用于张量估值的经立体学调整的克罗夫顿公式
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-27 DOI: 10.1016/j.aam.2024.102754
Emil Dare

The classical Crofton formula explains how intrinsic volumes of a convex body K in n-dimensional Euclidean space can be obtained from integrating a measurement function at sections of K with invariantly moved affine flats. We generalize this idea by constructing stereologically adapted Crofton formulae for translation invariant Minkowski tensors, expressing a prescribed tensor valuation as an invariant integral of a measurement function of section profiles with flats. The measurement functions are weighed sums of powers of the metric tensor times Minkowski valuations. The weights are determined explicitly from known Crofton formulae using Zeilberger's algorithm. The main result is an exhaustive set of measurement functions where the invariant integration is over flats.

With the main result at hand, a Blaschke-Petkantschin formula allows us to establish new measurement functions valid when the invariant integration over flats is replaced by an invariant integration over subspaces containing a fixed subspace of lower dimension. Likewise, a stereologically adapted Crofton formula valid in the scheme of vertical sections is constructed. Only some special cases of this result have been stated explicitly before, with even the three-dimensional case yielding a new stereological formula. Here, we obtain new vertical section formulae for the surface tensors of even rank.

经典的克罗夫顿公式解释了如何通过对具有不变移动仿射平面的 K 截面的测量函数进行积分来获得 n 维欧几里得空间中凸体 K 的固有体积。我们通过为平移不变的闵科夫斯基张量构建立体适应的克罗夫顿公式,将规定的张量估值表示为带有平面的剖面测量函数的不变积分,从而推广了这一思想。测量函数是度量张量乘以闵科夫斯基估值的幂的加权和。权重是利用齐尔伯格算法从已知的克罗夫顿公式中明确确定的。有了这个主要结果,我们就可以利用布拉什克-佩特康钦公式建立新的测量函数,当对平面的不变积分被对包含低维度固定子空间的子空间的不变积分所取代时,新的测量函数就有效了。同样,我们还构建了一个在垂直剖面方案中有效的立体改编克罗夫顿公式。这一结果只有一些特殊情况曾被明确阐述过,即使是三维情况也会产生一个新的立体公式。在此,我们获得了偶数阶曲面张量的新垂直剖面公式。
{"title":"Stereologically adapted Crofton formulae for tensor valuations","authors":"Emil Dare","doi":"10.1016/j.aam.2024.102754","DOIUrl":"10.1016/j.aam.2024.102754","url":null,"abstract":"<div><p>The classical Crofton formula explains how intrinsic volumes of a convex body <em>K</em> in <em>n</em>-dimensional Euclidean space can be obtained from integrating a measurement function at sections of <em>K</em> with invariantly moved affine flats. We generalize this idea by constructing stereologically adapted Crofton formulae for translation invariant Minkowski tensors, expressing a prescribed tensor valuation as an invariant integral of a measurement function of section profiles with flats. The measurement functions are weighed sums of powers of the metric tensor times Minkowski valuations. The weights are determined explicitly from known Crofton formulae using Zeilberger's algorithm. The main result is an exhaustive set of measurement functions where the invariant integration is over flats.</p><p>With the main result at hand, a Blaschke-Petkantschin formula allows us to establish new measurement functions valid when the invariant integration over flats is replaced by an invariant integration over subspaces containing a fixed subspace of lower dimension. Likewise, a stereologically adapted Crofton formula valid in the scheme of vertical sections is constructed. Only some special cases of this result have been stated explicitly before, with even the three-dimensional case yielding a new stereological formula. Here, we obtain new vertical section formulae for the surface tensors of even rank.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0196885824000861/pdfft?md5=7cfe89c5b6afba8f72d1292bc78aca12&pid=1-s2.0-S0196885824000861-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142083640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some remarks on permanental dominance conjecture 关于永久优势猜想的几点评论
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-26 DOI: 10.1016/j.aam.2024.102758
Kijti Rodtes

In this paper we provide an identity between the determinant and other generalized matrix functions, and give a criterion for positive semi-definite matrices to satisfy the permanental dominance conjecture. As a consequence, infinitely many classes of positive semi-definite matrices satisfying the conjecture (does not depend on groups or characters) are provided by generating from any positive semi-definite matrix having no zero in the first column.

在本文中,我们提供了行列式与其他广义矩阵函数之间的同一性,并给出了正半有穷数矩阵满足永久支配猜想的标准。因此,只要从任何第一列没有零的正半有穷数矩阵生成,就能得到无限多类满足猜想(不依赖于群或字符)的正半有穷数矩阵。
{"title":"Some remarks on permanental dominance conjecture","authors":"Kijti Rodtes","doi":"10.1016/j.aam.2024.102758","DOIUrl":"10.1016/j.aam.2024.102758","url":null,"abstract":"<div><p>In this paper we provide an identity between the determinant and other generalized matrix functions, and give a criterion for positive semi-definite matrices to satisfy the permanental dominance conjecture. As a consequence, infinitely many classes of positive semi-definite matrices satisfying the conjecture (does not depend on groups or characters) are provided by generating from any positive semi-definite matrix having no zero in the first column.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142076510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
More bijective combinatorics of weakly increasing trees 弱递增树的更多双射组合学
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-20 DOI: 10.1016/j.aam.2024.102755
Zhicong Lin , Jing Liu , Suijie Wang , Wenston J.T. Zang

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin–Ma–Ma–Zhou (2021). Various intriguing connections and bijections for weakly increasing trees have already been found and the purpose of this paper is to present yet more bijective combinatorics on this unified object. Two of our main contributions are

  • extension of an equidistribution result on plane trees due to Eu–Seo–Shin (2017), regarding levels and degrees of nodes, to weakly increasing trees;

  • a new interpretation of the multiset Schett polynomials in terms of odd left/right chains on weakly increasing binary trees.

Interesting consequences are discussed, including new tree interpretations for the Jacobi elliptic functions and Euler numbers. Relevant enumerative results are also presented, involving recurrence relations, exponential generating functions and context-free grammars.
作为递增树和平面树的统一,林-马-周(2021)提出了多集标注的弱递增树。人们已经发现了弱递增树的各种有趣的联系和双射,本文的目的是在这个统一对象上提出更多的双射组合论。我们的两个主要贡献是--将 Eu-Seo-Shin (2017) 提出的平面树上关于节点等级和度的等分布结果扩展到弱递增树上;--用弱递增二叉树上的奇左链/奇右链解释多集谢特多项式。讨论了有趣的结果,包括雅可比椭圆函数和欧拉数的新树解释。此外,还介绍了涉及递推关系、指数生成函数和无上下文语法的相关枚举结果。
{"title":"More bijective combinatorics of weakly increasing trees","authors":"Zhicong Lin ,&nbsp;Jing Liu ,&nbsp;Suijie Wang ,&nbsp;Wenston J.T. Zang","doi":"10.1016/j.aam.2024.102755","DOIUrl":"10.1016/j.aam.2024.102755","url":null,"abstract":"<div><p>As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin–Ma–Ma–Zhou (2021). Various intriguing connections and bijections for weakly increasing trees have already been found and the purpose of this paper is to present yet more bijective combinatorics on this unified object. Two of our main contributions are</p><ul><li><span>•</span><span><p>extension of an equidistribution result on plane trees due to Eu–Seo–Shin (2017), regarding levels and degrees of nodes, to weakly increasing trees;</p></span></li><li><span>•</span><span><p>a new interpretation of the multiset Schett polynomials in terms of odd left/right chains on weakly increasing binary trees.</p></span></li></ul> Interesting consequences are discussed, including new tree interpretations for the Jacobi elliptic functions and Euler numbers. Relevant enumerative results are also presented, involving recurrence relations, exponential generating functions and context-free grammars.</div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142011722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stratified simple homotopy type: Theory and computation 分层简单同调类型:理论与计算
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-12 DOI: 10.1016/j.aam.2024.102753
Markus Banagl , Tim Mäder , Filip Sadlo

Generalizing the idea of elementary simplicial collapses and expansions in classical simple homotopy theory to a stratified setting, we find local combinatorial transformations on stratified simplicial complexes that leave the global stratified homotopy type invariant. In particular, we obtain the notions of stratified formal deformations generalizing J. H. C. Whitehead's formal deformations. We implement the algorithmic execution of such transformations and the computation of intersection homology to illustrate the behavior of stratified simple homotopy equivalences on Vietoris-Rips type complexes associated to point sets sampled near given, possibly singular, spaces.

将经典简单同调理论中的基本简单坍缩和展开的思想推广到分层环境中,我们发现了分层简单复合物上的局部组合变换,这些变换使全局分层同调类型保持不变。特别是,我们得到了分层形式变形的概念,概括了怀特海(J. H. C. Whitehead)的形式变形。我们实现了这种变形的算法执行和交点同调的计算,以说明与在给定空间(可能是奇异空间)附近采样的点集相关联的 Vietoris-Rips 型复合物上的分层简单同调等价物的行为。
{"title":"Stratified simple homotopy type: Theory and computation","authors":"Markus Banagl ,&nbsp;Tim Mäder ,&nbsp;Filip Sadlo","doi":"10.1016/j.aam.2024.102753","DOIUrl":"10.1016/j.aam.2024.102753","url":null,"abstract":"<div><p>Generalizing the idea of elementary simplicial collapses and expansions in classical simple homotopy theory to a stratified setting, we find local combinatorial transformations on stratified simplicial complexes that leave the global stratified homotopy type invariant. In particular, we obtain the notions of stratified formal deformations generalizing J. H. C. Whitehead's formal deformations. We implement the algorithmic execution of such transformations and the computation of intersection homology to illustrate the behavior of stratified simple homotopy equivalences on Vietoris-Rips type complexes associated to point sets sampled near given, possibly singular, spaces.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S019688582400085X/pdfft?md5=38b8418d116b6eea867db781229ca852&pid=1-s2.0-S019688582400085X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141954155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the s-Gaussian measure in Rn 关于 Rn 中的 s 高斯度量
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-01 DOI: 10.1016/j.aam.2024.102744
Youjiang Lin , Sudan Xing

We construct the s-Gauss probability space by introducing the s-Gaussian density function in Rn for s0, a generalization of the classic Gaussian density function. Based on the s-Gaussian density function, we propose the (s,k)-Ehrhard symmetrization which is an extension of the traditional Ehrhard symmetrization for sets in Rn. In particular, we establish the s-Gaussian isoperimetric inequality with respect to s-Gaussian measure in R2. Furthermore, we propose and prove the s-Ehrhard-Borell inequalities for s>0 when one of the two sets is a Borel set whilst the other being a convex set as well as the case when two sets are convex in R1 with different methods.

我们通过引入 Rn 中 s≥0 的 s-Gaussian 密度函数来构建 s-Gauss 概率空间,这是经典高斯密度函数的广义化。基于 s-Gaussian 密度函数,我们提出了 (s,k)-Ehrhard 对称性,这是对 Rn 中集合的传统 Ehrhard 对称性的扩展。我们特别建立了关于 R2 中 s-Gaussian 度量的 s-Gaussian 等周不等式。此外,我们还提出并证明了当两个集合中的一个是 Borel 集而另一个是凸集时的 s>0 的 s-Ehrhard-Borell 不等式,以及用不同方法证明了 R1 中两个集合是凸集的情况。
{"title":"On the s-Gaussian measure in Rn","authors":"Youjiang Lin ,&nbsp;Sudan Xing","doi":"10.1016/j.aam.2024.102744","DOIUrl":"10.1016/j.aam.2024.102744","url":null,"abstract":"<div><p>We construct the <em>s</em>-Gauss probability space by introducing the <em>s</em>-Gaussian density function in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> for <span><math><mi>s</mi><mo>≥</mo><mn>0</mn></math></span>, a generalization of the classic Gaussian density function. Based on the <em>s</em>-Gaussian density function, we propose the <span><math><mo>(</mo><mi>s</mi><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-Ehrhard symmetrization which is an extension of the traditional Ehrhard symmetrization for sets in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span>. In particular, we establish the <em>s</em>-Gaussian isoperimetric inequality with respect to <em>s</em>-Gaussian measure in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>. Furthermore, we propose and prove the <em>s</em>-Ehrhard-Borell inequalities for <span><math><mi>s</mi><mo>&gt;</mo><mn>0</mn></math></span> when one of the two sets is a Borel set whilst the other being a convex set as well as the case when two sets are convex in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> with different methods.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141961406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Two measures of efficiency for the secretary problem with multiple items at each rank 秘书问题的两个效率衡量标准,每个等级有多个项目
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2024-08-01 DOI: 10.1016/j.aam.2024.102751
Ross G. Pinsky
<div><p>For <span><math><mn>2</mn><mo>≤</mo><mi>k</mi><mo>∈</mo><mi>N</mi></math></span>, consider the following adaptation of the classical secretary problem. There are <em>k</em> items at each of <em>n</em> linearly ordered ranks. The <em>kn</em> items are revealed, one item at a time, in a uniformly random order, to an observer whose objective is to select an item of highest rank. At each stage the observer only knows the relative ranks of the items that have arrived thus far, and must either select the current item, in which case the process terminates, or reject it and continue to the next item. For <span><math><mi>M</mi><mo>∈</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>⋯</mo><mo>,</mo><mi>k</mi><mi>n</mi><mo>−</mo><mn>1</mn><mo>}</mo></math></span>, let <span><math><mi>S</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>;</mo><mi>M</mi><mo>)</mo></math></span> denote the strategy whereby one allows the first <em>M</em> items to pass, and then selects the first later arriving item whose rank is either equal to or greater than the highest rank of the first <em>M</em> items (if such an item exists). Let <span><math><msub><mrow><mi>W</mi></mrow><mrow><mi>S</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>;</mo><mi>M</mi><mo>)</mo></mrow></msub></math></span> denote the event that one selects an item of highest rank using strategy <span><math><mi>S</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>;</mo><mi>M</mi><mo>)</mo></math></span> and let <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>(</mo><msub><mrow><mi>W</mi></mrow><mrow><mi>S</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>;</mo><mi>M</mi><mo>)</mo></mrow></msub><mo>)</mo></math></span> denote the corresponding probability. We obtain a formula for <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>(</mo><msub><mrow><mi>W</mi></mrow><mrow><mi>S</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>;</mo><mi>M</mi><mo>)</mo></mrow></msub><mo>)</mo></math></span>, and for <span><math><msub><mrow><mi>lim</mi></mrow><mrow><mi>n</mi><mo>→</mo><mo>∞</mo></mrow></msub><mo>⁡</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>(</mo><msub><mrow><mi>W</mi></mrow><mrow><mi>S</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>;</mo><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></mrow></msub><mo>)</mo></math></span>, when <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>∼</mo><mi>c</mi><mi>k</mi><mi>n</mi></math></span>, with <span><math><mi>c</mi><mo>∈</mo><mo>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>. In the classical secretary problem (<span><math><mi>k</mi><mo>=</mo><mn>1</mn></math></span>), the asymptotic probability of success using an optimal strategy is <span><math><mfrac><mrow><mn>1</mn></mrow><mrow><mi>e</mi></mrow></mfrac><mo>≈</mo><mn>0.368</mn></math></span>. For <span><math><mi>k</mi><mo>=</
对于 2≤k∈N,可以考虑对经典秘书问题进行如下改编。在 n 个线性有序的等级中,每个等级有 k 个物品。一个观察者每次按均匀随机的顺序将 k 个项目逐个显示出来,观察者的目标是选择一个等级最高的项目。在每个阶段,观察者只知道迄今为止到达的项目的相对等级,他必须选择当前项目,在这种情况下,过程终止;或者拒绝当前项目,继续下一个项目。对于 M∈{0,1,⋯,kn-1},让 S(n,k;M)表示这样一种策略:允许前 M 个项目通过,然后选择第一个后来到达的项目,其等级要么等于要么大于前 M 个项目的最高等级(如果存在这样的项目的话)。让 WS(n,k;M)表示使用策略 S(n,k;M)选择最高级别项目的事件,让 Pn,k(WS(n,k;M))表示相应的概率。当 Mn∼ckn 时,我们得到 Pn,k(WS(n,k;M))和 limn→∞Pn,k(WS(n,k;Mn)) 的公式,c∈(0,1)。在经典秘书问题(k=1)中,使用最优策略的渐近成功概率为 1e≈0.368。对于 k=2 的问题,使用上述最优策略的渐近成功概率约为 0.701。对于 k=7 的问题,该概率已经超过了 0.99。在每个等级都有多个项目的问题中,除了选择最高等级项目的概率之外,还有一个衡量策略效率的指标,即选择最高等级项目的速度。我们将对这种效率给出一个比较完整的描述。
{"title":"Two measures of efficiency for the secretary problem with multiple items at each rank","authors":"Ross G. Pinsky","doi":"10.1016/j.aam.2024.102751","DOIUrl":"10.1016/j.aam.2024.102751","url":null,"abstract":"&lt;div&gt;&lt;p&gt;For &lt;span&gt;&lt;math&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, consider the following adaptation of the classical secretary problem. There are &lt;em&gt;k&lt;/em&gt; items at each of &lt;em&gt;n&lt;/em&gt; linearly ordered ranks. The &lt;em&gt;kn&lt;/em&gt; items are revealed, one item at a time, in a uniformly random order, to an observer whose objective is to select an item of highest rank. At each stage the observer only knows the relative ranks of the items that have arrived thus far, and must either select the current item, in which case the process terminates, or reject it and continue to the next item. For &lt;span&gt;&lt;math&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, let &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denote the strategy whereby one allows the first &lt;em&gt;M&lt;/em&gt; items to pass, and then selects the first later arriving item whose rank is either equal to or greater than the highest rank of the first &lt;em&gt;M&lt;/em&gt; items (if such an item exists). Let &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; denote the event that one selects an item of highest rank using strategy &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and let &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denote the corresponding probability. We obtain a formula for &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, and for &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;lim&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;→&lt;/mo&gt;&lt;mo&gt;∞&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, when &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;M&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;∼&lt;/mo&gt;&lt;mi&gt;c&lt;/mi&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, with &lt;span&gt;&lt;math&gt;&lt;mi&gt;c&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. In the classical secretary problem (&lt;span&gt;&lt;math&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;), the asymptotic probability of success using an optimal strategy is &lt;span&gt;&lt;math&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;mo&gt;≈&lt;/mo&gt;&lt;mn&gt;0.368&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;. For &lt;span&gt;&lt;math&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;=&lt;/","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141961407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Advances in Applied Mathematics
全部 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1