Advances in Applied Mathematics最新文献

{"title":"Conditions for virtually Cohen–Macaulay simplicial complexes","authors":"Adam Van Tuyl ,&nbsp;Jay Yang","doi":"10.1016/j.aam.2024.102830","DOIUrl":"10.1016/j.aam.2024.102830","url":null,"abstract":"<div><div>A simplicial complex Δ is a virtually Cohen–Macaulay simplicial complex if its associated Stanley-Reisner ring <em>S</em> has a virtual resolution, as defined by Berkesch, Erman, and Smith, of length <span><math><mrow><mi>codim</mi></mrow><mo>(</mo><mi>S</mi><mo>)</mo></math></span>. We provide a sufficient condition on Δ to be a virtually Cohen–Macaulay simplicial complex. We also introduce virtually shellable simplicial complexes, a generalization of shellable simplicial complexes. Virtually shellable complexes have the property that they are virtually Cohen–Macaulay, generalizing the well-known fact that shellable simplicial complexes are Cohen–Macaulay.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102830"},"PeriodicalIF":1.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143154474","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":"Dynamics of pop-tsack torsing","authors":"Anqi Li","doi":"10.1016/j.aam.2024.102826","DOIUrl":"10.1016/j.aam.2024.102826","url":null,"abstract":"&lt;div&gt;&lt;div&gt;For a finite irreducible Coxeter group &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; with a fixed Coxeter element &lt;em&gt;c&lt;/em&gt; and set of reflections &lt;em&gt;T&lt;/em&gt;, Defant and Williams define a pop-tsack torsing operation &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;mo&gt;→&lt;/mo&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; given by &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt; where &lt;span&gt;&lt;math&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mo&gt;⋁&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;c&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;mi&gt;t&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; is the join of all reflections lying below &lt;em&gt;w&lt;/em&gt; in the absolute order in the non-crossing partition lattice &lt;span&gt;&lt;math&gt;&lt;mi&gt;N&lt;/mi&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;c&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. This is a “dual” notion of the pop-stack sorting operator &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;; &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; was introduced by Defant as a way to generalize the pop-stack sorting operator on &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; to general Coxeter groups. Define the forward orbit of an element &lt;span&gt;&lt;math&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; to be &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&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;/math&gt;&lt;/span&gt;. Defant and Williams established the length of the longest possible forward orbits &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;max&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;W&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mrow&gt;&lt;mi&gt;Po&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; for Coxeter groups of coincidental types and Type D in terms of the corresponding Coxeter number of the group. In their paper, they also proposed multiple conjectures about enumerating elements with near maximal orbit length. We resolve all the ","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102826"},"PeriodicalIF":1.0,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143154477","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":"Letter frequency vs factor frequency in pure morphic words","authors":"Shuo Li","doi":"10.1016/j.aam.2024.102834","DOIUrl":"10.1016/j.aam.2024.102834","url":null,"abstract":"<div><div>We prove that, for any pure morphic word <em>w</em>, if the frequencies of all letters in <em>w</em> exist, then the frequencies of all factors in <em>w</em> exist as well. This result answers a question of Saari in his doctoral thesis.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102834"},"PeriodicalIF":1.0,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143154470","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":"Initial values of ML-degree polynomials","authors":"Maciej Gałązka","doi":"10.1016/j.aam.2024.102831","DOIUrl":"10.1016/j.aam.2024.102831","url":null,"abstract":"<div><div>We prove a conjecture about the initial values of ML-degree polynomials stated by Michałek, Monin, and Wiśniewski.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102831"},"PeriodicalIF":1.0,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143154473","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":"Chordal matroids arising from generalized parallel connections II","authors":"James Dylan Douthitt,&nbsp;James Oxley","doi":"10.1016/j.aam.2024.102833","DOIUrl":"10.1016/j.aam.2024.102833","url":null,"abstract":"<div><div>In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>-chordal matroids as those matroids that can be constructed from projective geometries over <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span> by a sequence of generalized parallel connections across projective geometries over <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>. Our main result showed that when <span><math><mi>q</mi><mo>=</mo><mn>2</mn></math></span>, such matroids have no induced minor in <span><math><mo>{</mo><mi>M</mi><mo>(</mo><msub><mrow><mi>C</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>)</mo><mo>,</mo><mi>M</mi><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>)</mo><mo>}</mo></math></span>. In this paper, we show that the class of <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mn>2</mn><mo>)</mo></math></span>-chordal matroids coincides with the class of binary matroids that have none of <span><math><mi>M</mi><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>4</mn></mrow></msub><mo>)</mo></math></span>, <span><math><msup><mrow><mi>M</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msub><mo>)</mo></math></span>, or <span><math><mi>M</mi><mo>(</mo><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></math></span> for <span><math><mi>n</mi><mo>≥</mo><mn>4</mn></math></span> as a flat. We also show that <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>-chordal matroids can be characterized by an analogous result to Rose's 1970 characterization of chordal graphs as those that have a perfect elimination ordering of vertices.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102833"},"PeriodicalIF":1.0,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143154471","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":"Consecutive pattern containment and c-Wilf equivalence","authors":"Reza Rastegar","doi":"10.1016/j.aam.2024.102829","DOIUrl":"10.1016/j.aam.2024.102829","url":null,"abstract":"<div><div>We offer elementary proofs for several results in consecutive pattern containment that were previously demonstrated using ideas from cluster method and analytical combinatorics. Furthermore, we establish new general bounds on the growth rates of consecutive pattern avoidance in permutations.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102829"},"PeriodicalIF":1.0,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143153922","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":"Simultaneous orderings and combinatorial interpretations of generalized factorials and binomial coefficients","authors":"Lan Nguyen","doi":"10.1016/j.aam.2024.102810","DOIUrl":"10.1016/j.aam.2024.102810","url":null,"abstract":"<div><div>In this paper, we answer several questions raised by Manjul Bhargava concerning <em>p</em>-orderings, <em>p</em>-sequences, and combinatorial interpretations of generalized factorials and binomial coefficients associated with subsets <em>S</em> of <span><math><mi>Z</mi></math></span>. First, we prove some results of Bhargava concerning <em>p</em>-orderings, <em>p</em>-sequences and the integrality of generalized binomial coefficients directly from definitions, answering two questions of Bhargava. As a result, we also obtain some explicit descriptions of the <em>p</em>-sequences associated with <em>p</em>-orderings which do not exist in Bhargava's proofs. Second, we provide some combinatorial interpretations for the generalized factorials and the generalized binomial coefficients associated with subsets of <span><math><mi>Z</mi></math></span> which possess simultaneous <em>p</em>-orderings, answering two other questions raised by Bhargava.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"164 ","pages":"Article 102810"},"PeriodicalIF":1.0,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143153923","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":"A direct proof of well-definedness for the polymatroid Tutte polynomial","authors":"Xiaxia Guan ,&nbsp;Xian'an Jin","doi":"10.1016/j.aam.2024.102809","DOIUrl":"10.1016/j.aam.2024.102809","url":null,"abstract":"<div><div>For a polymatroid <em>P</em> over <span><math><mo>[</mo><mi>n</mi><mo>]</mo></math></span>, Bernardi et al. (2022) <span><span>[1]</span></span> introduced the polymatroid Tutte polynomial <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>P</mi></mrow></msub></math></span> relying on the order <span><math><mn>1</mn><mo>&lt;</mo><mn>2</mn><mo>&lt;</mo><mo>⋯</mo><mo>&lt;</mo><mi>n</mi></math></span> of <span><math><mo>[</mo><mi>n</mi><mo>]</mo></math></span>, which generalizes the classical Tutte polynomial from matroids to polymatroids. They proved the independence of this order by the fact that <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>P</mi></mrow></msub></math></span> is equivalent to another polynomial that only depends on <em>P</em>. In this paper, similar to the Tutte's original proof of the well-definedness of the Tutte polynomial defined by the summation over all spanning trees using activities depending on the order of edges, we give a direct and elementary proof of the well-definedness of the polymatroid Tutte polynomial.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102809"},"PeriodicalIF":1.0,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722289","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":"Existence of solutions to the even Gaussian dual Minkowski problem","authors":"Yibin Feng ,&nbsp;Shengnan Hu ,&nbsp;Lei Xu","doi":"10.1016/j.aam.2024.102808","DOIUrl":"10.1016/j.aam.2024.102808","url":null,"abstract":"<div><div>In this paper, we consider the Gaussian dual Minkowski problem. The problem involves a new type of fully nonlinear partial differential equations on the unit sphere. Our main purpose is to show the existence of solutions to the even Gaussian dual Minkowski problem for <span><math><mi>q</mi><mo>&gt;</mo><mn>0</mn></math></span>. More precisely, we will show that there exists an origin-symmetric convex body <em>K</em> in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> such that its Gaussian dual curvature measure <span><math><msub><mrow><mover><mrow><mi>C</mi></mrow><mrow><mo>˜</mo></mrow></mover></mrow><mrow><msub><mrow><mi>γ</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>,</mo><mi>q</mi></mrow></msub><mo>(</mo><mi>K</mi><mo>,</mo><mo>⋅</mo><mo>)</mo></math></span> has density <em>f</em> (up to a constant) on the unit sphere when <span><math><mi>q</mi><mo>&gt;</mo><mn>0</mn></math></span> and <em>f</em> has positive upper and lower bounds. Note that if <em>f</em> is smooth then <em>K</em> is also smooth. As the application of smooth solutions, we completely solve the even Gaussian dual Minkowski problem for <span><math><mi>q</mi><mo>&gt;</mo><mn>0</mn></math></span> based on an approximation argument.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102808"},"PeriodicalIF":1.0,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142703820","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":"Identifying circular orders for blobs in phylogenetic networks","authors":"John A. Rhodes ,&nbsp;Hector Baños ,&nbsp;Jingcheng Xu ,&nbsp;Cécile Ané","doi":"10.1016/j.aam.2024.102804","DOIUrl":"10.1016/j.aam.2024.102804","url":null,"abstract":"<div><div>Interest in the inference of evolutionary networks relating species or populations has grown with the increasing recognition of the importance of hybridization, gene flow and admixture, and the availability of large-scale genomic data. However, what network features may be validly inferred from various data types under different models remains poorly understood. Previous work has largely focused on level-1 networks, in which reticulation events are well separated, and on a general network's tree of blobs, the tree obtained by contracting every blob to a node. An open question is the identifiability of the topology of a blob of unknown level. We consider the identifiability of the circular order in which subnetworks attach to a blob, first proving that this order is well-defined for outer-labeled planar blobs. For this class of blobs, we show that the circular order information from 4-taxon subnetworks identifies the full circular order of the blob. Similarly, the circular order from 3-taxon rooted subnetworks identifies the full circular order of a rooted blob. We then show that subnetwork circular information is identifiable from certain data types and evolutionary models. This provides a general positive result for high-level networks, on the identifiability of the ordering in which taxon blocks attach to blobs in outer-labeled planar networks. Finally, we give examples of blobs with different internal structures which cannot be distinguished under many models and data types.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102804"},"PeriodicalIF":1.0,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142703819","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}