In a recent paper (Diversity in Monoids, Czech. Math. J. 62 (2012), 795–809), the last two authors introduced and developed the monoid invariant “diversity” and related properties “homogeneity” and “strong homogeneity”. We investigate these properties within the context of inside factorial monoids, in which the diversity of an element counts the number of its different almost primary components. Inside factorial monoids are characterized via diversity and strong homogeneity. A new invariant complementary...

Let $M$ be a (commutative cancellative) monoid. A nonunit element $q\in M$ is called almost primary if for all $a,b\in M$, $q\mid ab$ implies that there exists $k\in \mathbb{N}$ such that $q\mid a^k$ or $q\mid b^k$. We introduce a new monoid invariant, diversity, which generalizes this almost primary property. This invariant is developed and contextualized with other monoid invariants. It naturally leads to two additional properties (homogeneity and strong homogeneity) that measure how far an almost primary element is from being primary. Finally, as an application...

Let $S$ be a fixed symmetric finite subset of $S{L}_d\left({𝒪}_K\right)$ that generates a Zariski dense subgroup of $S{L}_d\left({𝒪}_K\right)$ when we consider it as an algebraic group over $mathbbQ$ by restriction of scalars. We prove that the Cayley graphs of $S{L}_d({𝒪}_K/I)$ with respect to the projections of $S$ is an expander family if $I$ ranges over square-free ideals of ${𝒪}_K$ if $d=2$ and $K$ is an arbitrary numberfield, or if $d=3$ and $K=\mathbb{Q}$.

We consider a conjecture of Erdős and Rosenfeld and a conjecture of Ruzsa when the number is a perfect square. In particular, we show that every perfect square n can have at most five divisors between $\surd n-∜n{\left(logn\right)}^{1/7}$ and $\surd n+∜n{\left(logn\right)}^{1/7}$.

The canonization theorem says that for given $m,n$ for some $m^{*}$ (the first one is called $ER(n;m)$) we have for every function $f$ with domain ${\left[1,\cdots ,m^{*}\right]}^n$, for some $A\in {\left[1,\cdots ,m^{*}\right]}^m$, the question of when the equality $f\left(i_1,\cdots ,i_n\right)=f\left(j_1,\cdots ,j_n\right)$ (where $i_1<\cdots <i_n$ and $j_1<\cdots j_n$ are from $A$) holds has the simplest answer: for some $v\subseteq \{1,\cdots ,n\}$ the equality holds iff ${\bigwedge }_{\ell \in v}{i}_{\ell }=j_{\ell }$. We improve the bound on $ER(n,m)$ so that fixing $n$ the number of exponentiation needed to calculate $ER(n,m)$ is best possible.