Advances in Applied Mathematics最新文献_第4页

Identifying circular orders for blobs in phylogenetic networks 识别系统发生网络中 Blob 的循环顺序

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-11-20 DOI: 10.1016/j.aam.2024.102804

John A. Rhodes , Hector Baños , Jingcheng Xu , Cécile Ané

{"title":"Identifying circular orders for blobs in phylogenetic networks","authors":"John A. Rhodes , Hector Baños , Jingcheng Xu , 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}

引用次数: 0

Triangular partitions: Enumeration, structure, and generation 三角形分区：枚举、结构和生成

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-11-16 DOI: 10.1016/j.aam.2024.102807

Sergi Elizalde , Alejandro B. Galván

{"title":"Triangular partitions: Enumeration, structure, and generation","authors":"Sergi Elizalde , Alejandro B. Galván","doi":"10.1016/j.aam.2024.102807","DOIUrl":"10.1016/j.aam.2024.102807","url":null,"abstract":"<div><div>A <em>triangular partition</em> is a partition whose Ferrers diagram can be separated from its complement (as a subset of <span><math><msup><mrow><mi>N</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular partitions have been studied from a combinatorial perspective by Onn and Sturmfels, and by Corteel et al. under the name <em>plane corner cuts</em>, and more recently by Bergeron and Mazin in the context of algebraic combinatorics. In this paper we derive new enumerative, geometric and algorithmic properties of such partitions.</div><div>We give a new characterization of triangular partitions and the cells that can be added or removed while preserving the triangular condition, and use it to describe the Möbius function of the restriction of Young's lattice to triangular partitions. We obtain a formula for the number of triangular partitions whose Young diagram fits inside a square, deriving, as a byproduct, a new proof of Lipatov's enumeration theorem for balanced words. Finally, we present an algorithm that generates all the triangular partitions of a given size, which is significantly more efficient than previous ones and allows us to compute the number of triangular partitions of size up to 10<sup>5</sup>.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102807"},"PeriodicalIF":1.0,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142659973","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

Principal specializations of Schubert polynomials, multi-layered permutations and asymptotics 舒伯特多项式的主特殊化、多层排列和渐近论

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-11-12 DOI: 10.1016/j.aam.2024.102806

Ningxin Zhang

引用次数: 0

Fully graphic degree sequences and P-stable degree sequences 全图形度序列和 P 稳定度序列

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-11-12 DOI: 10.1016/j.aam.2024.102805

Péter L. Erdős , István Miklós , Lajos Soukup

{"title":"Fully graphic degree sequences and P-stable degree sequences","authors":"Péter L. Erdős , István Miklós , Lajos Soukup","doi":"10.1016/j.aam.2024.102805","DOIUrl":"10.1016/j.aam.2024.102805","url":null,"abstract":"<div><div>The notion of <em>P</em>-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While there exist several known sufficient conditions for <em>P</em>-stability, we don't know any useful necessary condition for it. We also do not have good insight of possible structure of <em>P</em>-stable degree sequence families.</div><div>At first we will show that every known infinite <em>P</em>-stable degree sequence set, described by inequalities of the parameters <span><math><mi>n</mi><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mi>Σ</mi></math></span> (the sequence length, the maximum and minimum degrees and the sum of the degrees) is “fully graphic” meaning that every degree sequence from the region with an even degree sum, is graphic. Furthermore, if Σ does not occur in the determining inequality, then the notions of <em>P</em>-stability and full graphicality will be proved equivalent. In turn, this equality provides a strengthening of the well-known theorem of Jerrum, McKay and Sinclair about <em>P</em>-stability, describing the maximal <em>P</em>-stable sequence set by <span><math><mi>n</mi><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>. Furthermore we conjecture that similar equivalences occur in cases if Σ also part of the defining inequality.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102805"},"PeriodicalIF":1.0,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142661921","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

Non-intersecting path explanation for block Pfaffians and applications into skew-orthogonal polynomials 分块普法因子的非相交路径解释及其在倾斜正交多项式中的应用

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-11-12 DOI: 10.1016/j.aam.2024.102803

Zong-Jun Yao, Shi-Hao Li

引用次数: 0

Refining a chain theorem from matroids to internally 4-connected graphs 完善从矩阵到内部 4 连接图的链式定理

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-11-06 DOI: 10.1016/j.aam.2024.102802

Chanun Lewchalermvongs , Guoli Ding

引用次数: 0

On the enumeration of series-parallel matroids 关于串并联矩阵的枚举

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-10-30 DOI: 10.1016/j.aam.2024.102801

Nicholas Proudfoot , Yuan Xu , Benjamin Young

引用次数: 0

Identifiability of homoscedastic linear structural equation models using algebraic matroids 利用代数矩阵识别同源线性结构方程模型

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-10-15 DOI: 10.1016/j.aam.2024.102794

Mathias Drton, Benjamin Hollering, Jun Wu

引用次数: 0

Minimal skew semistandard tableaux and the Hillman–Grassl correspondence 最小倾斜半标准表和希尔曼-格拉斯尔对应关系

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-10-14 DOI: 10.1016/j.aam.2024.102792

Alejandro H. Morales , Greta Panova , GaYee Park

{"title":"Minimal skew semistandard tableaux and the Hillman–Grassl correspondence","authors":"Alejandro H. Morales , Greta Panova , GaYee Park","doi":"10.1016/j.aam.2024.102792","DOIUrl":"10.1016/j.aam.2024.102792","url":null,"abstract":"<div><div>Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula <span><span>(NHLF)</span></span> as a positive sum over excited diagrams of products of hook-lengths. Subsequently, Morales, Pak, and Panova gave a <em>q</em>-analogue of this formula in terms of skew semistandard tableaux (SSYT). They also showed, partly algebraically, that the Hillman–Grassl bijection, restricted to skew semistandard tableaux, is behind their <em>q</em>-analogue. We study the problem of circumventing the algebraic part and proving the bijection completely combinatorially, which we do for the case of border strips. For general skew shapes, we define minimal semistandard Young tableaux, that are in correspondence with excited diagrams via a new description of the Hillman–Grassl bijection and have an analogue of excited moves. Lastly, we relate the minimal skew SSYT with the terms of the Okounkov-Olshanski formula <span><span>(OOF)</span></span> for counting standard tableaux of skew shape. Our construction immediately implies that the summands in the NHLF are less than the summands in the OOF and we characterize the shapes where both formulas have the same number of summands.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102792"},"PeriodicalIF":1.0,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434090","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

Proof of a conjecture about Parrondo's paradox for two-armed slot machines 双臂老虎机帕隆多悖论猜想的证明

IF 1 3区数学

Advances in Applied Mathematics Pub Date : 2024-10-03 DOI: 10.1016/j.aam.2024.102793

Huaijin Liang , Zengjing Chen

{"title":"Proof of a conjecture about Parrondo's paradox for two-armed slot machines","authors":"Huaijin Liang , Zengjing Chen","doi":"10.1016/j.aam.2024.102793","DOIUrl":"10.1016/j.aam.2024.102793","url":null,"abstract":"<div><div>The 1936 Mills Futurity slot machine had the feature that, if a player loses 10 times in a row, the 10 lost coins are returned. Ethier and Lee (2010) studied a generalized version of this machine, with 10 replaced by deterministic parameter <em>J</em>. They established the Parrondo effect for a hypothetical two-armed machine with the Futurity award. Specifically, arm <em>A</em> and arm <em>B</em>, played individually, are asymptotically fair, but when alternated randomly (the so-called random mixture strategy), the casino makes money in the long run. They also considered the nonrandom periodic pattern strategy for patterns with <em>r A</em>s and <em>s B</em>s (e.g., <span><math><mi>A</mi><mi>B</mi><mi>A</mi><mi>B</mi><mi>B</mi></math></span> if <span><math><mi>r</mi><mo>=</mo><mn>2</mn></math></span> and <span><math><mi>s</mi><mo>=</mo><mn>3</mn></math></span>). They established the Parrondo effect if <span><math><mi>r</mi><mo>+</mo><mi>s</mi></math></span> divides <em>J</em>, and conjectured it in four other situations, including the case <span><math><mi>J</mi><mo>=</mo><mn>2</mn></math></span> with <span><math><mi>r</mi><mo>≥</mo><mn>1</mn></math></span> and <span><math><mi>s</mi><mo>≥</mo><mn>1</mn></math></span>. We prove the conjecture in the latter case.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"163 ","pages":"Article 102793"},"PeriodicalIF":1.0,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423378","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