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

Annals of Combinatorics最新文献

筛选
英文 中文
Orientable Vertex Primitive Complete Maps 可定向顶点原始完整映射
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2024-10-07 DOI: 10.1007/s00026-024-00721-2
Xue Yu, Cai Heng Li, Ben Gong Lou
{"title":"Orientable Vertex Primitive Complete Maps","authors":"Xue Yu,&nbsp;Cai Heng Li,&nbsp;Ben Gong Lou","doi":"10.1007/s00026-024-00721-2","DOIUrl":"10.1007/s00026-024-00721-2","url":null,"abstract":"<div><p>An orientable vertex primitive complete map is a two-cell embedding of a complete graph into an orientable surface such that the automorphism group of this map acts primitively on its vertex set. The paper is devoted to the problem of enumerating orientable vertex primitive complete maps. For a given integer <i>n</i>, we derive the number of different such maps with <i>n</i> vertices. Furthermore, we obtain explicit formulas for the numbers of non-isomorphic orientable vertex primitive complete maps with <i>n</i> vertices.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 4","pages":"1127 - 1139"},"PeriodicalIF":0.6,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672350","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
Publisher Correction to: An Asymptotic Lower Bound on the Number of Polyominoes 出版者对：多面体数量的渐近下限
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2024-09-17 DOI: 10.1007/s00026-024-00710-5
Vuong Bui
{"title":"Publisher Correction to: An Asymptotic Lower Bound on the Number of Polyominoes","authors":"Vuong Bui","doi":"10.1007/s00026-024-00710-5","DOIUrl":"10.1007/s00026-024-00710-5","url":null,"abstract":"","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 4","pages":"1363 - 1363"},"PeriodicalIF":0.6,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672352","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
Efficient Representation of Lattice Path Matroids 高效表示网格路径矩阵
IF 0.5 4区 数学
Annals of Combinatorics Pub Date : 2024-08-29 DOI: 10.1007/s00026-024-00716-z
Carles Padró
{"title":"Efficient Representation of Lattice Path Matroids","authors":"Carles Padró","doi":"10.1007/s00026-024-00716-z","DOIUrl":"https://doi.org/10.1007/s00026-024-00716-z","url":null,"abstract":"<p>Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of hierarchical matroid ports, and the existence of isolating weight functions for lattice path matroids whose values are polynomial on the size of the ground set.</p>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"24 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203277","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
Partitions with Fixed Points in the Sequence of First-Column Hook Lengths 第一列钩码长度序列中具有固定点的分区
IF 0.5 4区 数学
Annals of Combinatorics Pub Date : 2024-08-09 DOI: 10.1007/s00026-024-00714-1
Philip Cuthbertson, David J. Hemmer, Brian Hopkins, William J. Keith
{"title":"Partitions with Fixed Points in the Sequence of First-Column Hook Lengths","authors":"Philip Cuthbertson, David J. Hemmer, Brian Hopkins, William J. Keith","doi":"10.1007/s00026-024-00714-1","DOIUrl":"https://doi.org/10.1007/s00026-024-00714-1","url":null,"abstract":"<p>Recently, Blecher and Knopfmacher applied the notion of fixed points to integer partitions. This has already been generalized and refined in various ways such as <i>h</i>-fixed points for an integer parameter <i>h</i> by Hopkins and Sellers. Here, we consider the sequence of first column hook lengths in the Young diagram of a partition and corresponding <i>fixed hooks</i>. We enumerate these, using both generating function and combinatorial proofs, and find that they match occurrences of part sizes equal to their multiplicity. We establish connections to work of Andrews and Merca on truncations of the pentagonal number theorem and classes of partitions partially characterized by certain minimal excluded parts (mex).</p>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"12 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141940741","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
Acyclic Reorientation Lattices and Their Lattice Quotients 无环重定向点阵及其点阵之商
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2024-08-09 DOI: 10.1007/s00026-024-00697-z
Vincent Pilaud
{"title":"Acyclic Reorientation Lattices and Their Lattice Quotients","authors":"Vincent Pilaud","doi":"10.1007/s00026-024-00697-z","DOIUrl":"10.1007/s00026-024-00697-z","url":null,"abstract":"<div><p>We prove that the acyclic reorientation poset of a directed acyclic graph <i>D</i> is a lattice if and only if the transitive reduction of any induced subgraph of <i>D</i> is a forest. We then show that the acyclic reorientation lattice is always congruence normal, semidistributive (thus congruence uniform) if and only if <i>D</i> is filled, and distributive if and only if <i>D</i> is a forest. When the acyclic reorientation lattice is semidistributive, we introduce the ropes of <i>D</i> that encode the join irreducible acyclic reorientations and exploit this combinatorial model in three directions. First, we describe the canonical join and meet representations of acyclic reorientations in terms of non-crossing rope diagrams. Second, we describe the congruences of the acyclic reorientation lattice in terms of lower ideals of a natural subrope order. Third, we use Minkowski sums of shard polytopes of ropes to construct a quotientope for any congruence of the acyclic reorientation lattice.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 4","pages":"1035 - 1092"},"PeriodicalIF":0.6,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-024-00697-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141940742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Support of Grothendieck Polynomials 论格罗内迪克多项式的支持度
IF 0.5 4区 数学
Annals of Combinatorics Pub Date : 2024-08-08 DOI: 10.1007/s00026-024-00712-3
Karola Mészáros, Linus Setiabrata, Avery St. Dizier
{"title":"On the Support of Grothendieck Polynomials","authors":"Karola Mészáros, Linus Setiabrata, Avery St. Dizier","doi":"10.1007/s00026-024-00712-3","DOIUrl":"https://doi.org/10.1007/s00026-024-00712-3","url":null,"abstract":"<p>Grothendieck polynomials <span>(mathfrak {G}_w)</span> of permutations <span>(win S_n)</span> were introduced by Lascoux and Schützenberger (C R Acad Sci Paris Sér I Math 295(11):629–633, 1982) as a set of distinguished representatives for the K-theoretic classes of Schubert cycles in the K-theory of the flag variety of <span>(mathbb {C}^n)</span>. We conjecture that the exponents of nonzero terms of the Grothendieck polynomial <span>(mathfrak {G}_w)</span> form a poset under componentwise comparison that is isomorphic to an induced subposet of <span>(mathbb {Z}^n)</span>. When <span>(win S_n)</span> avoids a certain set of patterns, we conjecturally connect the coefficients of <span>(mathfrak {G}_w)</span> with the Möbius function values of the aforementioned poset with <span>(hat{0})</span> appended. We prove special cases of our conjectures for Grassmannian and fireworks permutations</p>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"57 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141940740","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
Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence 渐近均匀生成给定度序列有向图的序列存根匹配
IF 0.5 4区 数学
Annals of Combinatorics Pub Date : 2024-08-07 DOI: 10.1007/s00026-024-00715-0
Femke van Ieperen, Ivan Kryven
{"title":"Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence","authors":"Femke van Ieperen, Ivan Kryven","doi":"10.1007/s00026-024-00715-0","DOIUrl":"https://doi.org/10.1007/s00026-024-00715-0","url":null,"abstract":"<p>We discuss sequential stub matching for directed graphs and show that this process can be used to sample simple digraphs with asymptotically equal probability. The process starts with an empty edge set and repeatedly adds edges to it with a certain state-dependent bias until the desired degree sequence is fulfilled, whilst avoiding placing a double edge or self-loop. We show that uniform sampling is achieved in the sparse regime when the maximum degree <span>(d_text {max})</span> is asymptotically dominated by <span>(m^{1/4})</span>, where <i>m</i> is the number of edges. The proof is based on deriving various combinatorial estimates related to the number of digraphs with a given degree sequence and controlling concentration of these estimates in large digraphs. This suggests that sequential stub matching can be viewed as a practical algorithm for almost uniform sampling of digraphs. We show that this algorithm can be implemented to feature a linear expected runtime <i>O</i>(<i>m</i>).</p>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"23 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141940743","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
On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers 论可嵌入超立方体一层的图及其极值数
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2024-07-29 DOI: 10.1007/s00026-024-00705-2
Maria Axenovich, Ryan R. Martin, Christian Winter
{"title":"On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers","authors":"Maria Axenovich,&nbsp;Ryan R. Martin,&nbsp;Christian Winter","doi":"10.1007/s00026-024-00705-2","DOIUrl":"10.1007/s00026-024-00705-2","url":null,"abstract":"<div><p>A graph is cubical if it is a subgraph of a hypercube. For a cubical graph <i>H</i> and a hypercube <span>(Q_n)</span>, <span>(textrm{ex}(Q_n, H))</span> is the largest number of edges in an <i>H</i>-free subgraph of <span>(Q_n)</span>. If <span>(textrm{ex}(Q_n, H))</span> is at least a positive proportion of the number of edges in <span>(Q_n)</span>, then <i>H</i> is said to have positive Turán density in the hypercube; otherwise it has zero Turán density. Determining <span>(textrm{ex}(Q_n, H))</span> and even identifying whether <i>H</i> has positive or zero Turán density remains a widely open question for general <i>H</i>. In this paper we focus on layered graphs, i.e., graphs that are contained in an edge layer of some hypercube. Graphs <i>H</i> that are not layered have positive Turán density because one can form an <i>H</i>-free subgraph of <span>(Q_n)</span> consisting of edges of every other layer. For example, a 4-cycle is not layered and has positive Turán density. However, in general, it is not obvious what properties layered graphs have. We give a characterization of layered graphs in terms of edge-colorings. We show that most non-trivial subdivisions have zero Turán density, extending known results on zero Turán density of even cycles of length at least 12 and of length 8. However, we prove that there are cubical graphs of girth 8 that are not layered and thus having positive Turán density. The cycle of length 10 remains the only cycle for which it is not known whether its Turán density is positive or not. We prove that <span>(textrm{ex}(Q_n, C_{10})= Omega (n2^n/ log ^a n))</span>, for a constant <i>a</i>, showing that the extremal number for a 10-cycle behaves differently from any other cycle of zero Turán density.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 4","pages":"1257 - 1283"},"PeriodicalIF":0.6,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-024-00705-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141873456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Likely Maximum Size of Twin Subtrees in a Large Random Tree 大型随机树中双子树可能的最大尺寸
IF 0.5 4区 数学
Annals of Combinatorics Pub Date : 2024-07-27 DOI: 10.1007/s00026-024-00711-4
Miklós Bóna, Ovidiu Costin, Boris Pittel
{"title":"The Likely Maximum Size of Twin Subtrees in a Large Random Tree","authors":"Miklós Bóna, Ovidiu Costin, Boris Pittel","doi":"10.1007/s00026-024-00711-4","DOIUrl":"https://doi.org/10.1007/s00026-024-00711-4","url":null,"abstract":"<p>We call a pair of vertex-disjoint, induced subtrees of a rooted tree twins if they have the same counts of vertices by out-degrees. The likely maximum size of twins in a uniformly random, rooted Cayley tree of size <span>(nrightarrow infty )</span> is studied. It is shown that the expected number of twins of size <span>((2+delta )sqrt{log ncdot log log n})</span> approaches zero, while the expected number of twins of size <span>((2-delta )sqrt{log ncdot log log n})</span> approaches infinity.</p>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"62 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771052","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
Symmetry Parameters of Two-Generator Circulant Graphs 双发电机圆周图的对称参数
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2024-07-26 DOI: 10.1007/s00026-024-00709-y
Sally Cockburn, Sarah Loeb
{"title":"Symmetry Parameters of Two-Generator Circulant Graphs","authors":"Sally Cockburn,&nbsp;Sarah Loeb","doi":"10.1007/s00026-024-00709-y","DOIUrl":"10.1007/s00026-024-00709-y","url":null,"abstract":"<div><p>The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give their determining and distinguishing number, and when relevant, their cost of 2-distinguishing. We do the same for the subdivisions of connected, two-generator circulant graphs obtained by replacing one loop in the voltage graph with a directed cycle.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 4","pages":"1093 - 1117"},"PeriodicalIF":0.6,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141771034","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
下一页 尾页
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学术官方微信