发布求助
文献互助 智能选刊 最新文献

Discrete Mathematics and Theoretical Computer Science最新文献

筛选
英文 中文
Oriented Flip Graphs and Noncrossing Tree Partitions 面向翻转图和非交叉树分区
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2016-04-20 DOI: 10.46298/dmtcs.6379
Alexander Garver, T. McConville
{"title":"Oriented Flip Graphs and Noncrossing Tree Partitions","authors":"Alexander Garver, T. McConville","doi":"10.46298/dmtcs.6379","DOIUrl":"https://doi.org/10.46298/dmtcs.6379","url":null,"abstract":"International audience\u0000 \u0000 Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions. When the interior vertices of the tree have degree 3, the oriented flip graph is equivalent to the oriented exchange graph of a type A cluster algebra. Our main result is an isomorphism between the shard intersection order of the oriented flip graph and the lattice of noncrossing tree partitions. As a consequence, we deduce a simple characterization of c-matrices of type A cluster algebras.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2016-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70482089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Kraskiewicz-Pragacz modules and Pieri and dual Pieri rules for Schubert polynomials Schubert多项式的Kraskiewicz-Pragacz模和Pieri及对偶Pieri规则
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2016-03-19 DOI: 10.46298/dmtcs.6321
Masaki Watanabe
{"title":"Kraskiewicz-Pragacz modules and Pieri and dual Pieri rules for Schubert polynomials","authors":"Masaki Watanabe","doi":"10.46298/dmtcs.6321","DOIUrl":"https://doi.org/10.46298/dmtcs.6321","url":null,"abstract":"International audience\u0000 \u0000 In their 1987 paper Kraskiewicz and Pragacz defined certain modules, which we call KP modules, over the upper triangular Lie algebra whose characters are Schubert polynomials. In a previous work the author showed that the tensor product of Kraskiewicz-Pragacz modules always has KP filtration, i.e. a filtration whose each successive quotients are isomorphic to KP modules. In this paper we explicitly construct such filtrations for certain special cases of these tensor product modules, namely Sw Sd(Ki) and Sw Vd(Ki), corresponding to Pieri and dual Pieri rules for Schubert polynomials.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2016-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Schur polynomials and matrix positivity preservers 舒尔多项式与矩阵正守恒
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2016-02-15 DOI: 10.46298/dmtcs.6408
A. Belton, D. Guillot, A. Khare, M. Putinar
{"title":"Schur polynomials and matrix positivity preservers","authors":"A. Belton, D. Guillot, A. Khare, M. Putinar","doi":"10.46298/dmtcs.6408","DOIUrl":"https://doi.org/10.46298/dmtcs.6408","url":null,"abstract":"International audience\u0000 \u0000 A classical result by Schoenberg (1942) identifies all real-valued functions that preserve positive semidefi- niteness (psd) when applied entrywise to matrices of arbitrary dimension. Schoenberg's work has continued to attract significant interest, including renewed recent attention due to applications in high-dimensional statistics. However, despite a great deal of effort in the area, an effective characterization of entrywise functions preserving positivity in a fixed dimension remains elusive to date. As a first step, we characterize new classes of polynomials preserving pos- itivity in fixed dimension. The proof of our main result is representation theoretic, and employs Schur polynomials. An alternate, variational approach also leads to several interesting consequences including (a) a hitherto unexplored Schubert cell-type stratification of the cone of psd matrices, (b) new connections between generalized Rayleigh quo- tients of Hadamard powers and Schur polynomials, and (c) a description of the joint kernels of Hadamard powers.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Matrix product and sum rule for Macdonald polynomials 麦克唐纳多项式的矩阵乘积和定则
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2016-02-13 DOI: 10.46298/dmtcs.6419
L. Cantini, J. Gier, M. Wheeler
{"title":"Matrix product and sum rule for Macdonald polynomials","authors":"L. Cantini, J. Gier, M. Wheeler","doi":"10.46298/dmtcs.6419","DOIUrl":"https://doi.org/10.46298/dmtcs.6419","url":null,"abstract":"International audience\u0000 \u0000 We present a new, explicit sum formula for symmetric Macdonald polynomials Pλ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov– Faddeev (ZF) algebra. We construct solutions of the ZF algebra from a rank-reduced version of the Yang–Baxter algebra. As a corollary, we find that the normalization of the stationary measure of the multi-species asymmetric exclusion process is a Macdonald polynomial with all variables set equal to one.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2016-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70482189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A lattice point counting generalisation of the Tutte polynomial Tutte多项式的格点计数推广
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2016-02-12 DOI: 10.46298/dmtcs.6331
Amanda Cameron, Alex Fink
{"title":"A lattice point counting generalisation of the Tutte polynomial","authors":"Amanda Cameron, Alex Fink","doi":"10.46298/dmtcs.6331","DOIUrl":"https://doi.org/10.46298/dmtcs.6331","url":null,"abstract":"International audience\u0000 \u0000 The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion- contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a matroid, and in fact contains the same information as the Tutte polynomial when we restrict to matroids. This polynomial is constructed using lattice point counts in the Minkowski sum of the base polytope of a polymatroid and scaled copies of the standard simplex. We also show that, in the matroid case, our polynomial has coefficients of alternating sign, with a combinatorial interpretation closely tied to the Dawson partition.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2016-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Cumulants of Jack symmetric functions and $b$-conjecture 杰克对称函数的累积量与$b$-猜想
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2016-01-07 DOI: 10.1090/tran/7191
Maciej Dolkega, Valentin F'eray
{"title":"Cumulants of Jack symmetric functions and $b$-conjecture","authors":"Maciej Dolkega, Valentin F'eray","doi":"10.1090/tran/7191","DOIUrl":"https://doi.org/10.1090/tran/7191","url":null,"abstract":"Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series $psi(x, y, z; t, 1+beta)$ that might be interpreted as a continuous deformation of the generating series of rooted hypermaps. They made the following conjecture: the coefficients of $psi(x, y, z; t, 1+beta)$ in the power-sum basis are polynomials in $beta$ with nonnegative integer coefficients (by construction, these coefficients are rational functions in $beta$). \u0000We prove partially this conjecture, nowadays called $b$-conjecture, by showing that coefficients of $psi(x, y, z; t, 1+ beta)$ are polynomials in $beta$ with rational coefficients. A key step of the proof is a strong factorization property of Jack polynomials when the Jack-deformation parameter $alpha$ tends to $0$, that may be of independent interest.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2016-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1090/tran/7191","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"60695985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Yang-Baxter basis of Hecke algebra and Casselman's problem (extended abstract) Hecke代数的Yang-Baxter基与Casselman问题(扩展抽象)
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2015-12-14 DOI: 10.46298/dmtcs.6370
Maki Nakasuji, H. Naruse
{"title":"Yang-Baxter basis of Hecke algebra and Casselman's problem (extended abstract)","authors":"Maki Nakasuji, H. Naruse","doi":"10.46298/dmtcs.6370","DOIUrl":"https://doi.org/10.46298/dmtcs.6370","url":null,"abstract":"International audience\u0000 \u0000 We generalize the definition of Yang-Baxter basis of type A Hecke algebra introduced by A.Lascoux, B.Leclerc and J.Y.Thibon (Letters in Math. Phys., 40 (1997), 75–90) to all the Lie types and prove their duality. As an application we give a solution to Casselman's problem on Iwahori fixed vectors of principal series representation of p-adic groups.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A bijection for nonorientable general maps 不可定向的一般地图的映射
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2015-12-07 DOI: 10.46298/dmtcs.6398
Jérémie Bettinelli
{"title":"A bijection for nonorientable general maps","authors":"Jérémie Bettinelli","doi":"10.46298/dmtcs.6398","DOIUrl":"https://doi.org/10.46298/dmtcs.6398","url":null,"abstract":"International audience\u0000 \u0000 We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps. This can be seen as a Bouttier–Di Francesco–Guitter-like generalization of the Cori–Vauquelin–Schaeffer bijection in the context of general nonori- entable surfaces. In the particular case of triangulations, the encoding objects take a particularly simple form and we recover a famous asymptotic enumeration formula found by Gao.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Counting quadrant walks via Tutte's invariant method (extended abstract) 用Tutte不变法计算象限行走数(扩展摘要)
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2015-11-13 DOI: 10.46298/dmtcs.6416
Olivier Bernardi, Mireille Bousquet-M'elou, K. Raschel
{"title":"Counting quadrant walks via Tutte's invariant method (extended abstract)","authors":"Olivier Bernardi, Mireille Bousquet-M'elou, K. Raschel","doi":"10.46298/dmtcs.6416","DOIUrl":"https://doi.org/10.46298/dmtcs.6416","url":null,"abstract":"Extended abstract presented at the conference FPSAC 2016, Vancouver.\u0000 International audience\u0000 \u0000 In the 1970s, Tutte developed a clever algebraic approach, based on certain \" invariants \" , to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to the first quadrant is governed by similar equations, and has led in the past decade to a rich collection of attractive results dealing with the nature (algebraic, D-finite or not) of the associated generating function, depending on the set of allowed steps. We first adapt Tutte's approach to prove (or reprove) the algebraicity of all quadrant models known or conjectured to be algebraic (with one small exception). This includes Gessel's famous model, and the first proof ever found for one model with weighted steps. To be applicable, the method requires the existence of two rational functions called invariant and decoupling function respectively. When they exist, algebraicity comes out (almost) automatically. Then, we move to an analytic viewpoint which has already proved very powerful, leading in particular to integral expressions of the generating function in the non-D-finite cases, as well as to proofs of non-D-finiteness. We develop in this context a weaker notion of invariant. Now all quadrant models have invariants, and for those that have in addition a decoupling function, we obtain integral-free expressions of the generating function, and a proof that this series is differentially algebraic (that is, satisfies a non-linear differential equation).\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2015-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70482436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 42
Asymptotics of lattice walks via analytic combinatorics in several variables 多变量格行分析组合的渐近性
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2015-11-08 DOI: 10.46298/dmtcs.6390
S. Melczer, Mark C. Wilson
{"title":"Asymptotics of lattice walks via analytic combinatorics in several variables","authors":"S. Melczer, Mark C. Wilson","doi":"10.46298/dmtcs.6390","DOIUrl":"https://doi.org/10.46298/dmtcs.6390","url":null,"abstract":"International audience\u0000 \u0000 We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79 unique two-dimensional models to consider, and previous work in this area has used the kernel method, along with a rigorous computer algebra approach, to show that 23 of the 79 models admit D-finite generating functions. In 2009, Bostan and Kauers used Pade ́-Hermite approximants to guess differential equations which these 23 generating functions satisfy, in the process guessing asymptotics of their coefficient sequences. In this article we provide, for the first time, a complete rigorous verification of these guesses. Our technique is to use the kernel method to express 19 of the 23 generating functions as diagonals of tri-variate rational functions and apply the methods of analytic combinatorics in several variables (the remaining 4 models have algebraic generating functions and can thus be handled by univariate techniques). This approach also shows the link between combinatorial properties of the models and features of its asymptotics such as asymptotic and polynomial growth factors. In addition, we give expressions for the number of walks returning to the x-axis, the y-axis, and the origin, proving recently conjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2015-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
首页 上一页 下一页 尾页
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学术官方微信