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

Combinatorica最新文献

筛选
英文 中文
Boolean Function Analysis on High-Dimensional Expanders 高维扩展器上的布尔函数分析
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-03-18 DOI: 10.1007/s00493-024-00084-5
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
{"title":"Boolean Function Analysis on High-Dimensional Expanders","authors":"Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha","doi":"10.1007/s00493-024-00084-5","DOIUrl":"https://doi.org/10.1007/s00493-024-00084-5","url":null,"abstract":"<p>We initiate the study of Boolean function analysis on high-dimensional expanders. We give a random-walk based definition of high-dimensional expansion, which coincides with the earlier definition in terms of two-sided link expanders. Using this definition, we describe an analog of the Fourier expansion and the Fourier levels of the Boolean hypercube for simplicial complexes. Our analog is a decomposition into approximate eigenspaces of random walks associated with the simplicial complexes. Our random-walk definition and the decomposition have the additional advantage that they extend to the more general setting of posets, encompassing both high-dimensional expanders and the Grassmann poset, which appears in recent work on the unique games conjecture. We then use this decomposition to extend the Friedgut–Kalai–Naor theorem to high-dimensional expanders. Our results demonstrate that a constant-degree high-dimensional expander can sometimes serve as a sparse model for the Boolean slice or hypercube, and quite possibly additional results from Boolean function analysis can be carried over to this sparse model. Therefore, this model can be viewed as a derandomization of the Boolean slice, containing only <span>(|X(k-1)|=O(n))</span> points in contrast to <span>(left( {begin{array}{c}n kend{array}}right) )</span> points in the (<i>k</i>)-slice (which consists of all <i>n</i>-bit strings with exactly <i>k</i> ones).</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"25 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140161892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs 图和超图中单调路径的拉姆齐问题
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-02-28 DOI: 10.1007/s00493-024-00082-7
Lior Gishboliner, Zhihan Jin, Benny Sudakov
{"title":"Ramsey Problems for Monotone Paths in Graphs and Hypergraphs","authors":"Lior Gishboliner, Zhihan Jin, Benny Sudakov","doi":"10.1007/s00493-024-00082-7","DOIUrl":"https://doi.org/10.1007/s00493-024-00082-7","url":null,"abstract":"<p>The study of ordered Ramsey numbers of monotone paths for graphs and hypergraphs has a long history, going back to the celebrated work by Erdős and Szekeres in the early days of Ramsey theory. In this paper we obtain several results in this area, establishing two conjectures of Mubayi and Suk and improving bounds due to Balko, Cibulka, Král and Kynčl. For example, in the graph case, we show that the ordered Ramsey number for a fixed clique versus a fixed power of a monotone path of length <i>n</i> is always linear in <i>n</i>. Also, in the 3-graph case, we show that the ordered Ramsey number for a fixed clique versus a tight monotone path of length <i>n</i> is always polynomial in <i>n</i>. As a by-product, we also obtain a color-monotone version of the well-known Canonical Ramsey Theorem of Erdős and Rado, which could be of independent interest.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"6 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139994049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Ungar Games 温加尔游戏
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-02-21 DOI: 10.1007/s00493-024-00083-6
Colin Defant, Noah Kravitz, Nathan Williams
{"title":"The Ungar Games","authors":"Colin Defant, Noah Kravitz, Nathan Williams","doi":"10.1007/s00493-024-00083-6","DOIUrl":"https://doi.org/10.1007/s00493-024-00083-6","url":null,"abstract":"<p>Let <i>L</i> be a finite lattice. Inspired by Ungar’s solution to the famous <i>slopes problem</i>, we define an <i>Ungar move</i> to be an operation that sends an element <span>(xin L)</span> to the meet of <span>({x}cup T)</span>, where <i>T</i> is a subset of the set of elements covered by <i>x</i>. We introduce the following <i>Ungar game</i>. Starting at the top element of <i>L</i>, two players—Atniss and Eeta—take turns making nontrivial Ungar moves; the first player who cannot do so loses the game. Atniss plays first. We say <i>L</i> is an <i>Atniss win</i> (respectively, <i>Eeta win</i>) if Atniss (respectively, Eeta) has a winning strategy in the Ungar game on <i>L</i>. We first prove that the number of principal order ideals in the weak order on <span>(S_n)</span> that are Eeta wins is <span>(O(0.95586^nn!))</span>. We then consider a broad class of intervals in Young’s lattice that includes all principal order ideals, and we characterize the Eeta wins in this class; we deduce precise enumerative results concerning order ideals in rectangles and type-<i>A</i> root posets. We also characterize and enumerate principal order ideals in Tamari lattices that are Eeta wins. Finally, we conclude with some open problems and a short discussion of the computational complexity of Ungar games.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"212 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139938779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Defective Coloring is Perfect for Minors 瑕疵着色非常适合未成年人
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-02-21 DOI: 10.1007/s00493-024-00081-8
Chun-Hung Liu
{"title":"Defective Coloring is Perfect for Minors","authors":"Chun-Hung Liu","doi":"10.1007/s00493-024-00081-8","DOIUrl":"https://doi.org/10.1007/s00493-024-00081-8","url":null,"abstract":"<p>The defective chromatic number of a graph class is the infimum <i>k</i> such that there exists an integer <i>d</i> such that every graph in this class can be partitioned into at most <i>k</i> induced subgraphs with maximum degree at most <i>d</i>. Finding the defective chromatic number is a fundamental graph partitioning problem and received attention recently partially due to Hadwiger’s conjecture about coloring minor-closed families. In this paper, we prove that the defective chromatic number of any minor-closed family equals the simple lower bound obtained by the standard construction, confirming a conjecture of Ossona de Mendez, Oum, and Wood. This result provides the optimal list of unavoidable finite minors for infinite graphs that cannot be partitioned into a fixed finite number of induced subgraphs with uniformly bounded maximum degree. As corollaries about clustered coloring, we obtain a linear relation between the clustered chromatic number of any minor-closed family and the tree-depth of its forbidden minors, improving an earlier exponential bound proved by Norin, Scott, Seymour, and Wood and confirming the planar case of their conjecture.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"244 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139938771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Upper Bound for the Height of a Tree with a Given Eigenvalue 给定特征值的树高上限
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-02-02 DOI: 10.1007/s00493-023-00071-2
Artūras Dubickas
{"title":"An Upper Bound for the Height of a Tree with a Given Eigenvalue","authors":"Artūras Dubickas","doi":"10.1007/s00493-023-00071-2","DOIUrl":"https://doi.org/10.1007/s00493-023-00071-2","url":null,"abstract":"<p>In this paper we prove that every totally real algebraic integer <span>(lambda )</span> of degree <span>(d ge 2)</span> occurs as an eigenvalue of some tree of height at most <span>(d(d+1)/2+3)</span>. In order to prove this, for a given algebraic number <span>(alpha ne 0)</span>, we investigate an additive semigroup that contains zero and is closed under the map <span>(x mapsto alpha /(1-x))</span> for <span>(x ne 1)</span>. The problem of finding the smallest such semigroup seems to be of independent interest.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"26 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139660300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Generating Rank and Embedding Rank of the Hexagonic Lie Incidence Geometries 论六方列入射几何的生成秩和嵌入秩
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-01-05 DOI: 10.1007/s00493-023-00075-y
{"title":"On the Generating Rank and Embedding Rank of the Hexagonic Lie Incidence Geometries","authors":"","doi":"10.1007/s00493-023-00075-y","DOIUrl":"https://doi.org/10.1007/s00493-023-00075-y","url":null,"abstract":"<h3>Abstract</h3> <p>Given a (thick) irreducible spherical building <span> <span>(Omega )</span> </span>, we establish a bound on the difference between the generating rank and the embedding rank of its long root geometry and the dimension of the corresponding Weyl module, by showing that this difference does not grow when taking certain residues of <span> <span>(Omega )</span> </span> (in particular the residue of a vertex corresponding to a point of the long root geometry, but also other types of vertices occur). We apply this to the finite case to obtain new results on the generating rank of mainly the exceptional long root geometries, answering an open question by Cooperstein about the generating ranks of the exceptional long root subgroup geometries. We completely settle the finite case for long root geometries of type <span> <span>({{textsf{A}}}_n)</span> </span>, and the case of type <span> <span>(mathsf {F_{4,4}})</span> </span> over any field with characteristic distinct from 2 (which is not a long root subgroup geometry, but a hexagonic geometry).</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"101 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139110255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Euler’s Theorem for Regular CW-Complexes 正规 CW 复数的欧拉定理
IF 1.1 2区 数学
Combinatorica Pub Date : 2024-01-05 DOI: 10.1007/s00493-023-00080-1
Richard H. Hammack, Paul C. Kainen
{"title":"Euler’s Theorem for Regular CW-Complexes","authors":"Richard H. Hammack, Paul C. Kainen","doi":"10.1007/s00493-023-00080-1","DOIUrl":"https://doi.org/10.1007/s00493-023-00080-1","url":null,"abstract":"<p>For strongly connected, pure <i>n</i>-dimensional regular CW-complexes, we show that <i>evenness</i> (each <span>((n{-}1))</span>-cell is contained in an even number of <i>n</i>-cells) is equivalent to generalizations of both cycle decomposition and traversability.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"48 9 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139110246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path 用路径宽度和最长路径严格约束树丛深度
IF 1.1 2区 数学
Combinatorica Pub Date : 2023-12-19 DOI: 10.1007/s00493-023-00077-w
{"title":"Tight Bound on Treedepth in Terms of Pathwidth and Longest Path","authors":"","doi":"10.1007/s00493-023-00077-w","DOIUrl":"https://doi.org/10.1007/s00493-023-00077-w","url":null,"abstract":"<h3>Abstract</h3> <p>We show that every graph with pathwidth strictly less than <em>a</em> that contains no path on <span> <span>(2^b)</span> </span> vertices as a subgraph has treedepth at most 10<em>ab</em>. The bound is best possible up to a constant factor.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"34 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138740534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs 正则图中的边连接性和成对不相交完全匹配
IF 1.1 2区 数学
Combinatorica Pub Date : 2023-12-19 DOI: 10.1007/s00493-023-00078-9
Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf
{"title":"Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs","authors":"Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf","doi":"10.1007/s00493-023-00078-9","DOIUrl":"https://doi.org/10.1007/s00493-023-00078-9","url":null,"abstract":"<p>For <span>(0 le t le r)</span> let <i>m</i>(<i>t</i>, <i>r</i>) be the maximum number <i>s</i> such that every <i>t</i>-edge-connected <i>r</i>-graph has <i>s</i> pairwise disjoint perfect matchings. There are only a few values of <i>m</i>(<i>t</i>, <i>r</i>) known, for instance <span>(m(3,3)=m(4,r)=1)</span>, and <span>(m(t,r) le r-2)</span> for all <span>(t not = 5)</span>, and <span>(m(t,r) le r-3)</span> if <i>r</i> is even. We prove that <span>(m(2l,r) le 3l - 6)</span> for every <span>(l ge 3)</span> and <span>(r ge 2 l)</span>.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"38 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138740588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces 赫德涅米等价空间猜想的拓扑版本
IF 1.1 2区 数学
Combinatorica Pub Date : 2023-12-19 DOI: 10.1007/s00493-023-00079-8
Vuong Bui, Hamid Reza Daneshpajouh
{"title":"A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces","authors":"Vuong Bui, Hamid Reza Daneshpajouh","doi":"10.1007/s00493-023-00079-8","DOIUrl":"https://doi.org/10.1007/s00493-023-00079-8","url":null,"abstract":"<p>A topological version of the famous Hedetniemi conjecture says: The mapping index of the Cartesian product of two <span>({mathbb {Z}}/2)</span>- spaces is equal to the minimum of their <span>({mathbb {Z}}/2)</span>-indexes. The main purpose of this article is to study the topological version of the Hedetniemi conjecture for <i>G</i>-spaces. Indeed, we show that the topological Hedetniemi conjecture cannot be valid for general pairs of <i>G</i>-spaces. More precisely, we show that this conjecture can possibly survive if the group <i>G</i> is either a cyclic <i>p</i>-group or a generalized quaternion group whose size is a power of 2.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"16 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138740501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"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学术官方微信