arXiv: Combinatorics最新文献

筛选
英文 中文
Schubert Products for Permutations with Separated Descents. 具有分离下降的排列的Schubert积。
arXiv: Combinatorics Pub Date : 2021-05-04 DOI: 10.1093/imrn/rnac299
Daoji Huang
{"title":"Schubert Products for Permutations with Separated Descents.","authors":"Daoji Huang","doi":"10.1093/imrn/rnac299","DOIUrl":"https://doi.org/10.1093/imrn/rnac299","url":null,"abstract":"We say that two permutations $pi$ and $rho$ have separated descents at position $k$ if $pi$ has no descents before position $k$ and $rho$ has no descents after position $k$. We give a counting formula, in terms of reduced word tableaux, for computing the structure constants of products of Schubert polynomials indexed by permutations with separated descents. Our approach uses generalizations of Sch\"utzenberger's jeu de taquin algorithm and the Edelman-Greene correspondence via bumpless pipe dreams.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78853390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers 第一种形式(q,r)-Dowling数和(q,r)-Whitney-Lah数的显式公式
arXiv: Combinatorics Pub Date : 2020-12-14 DOI: 10.29020/NYBG.EJPAM.V14I1.3900
R. Corcino, Jay M. Ontolan, Maria Rowena S. Lobrigas
{"title":"Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers","authors":"R. Corcino, Jay M. Ontolan, Maria Rowena S. Lobrigas","doi":"10.29020/NYBG.EJPAM.V14I1.3900","DOIUrl":"https://doi.org/10.29020/NYBG.EJPAM.V14I1.3900","url":null,"abstract":"In this paper, a q-analogue of r-Whitney-Lah numbers, also known as (q,r)-Whitney-Lah number, denoted by $L_{m,r}[n,k]_q$ is defined using the triangular recurrence relation. Several fundamental properties for the q-analogue are established such as vertical and horizontal recurrence relations, horizontal and exponential generating functions. Moreover, an explicit formula for (q,r)-Whitney-Lah number is derived using the concept of q-difference operator, particularly, the q-analogue of Newton's Interpolation Formula (the umbral version of Taylor series). Furthermore, an explicit formula for the first form (q,r)-Dowling numbers is obtained which is expressed in terms of (q,r)-Whitney-Lah numbers and (q,r)-Whitney numbers of the second kind.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90312611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Tit-for-Tat Strategy as a Deformed Zero-Determinant Strategy in Repeated Games 重复博弈中以牙还牙策略的变形零行列式策略
arXiv: Combinatorics Pub Date : 2020-12-10 DOI: 10.7566/JPSJ.90.025002
M. Ueda
{"title":"Tit-for-Tat Strategy as a Deformed Zero-Determinant Strategy in Repeated Games","authors":"M. Ueda","doi":"10.7566/JPSJ.90.025002","DOIUrl":"https://doi.org/10.7566/JPSJ.90.025002","url":null,"abstract":"We introduce the concept of deformed zero-determinant strategies in repeated games. We then show that the Tit-for-Tat strategy in the repeated prisoner's dilemma game is a deformed zero-determinant strategy, which unilaterally equalizes the probability distribution functions of payoffs of two players.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86992966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
$lambda$-Core Distance Partitions $lambda$-Core Distance Partitions
arXiv: Combinatorics Pub Date : 2020-12-07 DOI: 10.1016/j.laa.2020.12.012.
Xandru Mifsud
{"title":"$lambda$-Core Distance Partitions","authors":"Xandru Mifsud","doi":"10.1016/j.laa.2020.12.012.","DOIUrl":"https://doi.org/10.1016/j.laa.2020.12.012.","url":null,"abstract":"","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83698599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An inequality for coefficients of the real-rooted polynomials 实根多项式系数的一个不等式
arXiv: Combinatorics Pub Date : 2020-12-07 DOI: 10.1016/J.JNT.2021.02.011
J. Guo
{"title":"An inequality for coefficients of the real-rooted polynomials","authors":"J. Guo","doi":"10.1016/J.JNT.2021.02.011","DOIUrl":"https://doi.org/10.1016/J.JNT.2021.02.011","url":null,"abstract":"","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78099644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Discordant sets and ergodic Ramsey theory. 不谐和集与遍历拉姆齐理论。
arXiv: Combinatorics Pub Date : 2020-11-30 DOI: 10.2140/involve.2022.15.89
V. Bergelson, Jake Huryn, R. Raghavan
{"title":"Discordant sets and ergodic Ramsey theory.","authors":"V. Bergelson, Jake Huryn, R. Raghavan","doi":"10.2140/involve.2022.15.89","DOIUrl":"https://doi.org/10.2140/involve.2022.15.89","url":null,"abstract":"We explore the properties of non-piecewise syndetic sets with positive upper density, which we call discordant, in countable amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest the difference in complexity between the classical van der Waerden's theorem and Szemer'edi's theorem. We generalize and unify old constructions and obtain new results about these historically interesting sets. Here is a small sample of our results. $bullet$ We connect discordant sets to recurrence in dynamical systems, and in this setting we exhibit an intimate analogy between discordant sets and nowhere dense sets having positive measure. $bullet$ We introduce a wide-ranging generalization of the squarefree numbers, producing many examples of discordant sets in $mathbb{Z}$, $mathbb{Z}^d$, and the Heisenberg group. We develop a unified method to compute densities of these discordant sets. $bullet$ We show that, for any countable abelian group $G$, any F{o}lner sequence $Phi$ in $G$, and any $c in (0, 1)$, there exists a discordant set $A subseteq G$ with $d_Phi(A) = c$. Here $d_Phi$ denotes density along $Phi$. Along the way, we draw from various corners of mathematics, including classical Ramsey theory, ergodic theory, number theory, and topological and symbolic dynamics.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75224450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Planar binary trees in scattering amplitudes 平面二叉树的散射振幅
arXiv: Combinatorics Pub Date : 2020-11-29 DOI: 10.4171/205-1/6
Carlos R. Mafra
{"title":"Planar binary trees in scattering amplitudes","authors":"Carlos R. Mafra","doi":"10.4171/205-1/6","DOIUrl":"https://doi.org/10.4171/205-1/6","url":null,"abstract":"These notes are a written version of my talk given at the CARMA workshop in June 2017, with some additional material. I presented a few concepts that have recently been used in the computation of tree-level scattering amplitudes (mostly using pure spinor methods but not restricted to it) in a context that could be of interest to the combinatorics community. In particular, I focused on the appearance of {it planar binary trees} in scattering amplitudes and presented some curious identities obeyed by related objects, some of which are known to be true only via explicit examples.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88900918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
An orthodontia formula for Grothendieck polynomials Grothendieck多项式的正畸公式
arXiv: Combinatorics Pub Date : 2020-11-27 DOI: 10.1090/tran/8529
Karola M'esz'aros, Linus Setiabrata, Avery St. Dizier
{"title":"An orthodontia formula for Grothendieck polynomials","authors":"Karola M'esz'aros, Linus Setiabrata, Avery St. Dizier","doi":"10.1090/tran/8529","DOIUrl":"https://doi.org/10.1090/tran/8529","url":null,"abstract":"We give a new operator formula for Grothendieck polynomials that generalizes Magyar's Demazure operator formula for Schubert polynomials. Unlike the usual recursive definition of Grothendieck polynomials, the new formula is ascending in degree. Our proofs are purely combinatorial, contrasting with the geometric and representation theoretic tools used by Magyar for his operator formula for Schubert polynomials. Additionally, our approach yields a new proof of Magyar's formula.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85766205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Set-valued domino tableaux and shifted set-valued domino tableaux 集值多米诺骨牌表和移位集值多米诺骨牌表
arXiv: Combinatorics Pub Date : 2020-11-25 DOI: 10.2140/involve.2020.13.721
Florence Maas-Gari'epy, Rebecca Patrias
{"title":"Set-valued domino tableaux and shifted set-valued domino tableaux","authors":"Florence Maas-Gari'epy, Rebecca Patrias","doi":"10.2140/involve.2020.13.721","DOIUrl":"https://doi.org/10.2140/involve.2020.13.721","url":null,"abstract":"We prove K-theoretic and shifted K-theoretic analogues of the bijection of Stanton and White between domino tableaux and pairs of semistandard tableaux. As a result, we obtain product formulas for pairs of stable Grothendieck polynomials and pairs of K-theoretic Q-Schur functions.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73810138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Simplicial homeomorphs and trace-bounded hypergraphs 单纯同纯与迹有界超图
arXiv: Combinatorics Pub Date : 2020-11-16 DOI: 10.19086/da.36647
J. Long, Bhargav P. Narayanan, Corrine Yap
{"title":"Simplicial homeomorphs and trace-bounded hypergraphs","authors":"J. Long, Bhargav P. Narayanan, Corrine Yap","doi":"10.19086/da.36647","DOIUrl":"https://doi.org/10.19086/da.36647","url":null,"abstract":"Our first main result is a uniform bound, in every dimension $k in mathbb N$, on the topological Turan numbers of $k$-dimensional simplicial complexes: for each $k in mathbb N$, there is a $lambda_k ge k^{-2k^2}$ such that for any $k$-complex $mathcal{S}$, every $k$-complex on $n ge n_0(mathcal{S})$ vertices with at least $n^{k+1 - lambda_k}$ facets contains a homeomorphic copy of $mathcal{S}$. This was previously known only in dimensions one and two, both by highly dimension-specific arguments: the existence of $lambda_1$ is a result of Mader from 1967, and the existence of $lambda_2$ was suggested by Linial in 2006 and recently proved by Keevash-Long-Narayanan-Scott. We deduce this geometric fact from a purely combinatorial result about trace-bounded hypergraphs, where an $r$-partite $r$-graph $H$ with partite classes $V_1, V_2, dots, V_r$ is said to be $d$-trace-bounded if for each $2 le i le r$, all the vertices of $V_i$ have degree at most $d$ in the trace of $H$ on $V_1 cup V_2 cup dots cup V_i$. Our second main result is the following estimate for the Turan numbers of degenerate trace-bounded hypergraphs: for all $r ge 2$ and $dinmathbb N$, there is an $alpha_{r,d} ge (5rd)^{1-r}$ such that for any $d$-trace-bounded $r$-partite $r$-graph $H$, every $r$-graph on $n ge n_0(H)$ vertices with at least $n^{r - alpha_{r,d}}$ edges contains a copy of $H$. This strengthens a result of Conlon-Fox-Sudakov from 2009 who showed that such a bound holds for $r$-partite $r$-graphs $H$ satisfying the stronger hypothesis that the vertex-degrees in all but one of its partite classes are bounded (in $H$, as opposed to in its traces).","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77040018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
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学术官方微信