首页 > 最新文献

Forum of Mathematics Sigma最新文献

英文 中文
Polypositroids 多肌瘤
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-18 DOI: 10.1017/fms.2024.11
Thomas Lam, Alexander Postnikov

We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising from the totally nonnegative Grassmannian, polypositroids are “positive” polymatroids. We parametrize polypositroids using Coxeter necklaces and balanced graphs, and describe the cone of polypositroids by extremal rays and facet inequalities. We introduce a notion of $(W,c)$-polypositroid for a finite Weyl group W and a choice of Coxeter element c. We connect the theory of $(W,c)$-polypositroids to cluster algebras of finite type and to generalized associahedra. We discuss membranes, which are certain triangulated 2-dimensional surfaces inside polypositroids. Membranes extend the notion of plabic graphs from positroids to polypositroids.

我们开始研究一类多面体,并将其定义为多正多面体(polypositroids),即同时是广义多面体(或多矩阵)和椭圆多面体的多面体。正多面体是由完全非负的格拉斯曼矩阵产生的矩阵,而多正多面体则是 "正 "多面体。我们用考克斯特项链和平衡图对多正多面体进行参数化,并用极值射线和面不等式描述多正多面体的锥面。我们引入了有限韦尔群 W 和所选 Coxeter 元素 c 的 $(W,c)$-多正多面体的概念。我们讨论了多正多面体内部的某些三角形二维曲面--膜。膜的概念从正多面体扩展到了多正多面体。
{"title":"Polypositroids","authors":"Thomas Lam, Alexander Postnikov","doi":"10.1017/fms.2024.11","DOIUrl":"https://doi.org/10.1017/fms.2024.11","url":null,"abstract":"<p>We initiate the study of a class of polytopes, which we coin <span>polypositroids</span>, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising from the totally nonnegative Grassmannian, polypositroids are “positive” polymatroids. We parametrize polypositroids using Coxeter necklaces and balanced graphs, and describe the cone of polypositroids by extremal rays and facet inequalities. We introduce a notion of <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315142604314-0934:S2050509424000112:S2050509424000112_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$(W,c)$</span></span></img></span></span><span>-polypositroid</span> for a finite Weyl group <span>W</span> and a choice of Coxeter element <span>c</span>. We connect the theory of <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315142604314-0934:S2050509424000112:S2050509424000112_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$(W,c)$</span></span></img></span></span>-polypositroids to cluster algebras of finite type and to generalized associahedra. We discuss <span>membranes</span>, which are certain triangulated 2-dimensional surfaces inside polypositroids. Membranes extend the notion of plabic graphs from positroids to polypositroids.</p>","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"21 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149752","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
Undecidability of polynomial inequalities in weighted graph homomorphism densities 加权图同态密度中多项式不等式的不可判定性
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-18 DOI: 10.1017/fms.2024.19
Grigoriy Blekherman, Annie Raymond, Fan Wei
<p>Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights. Using the theory of graph limits, we can equivalently evaluate polynomial expressions in homomorphism densities on <span>kernels W</span>, that is, symmetric, bounded and measurable functions <span>W</span> from <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline1.png"><span data-mathjax-type="texmath"><span>$[0,1]^2 to mathbb {R}$</span></span></img></span></span>. In 2011, Hatami and Norin proved a fundamental result that it is undecidable to determine the validity of polynomial inequalities in homomorphism densities for graphons (i.e., the case where the range of <span>W</span> is <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline2.png"><span data-mathjax-type="texmath"><span>$[0,1]$</span></span></img></span></span>, which corresponds to unweighted graphs or, equivalently, to graphs with edge weights between <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline3.png"><span data-mathjax-type="texmath"><span>$0$</span></span></img></span></span> and <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline4.png"><span data-mathjax-type="texmath"><span>$1$</span></span></img></span></span>). The corresponding problem for more general sets of kernels, for example, for all kernels or for kernels with range <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline5.png"><span data-mathjax-type="texmath"><span>$[-1,1]$</span></span></img></span></span>, remains open. For any <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline6.png"><span data-mathjax-type="texmath"><span>$a> 0$</span></span></img></span></span>, we show undecidability of polynomial inequalities for any set of kernels which contains all kernels with range <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline7.png"><span data-mathjax-type="texmath"><span>${0,a}$</span></span></img></span></span>. This result also an
极值组合学中的许多问题和猜想都涉及图的同态密度之间的多项式不等式,其中我们允许边具有实权。利用图极限理论,我们可以等价评估核 W(即从 $[0,1]^2 到 mathbb {R}$ 的对称、有界和可测函数 W)上同态密度的多项式表达式。2011 年,哈塔米和诺林证明了一个基本结果,即对于图元(即 W 的范围是 $[0,1]$,对应于无权重图,或等价于边权重在 $0$ 和 $1$ 之间的图),确定同态密度中多项式不等式的有效性是不可判定的。对于更一般的内核集,例如所有内核或范围为 $[-1,1]$ 的内核,相应的问题仍未解决。对于任意 $a>0$,我们证明了包含范围为 ${0,a}$ 的所有核集的多项式不等式的不可判定性。这一结果也回答了洛瓦兹提出的一个问题,即如何为核中同态密度不等式的有效性找到计算上有效的证明。
{"title":"Undecidability of polynomial inequalities in weighted graph homomorphism densities","authors":"Grigoriy Blekherman, Annie Raymond, Fan Wei","doi":"10.1017/fms.2024.19","DOIUrl":"https://doi.org/10.1017/fms.2024.19","url":null,"abstract":"&lt;p&gt;Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights. Using the theory of graph limits, we can equivalently evaluate polynomial expressions in homomorphism densities on &lt;span&gt;kernels W&lt;/span&gt;, that is, symmetric, bounded and measurable functions &lt;span&gt;W&lt;/span&gt; from &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline1.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$[0,1]^2 to mathbb {R}$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;. In 2011, Hatami and Norin proved a fundamental result that it is undecidable to determine the validity of polynomial inequalities in homomorphism densities for graphons (i.e., the case where the range of &lt;span&gt;W&lt;/span&gt; is &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline2.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$[0,1]$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;, which corresponds to unweighted graphs or, equivalently, to graphs with edge weights between &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline3.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$0$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; and &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline4.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$1$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;). The corresponding problem for more general sets of kernels, for example, for all kernels or for kernels with range &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline5.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$[-1,1]$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;, remains open. For any &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline6.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$a&gt; 0$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;, we show undecidability of polynomial inequalities for any set of kernels which contains all kernels with range &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240315134900186-0773:S2050509424000197:S2050509424000197_inline7.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;${0,a}$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;. This result also an","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"97 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149592","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 the Turán number of the hypercube 关于超立方体的图兰数
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-15 DOI: 10.1017/fms.2024.27
Oliver Janzer, Benny Sudakov
In 1964, Erdős proposed the problem of estimating the Turán number of the <jats:italic>d</jats:italic>-dimensional hypercube <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline1.png" /> <jats:tex-math> $Q_d$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. Since <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline2.png" /> <jats:tex-math> $Q_d$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> is a bipartite graph with maximum degree <jats:italic>d</jats:italic>, it follows from results of Füredi and Alon, Krivelevich, Sudakov that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline3.png" /> <jats:tex-math> $mathrm {ex}(n,Q_d)=O_d(n^{2-1/d})$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. A recent general result of Sudakov and Tomon implies the slightly stronger bound <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline4.png" /> <jats:tex-math> $mathrm {ex}(n,Q_d)=o(n^{2-1/d})$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. We obtain the first power-improvement for this old problem by showing that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline5.png" /> <jats:tex-math> $mathrm {ex}(n,Q_d)=O_dleft (n^{2-frac {1}{d-1}+frac {1}{(d-1)2^{d-1}}}right )$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. This answers a question of Liu. Moreover, our techniques give a power improvement for a larger class of graphs than cubes. We use a similar method to prove that any <jats:italic>n</jats:italic>-vertex, properly edge-coloured graph without a rainbow cycle has at most <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline6.png" /> <jats:tex-math> $O(n(log n)^2)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> edges, improving the previous best bound of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline7.png" /> <jats:tex-math> $n(log n)^{2+o(1)}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> by Tomon. Furthermore, we show that any properly edge-coloured <jats:italic>n</jats:italic>-vertex graph with <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S2050509424000276_inline8.png" /> <jats:tex-math> $omega (nlog n)$ </jats:te
1964 年,厄尔多斯提出了估计 d 维超立方体 $Q_d$ 的图兰数问题。由于 $Q_d$ 是最大阶数为 d 的双方形图,根据 Füredi 和 Alon、Krivelevich、Sudakov 的结果,可以得出 $mathrm {ex}(n,Q_d)=O_d(n^{2-1/d})$ 。Sudakov 和 Tomon 最近的一个一般性结果暗示了稍强的约束 $mathrm {ex}(n,Q_d)=o(n^{2-1/d})$ 。通过证明 $mathrm {ex}(n,Q_d)=O_dleft (n^{2-frac {1}{d-1}+frac {1}{(d-1)2^{d-1}}}right )$ ,我们得到了这个老问题的第一个幂改进。这回答了刘博士的一个问题。此外,我们的技术对于比立方体更大的图类也有能力改进。我们用类似的方法证明了任何 n 个顶点、适当边缘着色、没有彩虹循环的图最多有 $O(n(log n)^2)$ 条边,这改进了托蒙之前的最佳边界 $n(log n)^{2+o(1)}$。此外,我们还证明了任何具有 $omega (nlog n)$ 边的适当边色 n 顶点图都包含一个几乎是彩虹的循环:也就是说,其中几乎所有的边都有唯一的颜色。后一个结果是严密的。
{"title":"On the Turán number of the hypercube","authors":"Oliver Janzer, Benny Sudakov","doi":"10.1017/fms.2024.27","DOIUrl":"https://doi.org/10.1017/fms.2024.27","url":null,"abstract":"In 1964, Erdős proposed the problem of estimating the Turán number of the &lt;jats:italic&gt;d&lt;/jats:italic&gt;-dimensional hypercube &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline1.png\" /&gt; &lt;jats:tex-math&gt; $Q_d$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;. Since &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline2.png\" /&gt; &lt;jats:tex-math&gt; $Q_d$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; is a bipartite graph with maximum degree &lt;jats:italic&gt;d&lt;/jats:italic&gt;, it follows from results of Füredi and Alon, Krivelevich, Sudakov that &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline3.png\" /&gt; &lt;jats:tex-math&gt; $mathrm {ex}(n,Q_d)=O_d(n^{2-1/d})$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;. A recent general result of Sudakov and Tomon implies the slightly stronger bound &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline4.png\" /&gt; &lt;jats:tex-math&gt; $mathrm {ex}(n,Q_d)=o(n^{2-1/d})$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;. We obtain the first power-improvement for this old problem by showing that &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline5.png\" /&gt; &lt;jats:tex-math&gt; $mathrm {ex}(n,Q_d)=O_dleft (n^{2-frac {1}{d-1}+frac {1}{(d-1)2^{d-1}}}right )$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;. This answers a question of Liu. Moreover, our techniques give a power improvement for a larger class of graphs than cubes. We use a similar method to prove that any &lt;jats:italic&gt;n&lt;/jats:italic&gt;-vertex, properly edge-coloured graph without a rainbow cycle has at most &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline6.png\" /&gt; &lt;jats:tex-math&gt; $O(n(log n)^2)$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; edges, improving the previous best bound of &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline7.png\" /&gt; &lt;jats:tex-math&gt; $n(log n)^{2+o(1)}$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; by Tomon. Furthermore, we show that any properly edge-coloured &lt;jats:italic&gt;n&lt;/jats:italic&gt;-vertex graph with &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000276_inline8.png\" /&gt; &lt;jats:tex-math&gt; $omega (nlog n)$ &lt;/jats:te","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"109 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149744","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
Asymptotic expansions relating to the distribution of the length of longest increasing subsequences 与最长递增子序列长度分布有关的渐近展开式
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-15 DOI: 10.1017/fms.2024.13
Folkmar Bornemann
We study the distribution of the length of longest increasing subsequences in random permutations of n integers as n grows large and establish an asymptotic expansion in powers of $n^{-1/3}$ . Whilst the limit law was already shown by Baik, Deift and Johansson to be the GUE Tracy–Widom distribution F, we find explicit analytic expressions of the first few finite-size correction terms as linear combinations of higher order derivatives of F with rational polynomial coefficients. Our proof replaces Johansson’s de-Poissonization, which is based on monotonicity as a Tauberian condition, by analytic de-Poissonization of Jacquet and Szpankowski, which is based on growth conditions in the complex plane; it is subject to a tameness hypothesis concerning complex zeros of the analytically continued Poissonized length distribution. In a preparatory step an expansion of the hard-to-soft edge transition law of LUE is studied, which is lifted to an expansion of the Poissonized length distribution for large intensities. Finally, expansions of Stirling-type approximations and of the expected value and variance of the length distribution are given.
我们研究了 n 个整数随机排列中最长递增子序列长度随 n 增长的分布,并建立了以 $n^{-1/3}$ 的幂为单位的渐近展开。Baik、Deift 和 Johansson 已经证明了 GUE Tracy-Widom 分布 F 的极限规律,而我们发现前几个有限大小修正项是 F 的高阶导数与有理多项式系数的线性组合的明确解析表达式。我们的证明用 Jacquet 和 Szpankowski 的解析去泊松化取代了 Johansson 的去泊松化,后者以单调性作为陶伯条件,而解析去泊松化则以复数平面上的增长条件为基础。作为准备步骤,研究了 LUE 的硬到软边缘过渡规律的展开,并将其提升到大强度泊松长度分布的展开。最后,给出了斯特林型近似以及长度分布的期望值和方差的展开。
{"title":"Asymptotic expansions relating to the distribution of the length of longest increasing subsequences","authors":"Folkmar Bornemann","doi":"10.1017/fms.2024.13","DOIUrl":"https://doi.org/10.1017/fms.2024.13","url":null,"abstract":"We study the distribution of the length of longest increasing subsequences in random permutations of <jats:italic>n</jats:italic> integers as <jats:italic>n</jats:italic> grows large and establish an asymptotic expansion in powers of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000136_inline1.png\" /> <jats:tex-math> $n^{-1/3}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. Whilst the limit law was already shown by Baik, Deift and Johansson to be the GUE Tracy–Widom distribution <jats:italic>F</jats:italic>, we find explicit analytic expressions of the first few finite-size correction terms as linear combinations of higher order derivatives of <jats:italic>F</jats:italic> with rational polynomial coefficients. Our proof replaces Johansson’s de-Poissonization, which is based on monotonicity as a Tauberian condition, by analytic de-Poissonization of Jacquet and Szpankowski, which is based on growth conditions in the complex plane; it is subject to a tameness hypothesis concerning complex zeros of the analytically continued Poissonized length distribution. In a preparatory step an expansion of the hard-to-soft edge transition law of LUE is studied, which is lifted to an expansion of the Poissonized length distribution for large intensities. Finally, expansions of Stirling-type approximations and of the expected value and variance of the length distribution are given.","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"48 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149591","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
Equivariant Hodge polynomials of heavy/light moduli spaces 重/轻模态空间的等变霍奇多项式
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-14 DOI: 10.1017/fms.2024.20
Siddarth Kannan, Stefano Serpente, Claudia He Yun

Let $overline {mathcal {M}}_{g, m|n}$ denote Hassett’s moduli space of weighted pointed stable curves of genus g for the heavy/light weight data $$begin{align*}left(1^{(m)}, 1/n^{(n)}right),end{align*}$$

and let $mathcal {M}_{g, m|n} subset overline {mathcal {M}}_{g, m|n}$ be the locus parameterizing smooth, not necessarily distinctly marked curves. We give a change-of-variables formula which computes the generating function for $(S_mtimes S_n)$-equivariant Hodge–Deligne polynomials of these spaces in terms of the generating functions for $S_{n}$-equivariant Hodge–Deligne polynomials of $overline {mathcal {M}}_{g,n}$ and $mathcal {M}_{g,n}$.

让 $overline {mathcal {M}}_{g, m|n}$ 表示重/轻权数据 $$begin{align*}left(1^{(m)}, 1/n^{(n)}right),end{align*}$ 属 g 的加权尖稳定曲线的哈塞特模空间,让 $mathcal {M}}_{g, m|n}subset overline {mathcal {M}}_{g, m|n}$ 是参数化平滑曲线的位置,不一定是有明显标记的曲线。我们给出了一个变量变化公式,用 $overline {mathcal {M}}_{g,n}$ 和 $mathcal {M}_{g,n}$ 的生成函数来计算这些空间的 $(S_mtimes S_n)$ 平方霍奇-德利尼多项式的生成函数。
{"title":"Equivariant Hodge polynomials of heavy/light moduli spaces","authors":"Siddarth Kannan, Stefano Serpente, Claudia He Yun","doi":"10.1017/fms.2024.20","DOIUrl":"https://doi.org/10.1017/fms.2024.20","url":null,"abstract":"<p>Let <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$overline {mathcal {M}}_{g, m|n}$</span></span></img></span></span> denote Hassett’s moduli space of weighted pointed stable curves of genus <span>g</span> for the <span>heavy/light</span> weight data <span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_eqnu1.png\"><span data-mathjax-type=\"texmath\"><span>$$begin{align*}left(1^{(m)}, 1/n^{(n)}right),end{align*}$$</span></span></img></span></p><p>and let <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$mathcal {M}_{g, m|n} subset overline {mathcal {M}}_{g, m|n}$</span></span></img></span></span> be the locus parameterizing smooth, not necessarily distinctly marked curves. We give a change-of-variables formula which computes the generating function for <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_inline3.png\"><span data-mathjax-type=\"texmath\"><span>$(S_mtimes S_n)$</span></span></img></span></span>-equivariant Hodge–Deligne polynomials of these spaces in terms of the generating functions for <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_inline4.png\"><span data-mathjax-type=\"texmath\"><span>$S_{n}$</span></span></img></span></span>-equivariant Hodge–Deligne polynomials of <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_inline5.png\"><span data-mathjax-type=\"texmath\"><span>$overline {mathcal {M}}_{g,n}$</span></span></img></span></span> and <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313134052190-0722:S2050509424000203:S2050509424000203_inline6.png\"><span data-mathjax-type=\"texmath\"><span>$mathcal {M}_{g,n}$</span></span></img></span></span>.</p>","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"68 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140125511","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
Topology of moduli spaces of curves and anabelian geometry in positive characteristic 正特征曲线模空间拓扑学和阿那伯几何学
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-14 DOI: 10.1017/fms.2024.12
Zhi Hu, Yu Yang, Runhong Zong

In the present paper, we study a new kind of anabelian phenomenon concerning the smooth pointed stable curves in positive characteristic. It shows that the topology of moduli spaces of curves can be understood from the viewpoint of anabelian geometry. We formulate some new anabelian-geometric conjectures concerning tame fundamental groups of curves over algebraically closed fields of characteristic $p>0$ from the point of view of moduli spaces. The conjectures are generalized versions of the Weak Isom-version of the Grothendieck conjecture for curves over algebraically closed fields of characteristic $p>0$ which was formulated by Tamagawa. Moreover, we prove that the conjectures hold for certain points lying in the moduli space of curves of genus $0$.

在本文中,我们研究了关于正特征光滑尖稳定曲线的一种新的阿那伯现象。它表明曲线模空间的拓扑学可以从阿那伯几何学的角度来理解。我们从模量空间的角度,提出了一些关于特性 $p>0$ 的代数闭域上曲线的驯服基群的新的阿那伯几何猜想。这些猜想是玉川(Tamagawa)提出的关于特性$p>0$的代数闭域上曲线的格罗thendieck猜想的弱伊索姆猜想的广义版本。此外,我们还证明了这些猜想对于位于属$0$曲线的模空间中的某些点是成立的。
{"title":"Topology of moduli spaces of curves and anabelian geometry in positive characteristic","authors":"Zhi Hu, Yu Yang, Runhong Zong","doi":"10.1017/fms.2024.12","DOIUrl":"https://doi.org/10.1017/fms.2024.12","url":null,"abstract":"<p>In the present paper, we study a new kind of anabelian phenomenon concerning the smooth pointed stable curves in positive characteristic. It shows that the topology of moduli spaces of curves can be understood from the viewpoint of anabelian geometry. We formulate some new anabelian-geometric conjectures concerning tame fundamental groups of curves over algebraically closed fields of characteristic <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313103911284-0196:S2050509424000124:S2050509424000124_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$p&gt;0$</span></span></img></span></span> from the point of view of moduli spaces. The conjectures are generalized versions of the Weak Isom-version of the Grothendieck conjecture for curves over algebraically closed fields of characteristic <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313103911284-0196:S2050509424000124:S2050509424000124_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$p&gt;0$</span></span></img></span></span> which was formulated by Tamagawa. Moreover, we prove that the conjectures hold for certain points lying in the moduli space of curves of genus <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240313103911284-0196:S2050509424000124:S2050509424000124_inline3.png\"><span data-mathjax-type=\"texmath\"><span>$0$</span></span></img></span></span>.</p>","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"114 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140129823","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
Structural, point-free, non-Hausdorff topological realization of Borel groupoid actions 波尔群作用的结构性、无点、非豪斯多夫拓扑实现
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-14 DOI: 10.1017/fms.2024.25
Ruiyuan Chen

We extend the Becker–Kechris topological realization and change-of-topology theorems for Polish group actions in several directions. For Polish group actions, we prove a single result that implies the original Becker–Kechris theorems, as well as Sami’s and Hjorth’s sharpenings adapted levelwise to the Borel hierarchy; automatic continuity of Borel actions via homeomorphisms and the equivalence of ‘potentially open’ versus ‘orbitwise open’ Borel sets. We also characterize ‘potentially open’ n-ary relations, thus yielding a topological realization theorem for invariant Borel first-order structures. We then generalize to groupoid actions and prove a result subsuming Lupini’s Becker–Kechris-type theorems for open Polish groupoids, newly adapted to the Borel hierarchy, as well as topological realizations of actions on fiberwise topological bundles and bundles of first-order structures.

Our proof method is new even in the classical case of Polish groups and is based entirely on formal algebraic properties of category quantifiers; in particular, we make no use of either metrizability or the strong Choquet game. Consequently, our proofs work equally well in the non-Hausdorff context, for open quasi-Polish groupoids and more generally in the point-free context, for open localic groupoids.

我们从几个方面扩展了波兰群作用的贝克尔-凯奇里斯拓扑实现和拓扑变化定理。对于波兰群作用,我们证明了一个单一的结果,它隐含了原始的贝克尔-凯奇里斯定理,以及萨米(Sami)和希沃斯(Hjorth)的锐化定理,这些锐化定理平移到了伯尔层次结构中;通过同构实现了伯尔作用的自动连续性,以及 "潜在开放 "与 "轨道开放 "伯尔集合的等价性。我们还描述了 "潜在开放 "的 nary 关系,从而为不变的 Borel 一阶结构提出了拓扑实现定理。然后,我们将其推广到类群作用,并证明了一个包含卢皮尼的贝克尔-凯奇里斯(Becker-Kechris)型开放波兰类群定理的结果,该定理新近适应了伯尔层次结构,以及纤维拓扑束和一阶结构束上作用的拓扑实现。我们的证明方法即使在波兰群的经典情形中也是新的,它完全基于范畴量词的形式代数性质;特别是,我们既没有使用元可变性,也没有使用强乔奎特博弈。因此,我们的证明同样适用于非豪斯多夫背景下的开放准波兰群,以及更广泛的无点背景下的开放局部群。
{"title":"Structural, point-free, non-Hausdorff topological realization of Borel groupoid actions","authors":"Ruiyuan Chen","doi":"10.1017/fms.2024.25","DOIUrl":"https://doi.org/10.1017/fms.2024.25","url":null,"abstract":"<p>We extend the Becker–Kechris topological realization and change-of-topology theorems for Polish group actions in several directions. For Polish group actions, we prove a single result that implies the original Becker–Kechris theorems, as well as Sami’s and Hjorth’s sharpenings adapted levelwise to the Borel hierarchy; automatic continuity of Borel actions via homeomorphisms and the equivalence of ‘potentially open’ versus ‘orbitwise open’ Borel sets. We also characterize ‘potentially open’ <span>n</span>-ary relations, thus yielding a topological realization theorem for invariant Borel first-order structures. We then generalize to groupoid actions and prove a result subsuming Lupini’s Becker–Kechris-type theorems for open Polish groupoids, newly adapted to the Borel hierarchy, as well as topological realizations of actions on fiberwise topological bundles and bundles of first-order structures.</p><p>Our proof method is new even in the classical case of Polish groups and is based entirely on formal algebraic properties of category quantifiers; in particular, we make no use of either metrizability or the strong Choquet game. Consequently, our proofs work equally well in the non-Hausdorff context, for open quasi-Polish groupoids and more generally in the point-free context, for open localic groupoids.</p>","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"19 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140125528","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
Hyperfiniteness of boundary actions of acylindrically hyperbolic groups 酰基双曲群边界作用的超有限性
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-11 DOI: 10.1017/fms.2024.24
Koichi Oyakawa

We prove that, for any countable acylindrically hyperbolic group G, there exists a generating set S of G such that the corresponding Cayley graph $Gamma (G,S)$ is hyperbolic, $|partial Gamma (G,S)|>2$, the natural action of G on $Gamma (G,S)$ is acylindrical and the natural action of G on the Gromov boundary $partial Gamma (G,S)$ is hyperfinite. This result broadens the class of groups that admit a non-elementary acylindrical action on a hyperbolic space with a hyperfinite boundary action.

我们证明了,对于任何可数的针状双曲群 G,都存在一个 G 的生成集 S,使得相应的 Cayley 图 $Gamma (G,S)$ 是双曲的,$|partial Gamma (G,S)|>2$, G 在 $Gamma (G,S)$ 上的自然作用是针状的,而 G 在 Gromov 边界 $partial Gamma (G,S)$ 上的自然作用是超无限的。这一结果拓宽了在双曲空间上具有超无限边界作用的非元素acylindrical作用的群类。
{"title":"Hyperfiniteness of boundary actions of acylindrically hyperbolic groups","authors":"Koichi Oyakawa","doi":"10.1017/fms.2024.24","DOIUrl":"https://doi.org/10.1017/fms.2024.24","url":null,"abstract":"<p>We prove that, for any countable acylindrically hyperbolic group <span>G</span>, there exists a generating set <span>S</span> of <span>G</span> such that the corresponding Cayley graph <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240309072942358-0895:S2050509424000240:S2050509424000240_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$Gamma (G,S)$</span></span></img></span></span> is hyperbolic, <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240309072942358-0895:S2050509424000240:S2050509424000240_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$|partial Gamma (G,S)|&gt;2$</span></span></img></span></span>, the natural action of <span>G</span> on <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240309072942358-0895:S2050509424000240:S2050509424000240_inline3.png\"><span data-mathjax-type=\"texmath\"><span>$Gamma (G,S)$</span></span></img></span></span> is acylindrical and the natural action of <span>G</span> on the Gromov boundary <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240309072942358-0895:S2050509424000240:S2050509424000240_inline4.png\"><span data-mathjax-type=\"texmath\"><span>$partial Gamma (G,S)$</span></span></img></span></span> is hyperfinite. This result broadens the class of groups that admit a non-elementary acylindrical action on a hyperbolic space with a hyperfinite boundary action.</p>","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"39 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099772","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
Components of moduli stacks of two-dimensional Galois representations 二维伽罗瓦表示的模数堆的成分
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-11 DOI: 10.1017/fms.2024.4
Ana Caraiani, Matthew Emerton, Toby Gee, David Savitt

In the article [CEGS20b], we introduced various moduli stacks of two-dimensional tamely potentially Barsotti–Tate representations of the absolute Galois group of a p-adic local field, as well as related moduli stacks of Breuil–Kisin modules with descent data. We study the irreducible components of these stacks, establishing, in particular, that the components of the former are naturally indexed by certain Serre weights.

在文章[CEGS20b]中,我们介绍了 p-adic 局部域绝对伽罗瓦群的二维驯服潜在巴索蒂-塔特表示的各种模堆栈,以及具有下降数据的 Breuil-Kisin 模块的相关模堆栈。我们研究了这些堆栈的不可还原分量,特别是确定了前者的分量自然是由某些塞雷权重索引的。
{"title":"Components of moduli stacks of two-dimensional Galois representations","authors":"Ana Caraiani, Matthew Emerton, Toby Gee, David Savitt","doi":"10.1017/fms.2024.4","DOIUrl":"https://doi.org/10.1017/fms.2024.4","url":null,"abstract":"<p>In the article [CEGS20b], we introduced various moduli stacks of two-dimensional tamely potentially Barsotti–Tate representations of the absolute Galois group of a <span>p</span>-adic local field, as well as related moduli stacks of Breuil–Kisin modules with descent data. We study the irreducible components of these stacks, establishing, in particular, that the components of the former are naturally indexed by certain Serre weights.</p>","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"1 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099612","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
Delta and Theta Operator Expansions 德尔塔和 Theta 运算符扩展
IF 1.7 2区 数学 Q1 MATHEMATICS Pub Date : 2024-03-07 DOI: 10.1017/fms.2024.14
Alessandro Iraci, Marino Romero
<p>We give an elementary symmetric function expansion for the expressions <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline1.png"><span data-mathjax-type="texmath"><span>$MDelta _{m_gamma e_1}Pi e_lambda ^{ast }$</span></span></img></span></span> and <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline2.png"><span data-mathjax-type="texmath"><span>$MDelta _{m_gamma e_1}Pi s_lambda ^{ast }$</span></span></img></span></span> when <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline3.png"><span data-mathjax-type="texmath"><span>$t=1$</span></span></img></span></span> in terms of what we call <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline4.png"><span data-mathjax-type="texmath"><span>$gamma $</span></span></img></span></span>-parking functions and lattice <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline5.png"><span data-mathjax-type="texmath"><span>$gamma $</span></span></img></span></span>-parking functions. Here, <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline6.png"><span data-mathjax-type="texmath"><span>$Delta _F$</span></span></img></span></span> and <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline7.png"><span data-mathjax-type="texmath"><span>$Pi $</span></span></img></span></span> are certain eigenoperators of the modified Macdonald basis and <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline8.png"><span data-mathjax-type="texmath"><span>$M=(1-q)(1-t)$</span></span></img></span></span>. Our main results, in turn, give an elementary basis expansion at <span><span><img data-mimesubtype="png" data-type="" src="https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline9.png"><span data-mathjax-type="texmath"><span>$t=1$</span></span></img></span></span> for symmetric functions of the form <span><sp
当 $t=1$ 时,我们给出了表达式 $MDelta _{m_gamma e_1}Pi e_lambda ^{ast }$ 和 $MDelta _{m_gamma e_1}Pi s_lambda ^{ast }$ 的基本对称函数展开,我们称之为 $gamma $ 停车函数和晶格 $gamma $ 停车函数。这里,$Delta _F$ 和 $Pi $ 是修正麦克唐纳基础的某些特征算子,$M=(1-q)(1-t)$。我们的主要结果反过来给出了对称函数形式 $M Delta _{Fe_1} 在 $t=1$ 时的基本基展开。Theta _{G}J$ 只要 F 是以单项式展开的,G 是以初等基展开的,J 是以修正初等基${Pi e_lambda ^ast }_lambda $展开的。最后,我们给出了当 t 没有特化时的 e 正性猜想,提出我们的对象也可以给出未特化对称函数的基元展开。
{"title":"Delta and Theta Operator Expansions","authors":"Alessandro Iraci, Marino Romero","doi":"10.1017/fms.2024.14","DOIUrl":"https://doi.org/10.1017/fms.2024.14","url":null,"abstract":"&lt;p&gt;We give an elementary symmetric function expansion for the expressions &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline1.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$MDelta _{m_gamma e_1}Pi e_lambda ^{ast }$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; and &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline2.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$MDelta _{m_gamma e_1}Pi s_lambda ^{ast }$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; when &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline3.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$t=1$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; in terms of what we call &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline4.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$gamma $&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;-parking functions and lattice &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline5.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$gamma $&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;-parking functions. Here, &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline6.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$Delta _F$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; and &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline7.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$Pi $&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; are certain eigenoperators of the modified Macdonald basis and &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline8.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$M=(1-q)(1-t)$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt;. Our main results, in turn, give an elementary basis expansion at &lt;span&gt;&lt;span&gt;&lt;img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240306134500664-0603:S2050509424000148:S2050509424000148_inline9.png\"&gt;&lt;span data-mathjax-type=\"texmath\"&gt;&lt;span&gt;$t=1$&lt;/span&gt;&lt;/span&gt;&lt;/img&gt;&lt;/span&gt;&lt;/span&gt; for symmetric functions of the form &lt;span&gt;&lt;sp","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":"137 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140053940","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
期刊
Forum of Mathematics Sigma
全部 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