Advances in Applied Mathematics最新文献

{"title":"The excluded minors for GF(5)-representable matroids on ten elements","authors":"Nick Brettell","doi":"10.1016/j.aam.2025.102864","DOIUrl":"10.1016/j.aam.2025.102864","url":null,"abstract":"<div><div>Mayhew and Royle (2008) showed that there are 564 excluded minors for the class of <span><math><mrow><mi>GF</mi></mrow><mo>(</mo><mn>5</mn><mo>)</mo></math></span>-representable matroids having at most 9 elements. We enumerate the excluded minors for <span><math><mrow><mi>GF</mi></mrow><mo>(</mo><mn>5</mn><mo>)</mo></math></span>-representable matroids having 10 elements: there are precisely 2128 such excluded minors. In the process we find, for each <span><math><mi>i</mi><mo>∈</mo><mo>{</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>}</mo></math></span>, the excluded minors for the class of <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>-representable matroids having at most 10 elements, and the excluded minors for the class of <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>5</mn></mrow></msub></math></span>-representable matroids having at most 13 elements.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"166 ","pages":"Article 102864"},"PeriodicalIF":1.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437100","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}

{"title":"Inconsequential results on the Merino-Welsh conjecture for Tutte polynomials","authors":"Joseph P.S. Kung","doi":"10.1016/j.aam.2025.102866","DOIUrl":"10.1016/j.aam.2025.102866","url":null,"abstract":"<div><div>We present two sufficient conditions on a rank-<em>r</em> coloop-free matroid <em>M</em> for the additive Merino-Welsh inequality to hold. The first is that the density of <em>M</em> is sufficiently large. The second is that all the cocircuits of <em>M</em> have at least <span><math><mi>r</mi><mo>+</mo><mn>1</mn></math></span> elements. These results are “inconsequential” in the sense that although they show that a version of the conjecture holds for many matroids, they are far from covering all the possible cases.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"166 ","pages":"Article 102866"},"PeriodicalIF":1.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437101","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}

{"title":"Explicit identities on zeta values over imaginary quadratic fields","authors":"Soumyarup Banerjee ,&nbsp;Rahul Kumar","doi":"10.1016/j.aam.2025.102865","DOIUrl":"10.1016/j.aam.2025.102865","url":null,"abstract":"<div><div>In this article, we study special values of the Dedekind zeta function over an imaginary quadratic field. The values of the Dedekind zeta function at any even integer over any totally real number field are quite well known in literature. We here exhibit the identities for both even and odd values of the Dedekind zeta function over an imaginary quadratic field which are analogous to Ramanujan's identities for even and odd zeta values over <span><math><mi>Q</mi></math></span>. Moreover, any complex zeta values over imaginary quadratic field may also be evaluated from our identities.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"166 ","pages":"Article 102865"},"PeriodicalIF":1.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143445391","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}

{"title":"On (joint) equidistributions of mesh patterns 123 and 132 with symmetric shadings","authors":"Shuzhen Lv ,&nbsp;Sergey Kitaev","doi":"10.1016/j.aam.2025.102856","DOIUrl":"10.1016/j.aam.2025.102856","url":null,"abstract":"<div><div>A notable problem within permutation patterns that has attracted considerable attention in literature since 1973 is the search for a bijective proof demonstrating that 123-avoiding and 132-avoiding permutations are equinumerous, both counted by the Catalan numbers. Despite this equivalence, the distributions of occurrences of the patterns 123 and 132 are distinct. When considering 123 and 132 as mesh patterns and selectively shading boxes, similar scenarios arise, even when avoidance is defined by the Bell numbers or other sequences, rather than the Catalan numbers.</div><div>However, computer experiments suggest that mesh patterns 123 and 132 may indeed be jointly equidistributed. Furthermore, by considering symmetric shadings relative to the diagonal, a maximum of 93 equidistributed pairs can potentially exist. This paper establishes 75 joint equidistributions, leaving the justification of the remaining cases as open problems. As a by-product, we also prove 36 relevant non-symmetric joint equidistributions. All our proofs are bijective and involve swapping occurrences of the patterns in question, thereby demonstrating their joint equidistribution. Our findings are a continuation of the systematic study of distributions of short-length mesh patterns initiated by Kitaev and Zhang in 2019.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"166 ","pages":"Article 102856"},"PeriodicalIF":1.0,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143394991","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}

{"title":"Generalized Morse theory of distance functions to surfaces for persistent homology","authors":"Anna Song ,&nbsp;Ka Man Yim ,&nbsp;Anthea Monod","doi":"10.1016/j.aam.2025.102857","DOIUrl":"10.1016/j.aam.2025.102857","url":null,"abstract":"<div><div>This paper brings together three distinct theories with the goal of quantifying shape textures with complex morphologies. Distance fields are central objects in shape representation, while topological data analysis uses algebraic topology to characterize geometric and topological patterns in shapes. The most well-known and widely applied tool from this approach is persistent homology, which tracks the evolution of topological features in a dynamic manner as a barcode. Morse theory is a framework from differential topology that studies critical points of functions on manifolds; it has been used to characterize the birth and death of persistent homology features. However, a significant limitation to Morse theory is that it cannot be readily applied to distance functions because distance functions lack smoothness, which is required in Morse theory. Our contribution to addressing this issue is two fold. First, we generalize Morse theory to Euclidean distance functions of bounded sets with smooth boundaries. We focus in particular on distance fields for shape representation and we study the persistent homology of shape textures using a sublevel set filtration induced by the signed distance function. We use transversality theory to prove that for generic embeddings of a smooth compact surface in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span>, signed distance functions admit finitely many non-degenerate critical points. This gives rise to our second contribution, which is that shapes and textures can both now be quantified and rigorously characterized in the language of persistent homology: signed distance persistence modules of generic shapes admit a finite barcode decomposition whose birth and death points can be classified and described geometrically. We use this approach to quantify shape textures on both simulated data and real vascular data from biology.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"166 ","pages":"Article 102857"},"PeriodicalIF":1.0,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387109","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}

{"title":"New refinements of Narayana polynomials and Motzkin polynomials","authors":"Janet J.W. Dong ,&nbsp;Lora R. Du ,&nbsp;Kathy Q. Ji ,&nbsp;Dax T.X. Zhang","doi":"10.1016/j.aam.2025.102855","DOIUrl":"10.1016/j.aam.2025.102855","url":null,"abstract":"<div><div>Chen, Deutsch and Elizalde introduced a refinement of the Narayana polynomials by distinguishing between old (leftmost child) and young leaves of plane trees. They also provided a refinement of Coker's formula by constructing a bijection. In fact, Coker's formula establishes a connection between the Narayana polynomials and the Motzkin polynomials, which implies the <em>γ</em>-positivity of the Narayana polynomials. In this paper, we introduce the polynomial <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>12</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>;</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>12</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span>, which further refines the Narayana polynomials by considering leaves of plane trees that have no siblings. We obtain the generating function for <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>12</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>;</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>12</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span>. To achieve further refinement of Coker's formula based on the polynomial <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>12</mn></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>;</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>12</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span>, we consider a refinement <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><msub><mrow><mi>u</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>u</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>u</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>;</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span> of the Motzkin polynomials by classifying the old leaves of a tip-augmented plane tree into three categories and the young leaves into two categories. The generating function for <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><msub><mrow><mi>u</mi></mrow><mrow><mn","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"166 ","pages":"Article 102855"},"PeriodicalIF":1.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387108","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}

{"title":"Computing triple and double Hurwitz numbers involving a branch point with a two-part profile","authors":"Zi-Wei Bai,&nbsp;Ricky X.F. Chen","doi":"10.1016/j.aam.2025.102854","DOIUrl":"10.1016/j.aam.2025.102854","url":null,"abstract":"<div><div>The study of Hurwitz numbers intersects with many research areas including representation theory, algebraic geometry and mathematical physics. Though many beautiful general properties have been discovered, obtaining explicit elementary expressions computing these numbers is hard and pertains to a primary goal of the topic. In fact, known explicit formulas are mainly for Hurwitz numbers involving at most two nonsimple branch points (i.e., double Hurwitz numbers). Even for double Hurwitz numbers, only the case where one of the branch points is fully ramified (i.e., one-part double Hurwitz numbers) has been completely and explicitly determined. In this paper, we contribute explicit elementary formulas computing Hurwitz numbers with completed <em>r</em>-cycles involving up to three nonsimple branch points where one of them has a two-part profile, enriching several lines of researches. In particular, we discuss the piecewise polynomiality and the genus-zero case in detail.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"165 ","pages":"Article 102854"},"PeriodicalIF":1.0,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155600","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}

{"title":"Generating functions of multiple t-star values of general level","authors":"Zhonghua Li,&nbsp;Lu Yan","doi":"10.1016/j.aam.2025.102853","DOIUrl":"10.1016/j.aam.2025.102853","url":null,"abstract":"<div><div>In this paper, we study the explicit expressions of multiple <em>t</em>-star values with an arbitrary number of blocks of twos of general level. We give an expression of a generating function of such values, which generalizes the results for multiple zeta-star values and multiple <em>t</em>-star values. This derived generating function can provide expressions of multiple <em>t</em>-star values of general level in terms of the alternating multiple <em>t</em>-half values of general level with additional factorial and pochhammer symbol. As applications, some specific evaluations of multiple <em>t</em>-star values of general level with one-two-three or more general indices are given. These evaluations contribute to a deeper understanding of the properties of multiple <em>t</em>-star values of general level.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"165 ","pages":"Article 102853"},"PeriodicalIF":1.0,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155599","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}

{"title":"Convex optimization on CAT(0) cubical complexes","authors":"Ariel Goodwin ,&nbsp;Adrian S. Lewis ,&nbsp;Genaro López-Acedo ,&nbsp;Adriana Nicolae","doi":"10.1016/j.aam.2025.102849","DOIUrl":"10.1016/j.aam.2025.102849","url":null,"abstract":"<div><div>We consider geodesically convex optimization problems involving distances to a finite set of points <em>A</em> in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the feasibility and projection problems for intersecting balls with centers in <em>A</em>. We propose a decomposition approach relying on standard Euclidean cutting plane algorithms. The cutting planes are readily derivable from efficient algorithms for computing geodesics in the complex.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"165 ","pages":"Article 102849"},"PeriodicalIF":1.0,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155601","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}

{"title":"Lattice paths and the Rogers–Ramanujan–Gordon type theorems with parity considerations","authors":"Robert X.J. Hao ,&nbsp;Diane Y.H. Shi","doi":"10.1016/j.aam.2025.102850","DOIUrl":"10.1016/j.aam.2025.102850","url":null,"abstract":"<div><div>Andrews imposed parity restrictions on the Rogers–Ramanujan–Gordon type partitions, yielding fruitful results. These results were later, advanced by Kurşungöz, Kim, and Yee. In this paper, we construct a bijection between the lattice paths with three types of unitary steps and the Rogers–Ramanujan–Gordon type partitions, which can also provide some refinements of the theorem. By the bijection, we shall give some results involving parity considerations on lattice paths, as the counterpart of Andrews' partition results. Finally, by adding some new restrictions on lattice paths, we also obtain new functions as the generating functions for certain types of lattice paths.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"165 ","pages":"Article 102850"},"PeriodicalIF":1.0,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143156472","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}