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

推荐订阅源

Jina AI
Jina AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
B
Blog
T
The Blog of Author Tim Ferriss
量子位
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - Franky
小众软件
小众软件
Recent Announcements
Recent Announcements
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
I
InfoQ
美团技术团队
G
Google Developers Blog
Engineering at Meta
Engineering at Meta
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
Visual Studio Blog
云风的 BLOG
云风的 BLOG
博客园 - 【当耐特】
IT之家
IT之家
Microsoft Security Blog
Microsoft Security Blog
博客园 - 聂微东
Last Week in AI
Last Week in AI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
H
Help Net Security

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}}$
On the density of sumsets
Paolo Leonetti, Salvatore Tringali · 2020-01-28 · via math.CO updates on arXiv.org

Recently introduced by the authors in [Proc. Edinb. Math. Soc. 60 (2020), 139-167], quasi-densities form a large family of real-valued functions partially defined on the power set of the integers that serve as a unifying framework for the study of many known densities (including the asymptotic density, the Banach density, the logarithmic density, the analytic density, and the Pólya density). We further contribute to this line of research by proving that (i) for each $n \in \mathbf N^+$ and $α\in [0,1]$, there is $A \subseteq \mathbf{N}$ with $kA \in \text{dom}(μ)$ and $μ(kA) = αk/n$ for every quasi-density $μ$ and every $k=1,\ldots, n$, where $kA:=A+\cdots+A$ is the $k$-fold sumset of $A$ and $\text{dom}(μ)$ denotes the domain of definition of $μ$; (ii) for each $α\in [0,1]$ and every non-empty finite $B\subseteq \mathbf{N}$, there is $A \subseteq \mathbf{N}$ with $A+B \in \mathrm{dom}(μ)$ and $μ(A+B)=α$ for every quasi-density $μ$; (iii) for each $α\in [0,1]$, there exists $A\subseteq \mathbf{N}$ with $2A = \mathbf{N}$ such that $A \in \text{dom}(μ)$ and $μ(A) = α$ for every quasi-density $μ$. Proofs rely on the properties of a little known density first considered by R.C. Buck and the "structure" of the set of all quasi-densities; in particular, they are rather different than previously known proofs of special cases of the same results.