Advances in Applied Mathematics最新文献

筛选
英文 中文
Block-counting sequences are not purely morphic 块计数序列并非纯粹的形态序列
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-02-01 DOI: 10.1016/j.aam.2024.102673
Antoine Abram , Yining Hu , Shuo Li
{"title":"Block-counting sequences are not purely morphic","authors":"Antoine Abram ,&nbsp;Yining Hu ,&nbsp;Shuo Li","doi":"10.1016/j.aam.2024.102673","DOIUrl":"10.1016/j.aam.2024.102673","url":null,"abstract":"<div><p>Let <em>m</em> be a positive integer larger than 1, <em>w</em> be a finite word over <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>⋯</mo><mo>,</mo><mi>m</mi><mo>−</mo><mn>1</mn><mo>}</mo></math></span> and <span><math><msub><mrow><mi>a</mi></mrow><mrow><mi>m</mi><mo>;</mo><mi>w</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> represent the number of occurrences of the word <em>w</em> in the <em>m</em>-expansion of the non-negative integer <em>n</em> (mod <em>m</em>). In this article, we present an efficient algorithm for generating all sequences <span><math><msub><mrow><mo>(</mo><msub><mrow><mi>a</mi></mrow><mrow><mi>m</mi><mo>;</mo><mi>w</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>)</mo></mrow><mrow><mi>n</mi><mo>∈</mo><mi>N</mi></mrow></msub></math></span>; then, assuming that <em>m</em> is a prime number, we prove that all these sequences are <em>m</em>-uniformly but not purely morphic, except for words <em>w</em> satisfying <span><math><mo>|</mo><mi>w</mi><mo>|</mo><mo>=</mo><mn>1</mn></math></span> and <span><math><mi>w</mi><mo>≠</mo><mn>0</mn></math></span>; finally, under the same assumption of <em>m</em> as before, we prove that the power series <span><math><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mo>∞</mo></mrow></msubsup><msub><mrow><mi>a</mi></mrow><mrow><mi>m</mi><mo>;</mo><mi>w</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><msup><mrow><mi>t</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> is algebraic of degree <em>m</em> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>m</mi></mrow></msub><mo>(</mo><mi>t</mi><mo>)</mo></math></span>.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102673"},"PeriodicalIF":1.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139658835","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
Connectivity of old and new models of friends-and-strangers graphs 新旧朋友和陌生人图谱模型的连接性
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-01-16 DOI: 10.1016/j.aam.2023.102668
Aleksa Milojević
{"title":"Connectivity of old and new models of friends-and-strangers graphs","authors":"Aleksa Milojević","doi":"10.1016/j.aam.2023.102668","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102668","url":null,"abstract":"<div><p>In this paper, we investigate the connectivity of friends-and-strangers graphs, which were introduced by Defant and Kravitz in 2020. We begin by considering friends-and-strangers graphs arising from two random graphs and consider the threshold probability at which such graphs attain maximal connectivity. We slightly improve the lower bounds on the threshold probabilities, thus disproving two conjectures of Alon, Defant and Kravitz. We also improve the upper bound on the threshold probability in the case of random bipartite graphs, and obtain a tight bound up to a factor of <span><math><msup><mrow><mi>n</mi></mrow><mrow><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></msup></math></span>. Further, we introduce a generalization of the notion of friends-and-strangers graphs in which vertices of the starting graphs are allowed to have multiplicities and obtain generalizations of previous results of Wilson and of Defant and Kravitz in this new setting.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102668"},"PeriodicalIF":1.1,"publicationDate":"2024-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0196885823001860/pdfft?md5=d2c2c8fdb509ad7c962036dde8e1c7cd&pid=1-s2.0-S0196885823001860-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139473315","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
Generating functions and counting formulas for spanning trees and forests in hypergraphs 超图中生成树和森林的生成函数和计数公式
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-01-16 DOI: 10.1016/j.aam.2023.102667
Jiuqiang Liu , Shenggui Zhang , Guihai Yu
{"title":"Generating functions and counting formulas for spanning trees and forests in hypergraphs","authors":"Jiuqiang Liu ,&nbsp;Shenggui Zhang ,&nbsp;Guihai Yu","doi":"10.1016/j.aam.2023.102667","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102667","url":null,"abstract":"<div><p><span><span>In this paper, we provide generating functions and counting formulas for spanning trees and spanning forests in hypergraphs in two different ways: (1) We represent spanning trees and spanning forests in hypergraphs through Berezin-Grassmann integrals on Zeon algebra and hyper-Hafnians (orders and signs are not considered); (2) We establish a Hyper-Pfaffian-Cactus Spanning Forest Theorem through Berezin-Grassmann integrals on </span>Grassmann algebra (orders and signs are considered), which generalizes the Hyper-Pfaffian-Cactus Theorem by Abdesselam (2004) </span><span>[1]</span><span> and Pfaffian matrix tree theorem by Masbaum and Vaintrob (2002) </span><span>[15]</span>.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102667"},"PeriodicalIF":1.1,"publicationDate":"2024-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139480080","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
Rowmotion Markov chains 行运动马尔科夫链
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-01-12 DOI: 10.1016/j.aam.2023.102666
Colin Defant , Rupert Li , Evita Nestoridi
{"title":"Rowmotion Markov chains","authors":"Colin Defant ,&nbsp;Rupert Li ,&nbsp;Evita Nestoridi","doi":"10.1016/j.aam.2023.102666","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102666","url":null,"abstract":"<div><p><em>Rowmotion</em><span> is a certain well-studied bijective operator on the distributive lattice </span><span><math><mi>J</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span><span> of order ideals<span> of a finite poset </span></span><em>P</em>. We introduce the <span><em>rowmotion </em><em>Markov chain</em></span> <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>J</mi><mo>(</mo><mi>P</mi><mo>)</mo></mrow></msub></math></span><span> by assigning a probability </span><span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>x</mi></mrow></msub></math></span> to each <span><math><mi>x</mi><mo>∈</mo><mi>P</mi></math></span> and using these probabilities to insert randomness into the original definition of rowmotion. More generally, we introduce a very broad family of <em>toggle Markov chains</em> inspired by Striker's notion of generalized toggling. We characterize when toggle Markov chains are irreducible, and we show that each toggle Markov chain has a remarkably simple stationary distribution.</p><p><span>We also provide a second generalization of rowmotion Markov chains to the context of semidistrim lattices. Given a semidistrim lattice </span><em>L</em>, we assign a probability <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>j</mi></mrow></msub></math></span> to each join-irreducible element <em>j</em> of <em>L</em> and use these probabilities to construct a rowmotion Markov chain <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>L</mi></mrow></msub></math></span>. Under the assumption that each probability <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>j</mi></mrow></msub></math></span> is strictly between 0 and 1, we prove that <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>L</mi></mrow></msub></math></span><span> is irreducible. We also compute the stationary distribution of the rowmotion Markov chain of a lattice obtained by adding a minimal element and a maximal element to a disjoint union of two chains.</span></p><p>We bound the mixing time of <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>L</mi></mrow></msub></math></span> for an arbitrary semidistrim lattice <em>L</em>. In the special case when <em>L</em><span><span> is a Boolean lattice, we use </span>spectral methods to obtain much stronger estimates on the mixing time, showing that rowmotion Markov chains of Boolean lattices exhibit the cutoff phenomenon.</span></p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102666"},"PeriodicalIF":1.1,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139433775","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
Equidistribution of set-valued statistics on standard Young tableaux and transversals 标准扬台和横轴上的集值统计等分布
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-01-09 DOI: 10.1016/j.aam.2023.102669
Robin D.P. Zhou , Sherry H.F. Yan
{"title":"Equidistribution of set-valued statistics on standard Young tableaux and transversals","authors":"Robin D.P. Zhou ,&nbsp;Sherry H.F. Yan","doi":"10.1016/j.aam.2023.102669","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102669","url":null,"abstract":"&lt;div&gt;&lt;p&gt;&lt;span&gt;As a natural generalization&lt;span&gt; of permutations&lt;span&gt;&lt;span&gt;, transversals of &lt;/span&gt;Young diagrams play an important role in the study of pattern avoiding permutations. Let &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;ST&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denote the set of &lt;em&gt;τ&lt;/em&gt;-avoiding transversals and &lt;em&gt;τ&lt;/em&gt;-avoiding symmetric transversals of a Young diagram &lt;em&gt;λ&lt;/em&gt;, respectively. In this paper, we are mainly concerned with the distribution of the peak set and the valley set on standard Young tableaux and pattern avoiding transversals. In particular, we prove that the peak set and the valley set are equidistributed on the standard Young tableaux of shape &lt;span&gt;&lt;math&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;mo&gt;/&lt;/mo&gt;&lt;mi&gt;μ&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; for any skew diagram &lt;span&gt;&lt;math&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;mo&gt;/&lt;/mo&gt;&lt;mi&gt;μ&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;&lt;span&gt;. The equidistribution enables us to show that the peak set is equidistributed over &lt;/span&gt;&lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;12&lt;/mn&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; (resp. &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;ST&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;12&lt;/mn&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;) and &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mn&gt;21&lt;/mn&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; (resp. &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;ST&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mn&gt;21&lt;/mn&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;) for any Young diagram &lt;em&gt;λ&lt;/em&gt; and any permutation &lt;em&gt;τ&lt;/em&gt; of &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;2&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;mo&gt;+&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; with &lt;span&gt;&lt;math&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;mn&gt;1&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;. Our results are refinements of the result of Backelin-West-Xin which states that &lt;span&gt;&lt;math&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;12&lt;/mn&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mn&gt;21&lt;/mn&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and the result of Bousquet-Mélou and Steingrímsson which states that &lt;span&gt;&lt;math&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;ST&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;12&lt;/mn&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;ST&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mn&gt;21&lt;/mn&gt;&lt;mi&gt;τ&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. As applications, we are able to&lt;/p&gt;&lt;ul&gt;&lt;li&gt;&lt;span&gt;•&lt;/span&gt;&lt;span&gt;&lt;p&gt;confirm a recent conjecture posed by Yan-Wang-Zhou which asserts that the peak set is equidistributed over &lt;sp","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102669"},"PeriodicalIF":1.1,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406141","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
Moments of permutation statistics and central limit theorems 置换统计矩和中心极限定理
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-01-05 DOI: 10.1016/j.aam.2023.102650
Stoyan Dimitrov , Niraj Khare
{"title":"Moments of permutation statistics and central limit theorems","authors":"Stoyan Dimitrov ,&nbsp;Niraj Khare","doi":"10.1016/j.aam.2023.102650","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102650","url":null,"abstract":"<div><p><span>We show that if a permutation </span>statistic<span> can be written as a linear combination<span> of bivincular patterns, then its moments can be expressed as a linear combination of factorials<span><span><span> with constant coefficients. This generalizes a result of Zeilberger. We use an approach of Chern, Diaconis, Kane and Rhoades, previously applied on set partitions and matchings. In addition, we give a new proof of the </span>central limit theorem (CLT) for the number of occurrences of classical patterns, which uses a lemma of Burstein and Hästö. We give a simple interpretation of this lemma and an analogous lemma that would imply the CLT for the number of occurrences of any vincular pattern. Furthermore, we obtain explicit formulas for the moments of the descents and the minimal descents statistics. The latter is used to give a new direct proof of the fact that we do not necessarily have </span>asymptotic normality of the number of pattern occurrences in the case of bivincular patterns. Closed forms for some of the higher moments of several popular statistics on permutations are also obtained.</span></span></span></p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102650"},"PeriodicalIF":1.1,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139107280","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
Pseudo-cones 伪锥体
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2024-01-04 DOI: 10.1016/j.aam.2023.102657
Rolf Schneider
{"title":"Pseudo-cones","authors":"Rolf Schneider","doi":"10.1016/j.aam.2023.102657","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102657","url":null,"abstract":"<div><p>Pseudo-cones are a class of unbounded closed convex sets<span>, not containing the origin. They admit a kind of polarity, called copolarity. With this, they can be considered as a counterpart to convex bodies<span> containing the origin in the interior. The purpose of the following is to study this analogy in greater detail. We supplement the investigation of copolarity, considering, for example, conjugate faces. Then we deal with the question suggested by Minkowski's theorem, asking which measures are surface area measures of pseudo-cones with given recession cone. We provide a sufficient condition for possibly infinite measures and a special class of pseudo-cones.</span></span></p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102657"},"PeriodicalIF":1.1,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139107281","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
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half 分而治之递推规律的同一性和周期性振荡的一半分裂
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2023-12-29 DOI: 10.1016/j.aam.2023.102653
Hsien-Kuei Hwang , Svante Janson , Tsung-Hsi Tsai
{"title":"Identities and periodic oscillations of divide-and-conquer recurrences splitting at half","authors":"Hsien-Kuei Hwang ,&nbsp;Svante Janson ,&nbsp;Tsung-Hsi Tsai","doi":"10.1016/j.aam.2023.102653","DOIUrl":"10.1016/j.aam.2023.102653","url":null,"abstract":"<div><p>We study divide-and-conquer recurrences of the form<span><span><span><math><mi>f</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mi>α</mi><mi>f</mi><mo>(</mo><mo>⌊</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌋</mo><mo>)</mo><mo>+</mo><mi>β</mi><mi>f</mi><mo>(</mo><mo>⌈</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌉</mo><mo>)</mo><mo>+</mo><mi>g</mi><mo>(</mo><mi>n</mi><mo>)</mo><mspace></mspace><mo>(</mo><mi>n</mi><mo>⩾</mo><mn>2</mn><mo>)</mo><mo>,</mo></math></span></span></span> with <span><math><mi>g</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span> and <span><math><mi>f</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> given, where <span><math><mi>α</mi><mo>,</mo><mi>β</mi><mo>⩾</mo><mn>0</mn></math></span> with <span><math><mi>α</mi><mo>+</mo><mi>β</mi><mo>&gt;</mo><mn>0</mn></math></span><span>; such recurrences appear often in the analysis of computer algorithms, numeration systems, combinatorial sequences, and related areas. We show under an optimum (iff) condition on </span><span><math><mi>g</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span> that the solution <em>f</em> always satisfies a simple <em>identity</em><span><span><span><math><mi>f</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><msup><mrow><mi>n</mi></mrow><mrow><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⁡</mo><mo>(</mo><mi>α</mi><mo>+</mo><mi>β</mi><mo>)</mo></mrow></msup><mi>P</mi><mo>(</mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⁡</mo><mi>n</mi><mo>)</mo><mo>−</mo><mi>Q</mi><mo>(</mo><mi>n</mi><mo>)</mo><mo>,</mo></math></span></span></span> where <em>P</em> is a periodic function and <span><math><mi>Q</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span><span> is of a smaller order than the dominant term. This form is thus not only an identity but also an asymptotic expansion. Explicit forms for the </span><em>continuity</em> of the periodic function <em>P</em> are provided, together with a few other smoothness properties. We show how our results can be easily applied to many dozens of concrete examples collected from the literature, and how they can be extended in various directions. Our method of proof is surprisingly simple and elementary, but leads to the strongest types of results for all examples to which our theory applies.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"155 ","pages":"Article 102653"},"PeriodicalIF":1.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139062060","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
Positivity of Narayana polynomials and Eulerian polynomials 纳拉亚纳多项式和欧拉多项式的正相关性
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2023-12-28 DOI: 10.1016/j.aam.2023.102656
Shi-Mei Ma , Hao Qi , Jean Yeh , Yeong-Nan Yeh
{"title":"Positivity of Narayana polynomials and Eulerian polynomials","authors":"Shi-Mei Ma ,&nbsp;Hao Qi ,&nbsp;Jean Yeh ,&nbsp;Yeong-Nan Yeh","doi":"10.1016/j.aam.2023.102656","DOIUrl":"https://doi.org/10.1016/j.aam.2023.102656","url":null,"abstract":"<div><p><span><span>Gamma-positive polynomials frequently appear in finite geometries, algebraic combinatorics and </span>number theory. Sagan and Tirrell (2020) </span><span>[34]</span> stumbled upon some unimodal sequences, which turn out to be alternating gamma-positive instead of gamma-positive. Motivated by this work, we first show that one can derive alternatingly <em>γ</em>-positive polynomials from <em>γ</em>-positive polynomials. We then prove the alternating <em>γ</em>-positivity and Hurwitz stability of several polynomials associated with the Narayana polynomials of types <em>A</em> and <em>B</em>. In particular, by introducing the definition of colored <span><math><mn>2</mn><mo>×</mo><mi>n</mi></math></span><span> Young diagrams, we provide combinatorial interpretations for three identities related to the Narayana numbers of type </span><em>B</em>. Finally, we present several identities involving the Eulerian polynomials of types <em>A</em> and <em>B</em>.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"154 ","pages":"Article 102656"},"PeriodicalIF":1.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139090175","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
An inversion statistic on the generalized symmetric groups 广义对称群的反转统计量
IF 1.1 3区 数学
Advances in Applied Mathematics Pub Date : 2023-12-22 DOI: 10.1016/j.aam.2023.102655
Hasan Arslan , Alnour Altoum , Mariam Zaarour
{"title":"An inversion statistic on the generalized symmetric groups","authors":"Hasan Arslan ,&nbsp;Alnour Altoum ,&nbsp;Mariam Zaarour","doi":"10.1016/j.aam.2023.102655","DOIUrl":"10.1016/j.aam.2023.102655","url":null,"abstract":"<div><p><span>In this paper, we construct a mixed-base number system over the generalized symmetric group </span><span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span>, which is a complex reflection group with a root system of type <span><math><msubsup><mrow><mi>B</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>(</mo><mi>m</mi><mo>)</mo></mrow></msubsup></math></span>. We also establish one-to-one correspondence between all positive integers in the set <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mo>⋯</mo><mo>,</mo><msup><mrow><mi>m</mi></mrow><mrow><mi>n</mi></mrow></msup><mi>n</mi><mo>!</mo><mo>}</mo></math></span> and the elements of <span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span> by constructing the subexceedant function in relation to this group. In addition, we provide a new enumeration system for <span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span><span> by defining the inversion statistic on </span><span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span>. Finally, we prove that the <em>flag-major index</em> is equi-distributed with this inversion statistic on <span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span>. Therefore, the flag-major index is a Mahonian statistic on <span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span> with respect to the length function <em>L</em>.</p></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"154 ","pages":"Article 102655"},"PeriodicalIF":1.1,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139028642","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信