切片上低次布尔函数的军政府阈值

IF 0.7 4区数学 Q2 MATHEMATICS Electronic Journal of Combinatorics Pub Date : 2023-03-24 DOI:10.37236/11115

Yuval Filmus

{"title":"切片上低次布尔函数的军政府阈值","authors":"Yuval Filmus","doi":"10.37236/11115","DOIUrl":null,"url":null,"abstract":"We show that a Boolean degree~$d$ function on the slice $\\binom{[n]}{k}$ is a junta if $k \\geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree~$d$ functions for arbitrary finite $A$, and for functions on an infinite analog of the slice.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"301 1","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Junta Threshold for Low Degree Boolean Functions on the Slice\",\"authors\":\"Yuval Filmus\",\"doi\":\"10.37236/11115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that a Boolean degree~$d$ function on the slice $\\\\binom{[n]}{k}$ is a junta if $k \\\\geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree~$d$ functions for arbitrary finite $A$, and for functions on an infinite analog of the slice.\",\"PeriodicalId\":11515,\"journal\":{\"name\":\"Electronic Journal of Combinatorics\",\"volume\":\"301 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37236/11115\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37236/11115","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们证明了切片$\binom{[n]}{k}$上的布尔度$d$函数是$k \geq 2d$的一个军政府，并且这个界是尖锐的。我们证明了对于任意有限$A$的$A$值度$d$函数和无限类似的切片上的函数的类似结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Junta Threshold for Low Degree Boolean Functions on the Slice

We show that a Boolean degree~$d$ function on the slice $\binom{[n]}{k}$ is a junta if $k \geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree~$d$ functions for arbitrary finite $A$, and for functions on an infinite analog of the slice.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Journal of Combinatorics 数学-数学

CiteScore

1.30

自引率

14.30%

发文量

212

审稿时长

3-6 weeks

期刊介绍： The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.

期刊最新文献

Three New Refined Arnold Families On Sequences Without Short Zero-Sum Subsequences Weak Degeneracy of Planar Graphs and Locally Planar Graphs Generalized Heawood Numbers The Degree and Codegree Threshold for Linear Triangle Covering in 3-Graphs