Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

On primality and atomicity of numerical power monoids (2412.05857v1)

Published 8 Dec 2024 in math.CO

Abstract: In the first part of this paper, we establish a variation of a recent result by Bienvenu and Geroldinger on the (almost) non-existence of absolute irreducibles in (restricted) power monoids of numerical monoids: we argue the (almost) non-existence of primal elements in the same class of power monoids. The second part of this paper, devoted to the study of the atomic density of $\mathcal{P}{\text{fin}, 0}(\mathbb{N}_0)$, is motivated by work of Shitov, a paper by Bienvenu and Geroldinger, and some questions pointed out by Geroldinger and Tringali. In the same, we study atomic density through the lens of the natural partition ${ \mathcal{A}{n,k} : k \in \mathbb{N}0}$ of $\mathcal{A}_n$, the set of atoms of $\mathcal{P}{\text{fin}, 0}(\mathbb{N}0)$ with maximum at most $n$: [ \mathcal{A}{n,k} = {A \in \mathcal{A} : \max A \le n \text{ and } |A| = k} ] for all $n,k \in \mathbb{N}$, where $\mathcal{A}$ is the set of atoms of $\mathcal{P}{\text{fin}, 0}(\mathbb{N}_0)$. We pay special attention to the sequence $(\alpha{n,k}){n,k \ge 1}$, where $\alpha{n,k}$ denote the size of the block $\mathcal{A}{n,k}$. First, we establish some bounds and provide some asymptotic results for $(\alpha{n,k}){n,k \ge 1}$. Then, we take some probabilistic approach to argue that, for each $n \in \mathbb{N}$, the sequence $(\alpha{n,k}){k \ge 1}$ is almost unimodal. Finally, for each $n \in \mathbb{N}$, we consider the random variable $X_n : \mathcal{A}_n \to \mathbb{N}_0$ defined by the assignments $X_n : A \mapsto |A|$, whose probability mass function is $\mathbb{P}(X_n=k) = \alpha{n,k}/| \mathcal{A}n|$. We conclude proving that, for each $m \in \mathbb{N}$, the sequence of moments $(\mathbb{E}(X_nm)){n \ge 1}$ behaves asymptotically as that of a sequence $(\mathbb{E}(Y_nm))_{n \ge 1}$, where $Y_n$ is a binomially distributed random variable with parameters $n$ and $\frac12$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube