Related papers: An inequality for Kruskal-Macaulay functions

If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…

It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..

The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and…

We give a new characterization of Nikolskii-Besov classes of functions of fractional smoothness by means of a nonlinear integration by parts formula in the form of a nonlinear inequality. A similar characterization is obtained for…

Let $\lambda$ be the Liouville function, defined as $\lambda(n) := (-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwi{\l}{\l} proved that $$\sum_{n\leq x} \frac{1}{n}…

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

The coefficients of the generating function $(q;q)^\alpha_\infty$ produce $p_\alpha(n)$ for $\alpha \in \mathbb{Q}$. In particular, when $\alpha = -1$, the partition function is obtained. Recently, Chan and Wang identified and proved…

Let $\mathcal{A}$ be a unital $\mathbf{C}^*$-algebra with unit $e$. We develop several inequalities for a positive linear functional $f$ on $\mathcal{A}$ and obtain several bounds for the numerical radius $v(a)$ of an element $a\in…

Using the Euler--Maruyama technique, we show that a class of Wiener processes exist that are obtained by computing an arbitrary positive power of them. This can be accomplished with a proper set of definitions that makes meaningful the…

A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropy of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these…

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

Let $n, m, k$ be positive integers with $k=n-m+1$. We establish an abstract Morse-Sard-type theorem which allows us to deduce, on the one hand, a previous result of De Pascale's for Sobolev $W^{k,p}_{\textrm{loc}}(\mathbb{R}^n,…

Given an integer $k\ge2$, let $\omega_k(n)$ denote the number of primes that divide $n$ with multiplicity exactly $k$. We compute the density $e_{k,m}$ of those integers $n$ for which $\omega_k(n)=m$ for every integer $m\ge0$. We also show…

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

The Cauchy-type product of two arithmetic functions $f$ and $g$ on nonnegative integers is defined as $(f\bullet g)(k):=\sum_{m=0}^{k} {k\choose m}f(m)g(k-m)$. We explore some algebraic properties of the aforementioned convolution, which is…

Computing explicitly the {\epsilon}-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting theoretical algorithm is applied to the the class…

The Kruskal Katona theorem was proved in the 1960s. In the theorem, we are given an integer $r$ and families of sets $\mathcal{A}\subset \mathbb{N}^{(r)}$ and $\mathcal{B}\subset\mathbb{N}^{(r-1)}$ such that for every $A\in\mathcal{A}$,…

For fixed positive integers $n$, we study the solution of the equation $n = k + p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterative method \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to the…

There is no trivial mathematics, there are only trivial mathematicians! A mathematician is trivial if he or she believes that there exists trivial mathematics. Being a non-trivial mathematician myself, I will describe ten different proofs…