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

Discrete Mathematics and Theoretical Computer Science最新文献

筛选
英文 中文
Links in the complex of weakly separated collections 弱分离集合复合体中的链接
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2014-05-20 DOI: 10.4310/JOC.2017.V8.N4.A2
Suho Oh, David E. Speyer
{"title":"Links in the complex of weakly separated collections","authors":"Suho Oh, David E. Speyer","doi":"10.4310/JOC.2017.V8.N4.A2","DOIUrl":"https://doi.org/10.4310/JOC.2017.V8.N4.A2","url":null,"abstract":"International audience\u0000 \u0000 Plabic graphs are combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by k-element sets of positive integers, and a collection of such k-element sets are the face labels of a plabic graph if that collection forms a maximal weakly separated collection. There are moves that one can apply to plabic graphs, and thus to maximal weakly separated collections, analogous to mutations of seeds in cluster algebras. In this short note, we show if two maximal weakly separated collections can be mutated from one to another, then one can do so while freezing the face labels they have in common. In particular, this provides a new, and we think simpler, proof of Postnikov's result that any two reduced plabic graphs with the same decorated permutations can be mutated to each other.\u0000","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"166 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2014-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70474378","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}
引用次数: 13
EL-labelings and canonical spanning trees for subword complexes 子词复合体的el标记和规范生成树
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2012-10-04 DOI: 10.1007/978-3-319-00200-2_13
Vincent Pilaud, Christian Stump
{"title":"EL-labelings and canonical spanning trees for subword complexes","authors":"Vincent Pilaud, Christian Stump","doi":"10.1007/978-3-319-00200-2_13","DOIUrl":"https://doi.org/10.1007/978-3-319-00200-2_13","url":null,"abstract":"","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"20 3","pages":"213-248"},"PeriodicalIF":0.7,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51000093","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}
引用次数: 16
Generalized associahedra via brick polytopes 通过砖多面体的广义缔合面体
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2012-07-30 DOI: 10.15488/1671
Vincent Pilaud, Christian Stump
{"title":"Generalized associahedra via brick polytopes","authors":"Vincent Pilaud, Christian Stump","doi":"10.15488/1671","DOIUrl":"https://doi.org/10.15488/1671","url":null,"abstract":"We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspectives on these constructions. This new approach yields in particular the vertex description and a relevant Minkowski sum decomposition of generalized associahedra.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"73-84"},"PeriodicalIF":0.7,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67149041","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
Domination analysis for scheduling on non preemptive uniformly related machines 非抢占式统一相关机器调度的支配分析
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2012-01-01 DOI: 10.46298/DMTCS.2985
Idan Eisner, A. Vainshtein
{"title":"Domination analysis for scheduling on non preemptive uniformly related machines","authors":"Idan Eisner, A. Vainshtein","doi":"10.46298/DMTCS.2985","DOIUrl":"https://doi.org/10.46298/DMTCS.2985","url":null,"abstract":"Idan Eisner, Alek Vainshtein. Domination analysis for scheduling on non preemptive uniformly related machines. Broutin, Nicolas and Devroye, Luc. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’12), 2012, Montreal, Canada. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12), pp.81-82, 2012, DMTCS Proceedings.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"81-82"},"PeriodicalIF":0.7,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481004","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
Multi-cluster complexes 多集群复合物
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2012-01-01 DOI: 10.15488/1672
Cesar Ceballos, Jean-Philippe Labbé, Christian Stump
{"title":"Multi-cluster complexes","authors":"Cesar Ceballos, Jean-Philippe Labbé, Christian Stump","doi":"10.15488/1672","DOIUrl":"https://doi.org/10.15488/1672","url":null,"abstract":"We present a family of simplicial complexes called emphmulti-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types ${A}$ and ${B}$ to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among the set of almost positive roots in the cluster complex.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"1-8"},"PeriodicalIF":0.7,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67149102","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
Enumerating projective reflection groups 枚举投影反射组
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2011-01-19 DOI: 10.46298/DMTCS.2898
Riccardo Biagioli, Fabrizio Caselli
{"title":"Enumerating projective reflection groups","authors":"Riccardo Biagioli, Fabrizio Caselli","doi":"10.46298/DMTCS.2898","DOIUrl":"https://doi.org/10.46298/DMTCS.2898","url":null,"abstract":"Projective reflection groups have been recently defined by the second author. They include a special class of groups denoted G(r,p,s,n) which contains all classical Weyl groups and more generally all the complex reflection groups of type G(r,p,n). In this paper we define some statistics analogous to descent number and major index over the projective reflection groups G(r,p,s,n), and we compute several generating functions concerning these parameters. Some aspects of the representation theory of G(r,p,s,n), as distribution of one-dimensional characters and computation of Hilbert series of some invariant algebras, are also treated.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"147-158"},"PeriodicalIF":0.7,"publicationDate":"2011-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70480901","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
Bijections between noncrossing and nonnesting partitions for classical reflection groups 经典反射组的非交叉和非嵌套分区之间的双射
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2010-08-20 DOI: 10.4171/PM/1869
Alex Fink, Benjamin Iriarte Giraldo
{"title":"Bijections between noncrossing and nonnesting partitions for classical reflection groups","authors":"Alex Fink, Benjamin Iriarte Giraldo","doi":"10.4171/PM/1869","DOIUrl":"https://doi.org/10.4171/PM/1869","url":null,"abstract":"We present $textit{type preserving}$ bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types $B$, $C$ and $D$ are new in the literature. To find them we define, for every type, sets of statistics that are in bijection with noncrossing and nonnesting partitions, and this correspondence is established by means of elementary methods in all cases. The statistics can be then seen to be counted by the generalized Catalan numbers Cat$(W)$ when $W$ is a classical reflection group. In particular, the statistics of type $A$ appear as a new explicit example of objects that are counted by the classical Catalan numbers.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"397-410"},"PeriodicalIF":0.7,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4171/PM/1869","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70891795","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
Hyperplane Arrangements and Diagonal Harmonics 超平面排列与对角谐波
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2010-05-11 DOI: 10.46298/DMTCS.2889
D. Armstrong
{"title":"Hyperplane Arrangements and Diagonal Harmonics","authors":"D. Armstrong","doi":"10.46298/DMTCS.2889","DOIUrl":"https://doi.org/10.46298/DMTCS.2889","url":null,"abstract":"In 2003, Haglund's bounce statistic gave the first combinatorial interpretation of the q,t-Catalan numbers and the Hilbert series of diagonal harmonics. In this paper we propose a new combinatorial interpretation in terms of the affine Weyl group of type A. In particular, we define two statistics on affine permutations; one in terms of the Shi hyperplane arrangement, and one in terms of a new arrangement — which we call the Ish arrangement. We prove that our statistics are equivalent to the area' and bounce statistics of Haglund and Loehr. In this setting, we observe that bounce is naturally expressed as a statistic on the root lattice. We extend our statistics in two directions: to \"extended'' Shi arrangements and to the bounded chambers of these arrangements. This leads to a (conjectural) combinatorial interpretation for all integral powers of the Bergeron-Garsia nabla operator applied to elementary symmetric functions.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"39-50"},"PeriodicalIF":0.7,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70480847","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}
引用次数: 38
Generalized Ehrhart polynomials 广义Ehrhart多项式
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2010-02-19 DOI: 10.1090/S0002-9947-2011-05494-2
Sheng Chen, Nan Li, Steven V. Sam
{"title":"Generalized Ehrhart polynomials","authors":"Sheng Chen, Nan Li, Steven V. Sam","doi":"10.1090/S0002-9947-2011-05494-2","DOIUrl":"https://doi.org/10.1090/S0002-9947-2011-05494-2","url":null,"abstract":"Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of $P(n)$ to be arbitrary rational functions in $n$. In this case we prove that the number of lattice points in $P(n)$ is a quasi-polynomial for $n$ sufficiently large. Our work was motivated by a conjecture of Ehrhart on the number of solutions to parametrized linear Diophantine equations whose coefficients are polynomials in $n$, and we explain how these two problems are related.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":"239-246"},"PeriodicalIF":0.7,"publicationDate":"2010-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1090/S0002-9947-2011-05494-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"60960271","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}
引用次数: 20
Stochastic Analysis of the $k$-Server Problem on the Circle 圆上$k$-Server问题的随机分析
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 2010-01-01 DOI: 10.46298/DMTCS.2791
A. Anagnostopoulos, C. Dombry, N. Guillotin-Plantard, I. Kontoyiannis, E. Upfal
{"title":"Stochastic Analysis of the $k$-Server Problem on the Circle","authors":"A. Anagnostopoulos, C. Dombry, N. Guillotin-Plantard, I. Kontoyiannis, E. Upfal","doi":"10.46298/DMTCS.2791","DOIUrl":"https://doi.org/10.46298/DMTCS.2791","url":null,"abstract":"We consider a stochastic version of the $k$-server problem in which $k$ servers move on a circle to satisfy stochastically generated requests. The requests are independent and identically distributed according to an arbitrary distribution on a circle, which is either discrete or continuous. The cost of serving a request is the distance that a server needs to move to reach the request. The goal is to minimize the steady-state expected cost induced by the requests. We study the performance of a greedy strategy, focusing, in particular, on its convergence properties and the interplay between the discrete and continuous versions of the process.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481083","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
首页 上一页 下一页 尾页
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学术官方微信