Search arXivSearch

arXiv · 2002.03919

On additive bases in infinite abelian semigroups

Abstract

Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of essential subsets of any additive basis is finite, and also that the number of essential subsets of cardinality $k$ contained in an additive basis of order at most $h$ can be bounded in terms of $h$ and $k$ alone. These results extend the reach of two theorems, one due to Deschamps and Farhi and the other to Hegarty, bearing upon $\mathbf{N}$. Also, using invariant means, we address a classical problem, initiated by Erdős and Graham and then generalized by Nash and Nathanson both in the case of $\mathbf{N}$, of estimating the maximal order $X_T(h,k)$ that a basis of cocardinality $k$ contained in an additive basis of order at most $h$ can have. Among other results, we prove that $X_T(h,k)=O(h^{2k+1})$ for every integer $k \ge 1$. This result is new even in the case where $k=1$. Besides the maximal order $X_T(h,k)$, the typical order $S_T(h,k)$ is also studied. Our methods actually apply to a wider class of infinite abelian semigroups, thus unifying in a single axiomatic frame the theory of additive bases in $\mathbf{N}$ and in abelian groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pierre-Yves Bienvenu, Benjamin Girard, Thái Hoàng Lê. 2024-12-20. On additive bases in infinite abelian semigroups. https://doi.org/10.4171/jca%2F67

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO