惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
I
InfoQ
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 【当耐特】
小众软件
小众软件
B
Blog RSS Feed
大猫的无限游戏
大猫的无限游戏
博客园 - 三生石上(FineUI控件)
Engineering at Meta
Engineering at Meta
人人都是产品经理
人人都是产品经理
Microsoft Security Blog
Microsoft Security Blog
Last Week in AI
Last Week in AI
H
Help Net Security
爱范儿
爱范儿
云风的 BLOG
云风的 BLOG
博客园 - 司徒正美
Y
Y Combinator Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Azure Blog
Microsoft Azure Blog
L
LangChain Blog
WordPress大学
WordPress大学
GbyAI
GbyAI
Google DeepMind News
Google DeepMind News
腾讯CDC

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Uniqueness in Harper's vertex-isoperimetric theorem
Eero Raty · 2018-06-29 · via math.CO updates on arXiv.org

For a set $A\subseteq Q_{n}=\left\{ 0,1\right\} ^{n}$ the $t$-neighbourhood of $A$ is $N^{t}\left(A\right)=\left\{ x\,:\,d\left(x,A\right)\leq t\right\}$, where $d$ denotes the usual graph distance on $Q_{n}$. Harper's vertex-isoperimetric theorem states that among the subsets $A\subseteq Q_{n}$ of given size, the size of the $t$-neighbourhood is minimised when $A$ is taken to be an initial segment of the simplicial order. Aubrun and Szarek asked the following question: if $A\subseteq Q_{n}$ is a subset of given size for which the sizes of both $N^{t}\left(A\right)$ and $N^{t}\left(A^{c}\right)$ are minimal for all $t>0$, does it follow that $A$ is isomorphic to an initial segment of the simplicial order? Our aim is to give a counterexample. Surprisingly it turns out that there is no counterexample that is a Hamming ball, meaning a set that lies between two consecutive exact Hamming balls, i.e.\ a set $A$ with $B\left(x,r\right)\subseteq A\subseteq B\left(x,r+1\right)$ for some $x\in Q_{n}$. We go further to classify all the sets $A\subseteq Q_{n}$ for which the sizes of both $N^{t}\left(A\right)$ and $N^{t}\left(A^{c}\right)$ are minimal for all $t>0$ among the subsets of $Q_{n}$ of given size. We also prove that, perhaps surprisingly, if $A\subseteq Q_{n}$ for which the sizes of $N\left(A\right)$ and $N\left(A^{c}\right)$ are minimal among the subsets of $Q_{n}$ of given size, then the sizes of both $N^{t}\left(A\right)$ and $N^{t}\left(A^{c}\right)$ are also minimal for all $t>0$ among the subsets of $Q_{n}$ of given size. Hence the same classification also holds when we only require $N\left(A\right)$ and $N\left(A^{c}\right)$ to have minimal size among the subsets $A\subseteq Q_{n}$ of given size.