arXiv subjects
Publications and source records attributed to Błażej Żmija.
For normalized sequences $\left(g(n)\right)_{n\in\mathbb{N}}$ we consider recursively defined polynomials $P_n^g(x)$. In this paper we study their submultiplicative property, viewed as a Bessenrodt--Ono type inequality for the partition function, and provide an effective criterion for establishing it.
For non-negative integer parameters $r,u,m,n$ define \begin{align*} \cal{D}(r,u,m,n) := \big\{\ σ\in \cal{S}_{r+n}\ \big|\ σ(x)=y \textrm{ for exactly } u \textrm{ pairs } (x,y) \textrm{ such that } 1\leq x,y\leq r \textrm{ and } σ(t)=t \textrm{ for exactly } m \textrm{ elements } r+1\leq t\leq r+n\ \big\} \end{align*} and \begin{align*} \cal{D}_{r,u,m}(n) := \big\{\ σ\in \cal{S}_{r+n}\ \big|\ \forall_{1\leq x<y\leq r} \ x \textrm{ and } y \textrm{ are in disjoint cycles of } σ\textrm{ and } σ(z)=z \textrm{ for exactly } u \textrm{ elements } 1\leq z\leq r, \textrm{ and } σ(t)=t \textrm{ for exactly } m \textrm{ elements } r+1\leq t\leq r+n\ \big\}, \end{align*} where $\mathcal{S}_{n}$ denotes the set of all the permutations of $\{1,\ldots ,n\}$. In this paper we study connections between the sets $\mathcal{D}(r,u,m,n)$, $\mathcal{D}_{r,u,m}(n)$, and the sets of (some classes of) $r$-derangements. We rely mostly on counting arguments.
This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying Maclaurin's inequalities. For cubic polynomials, we derive a much more precise asymptotic result. Furthermore, we analyse the arithmetic properties of the discriminants of these polynomials, showing that a positive proportion of cubics have square-free discriminants.
In this paper we study the problem of long gaps between values of binary quadratic forms. Let $D_{1}$, $D_{2},\ldots ,D_{r}$ be negative integers and $(s_{n})_{n=1}^{\infty}$ be the sequence of all the numbers representable by any binary quadratic form of discriminant $D_{1}$, $D_{2}$, $\ldots$ or $D_{r}$, and let $d :={\rm lcm}\{D_{1},\ldots ,D_{r}\}$. We show that then \begin{align*} \limsup_{n\to\infty}\frac{s_{n+1}-s_{n}}{\log s_{n}}\geq \frac{1}{\log d + \log\log d + \log\log\log d + 4}. \end{align*} This improves and generalises a result by Dietmann, Elsholtz, Kalmynin, Konyagin, and Maynard. As a by-product of our preliminary results, we show an improvement to the Pólya-Vinogradov inequality.
Let $\mathbf{x}$ be a (non-empty) sequence of positive real numbers. Its achievement set $\mathcal{\mathbf{x}}$ is the set of all the possible sums of the elements of $\mathbf{x}$. The cardinal function of $\mathbf{x}$ is the function $f:\mathcal{A}(\mathbf{x}) \to \mathbb{N}\cup\{ω,\mathfrak{c}\}$ that for every $x\in\mathbb{A}(\mathbf{x})$ the value $f(x)$ is equal to the number of ways $x$ is represented as a sum of elements of $\mathbf{x}$. In this paper we consider possible ranges of cardinal functions of sequences $\mathbf{x}$. We present some general constructions and several criteria that a set has to satisfy in order to be a range of a cardinal function. We put special attention to the case of sets with maximal element equal to $6$. In this case, in particular, we obtained a full characterisation of sets that are ranges of cardinal functions of interval-filling sequences.
We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite quadratic lattices that represent all the multiples of a given rational integer. Our main tools are short vectors in quadratic lattices combined with an estimate for the number of periodic continued fractions with bounded coefficients.
We prove that there are at most 13 real quadratic fields that admit a ternary universal quadratic lattice, thus establishing a strong version of Kitaoka's Conjecture for quadratic fields. More generally, we obtain explicit upper bounds on the discriminants of real quadratic fields with a quadratic lattice of rank at most 7 that represents all totally positive multiples of a fixed integer.
Let $M=(m_{i})_{i=0}^{\infty}$ be a sequence of integers such that $m_{0}=1$ and $m_{i}\geq 2$ for $i\geq 1$. In this paper we study $M$-ary partition polynomials $(p_{M}(n,t))_{n=0}^{\infty}$ defined as the coefficient in the following power series expansion: \begin{align*} \prod_{i=0}^{\infty}\frac{1}{1-tq^{M_{i}}} = \sum_{n=0}^{\infty} p_{M}(n,t)q^{n}, \end{align*} where $M_{i}=\prod_{j=0}^{i}m_{j}$. In particular, we provide a detailed description of their rational roots and show, that all their complex roots have absolute values not greater than $2$. We also study arithmetic properties of $M$-ary partition polynomials. One of our main results says that if $n=a_{0}+a_{1}M_{1}+\cdots +a_{k}M_{k}$ is a (unique) representation such that $a_{j}\in\{0,\ldots ,m_{j+1}-1\}$ for every $j$, then \begin{align*} p_{M}(n,t)\equiv t^{a_{0}}\prod t^{a_{j}}f(a_{j}+1,t^{m_{j}-1}) \pmod{g_{k}(t)}, \end{align*} where $f(a,t):=\frac{t^{a}-1}{t-1}$ and $g_{k}(t):=\gcd \big(t^{m_{1}+m_{2}-1}f(m_{2},t^{m_{1}-1}),\ldots ,t^{m_{k}+m_{k+1}-1}f(m_{k+1},t^{m_{k}-1})\big)$. This is a polynomial generalisation of the well-known characterisation modulo $m$ of the sequence of $m$-ary partition.
For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for every positive integer $n$ the following congruence is true: \begin{align*} p_{M}(m_{1}m_{2}\cdots m_{r}n-1)\equiv 0\ \ \left({\rm mod}\ \prod_{t=2}^{r}\mathcal{M}(m_{t},t-1)\right), \end{align*} where $\mathcal{M}(m,r):=\frac{m}{\gcd\big(m,{\rm lcm} (1,\ldots ,r)\big)}$. Our result answers a conjecture posed by Folsom, Homma, Ryu and Tong, and is a generalisation of the congruence relations for $m$-ary partitions found by Andrews, Gupta, and Rødseth and Sellers.
Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define subsequences $(p^{(k)}_n)_{n=1}^{+\infty}$ of the sequence $(p_n)_{n=1}^{+\infty}$ in the following way: let $p_n^{(1)}=p_n$ and $p_n^{(k+1)}=p_{p_n^{(k)}}$. In this paper we study and describe some interesting properties of the sets $\mathbb{P}_k=\{p_1^{(k)}<p_2^{(k)}<\dots<p_n^{(k)}<\dots\}$, $\mathbb{P}_n^{\mathrm{T}}=\{p_n^{(1)}<p_n^{(2)}<\dots<p_n^{(k)}<\dots\}$ and $\text{Diag}\mathbb{P}=\{p^{(1)}_1<p^{(2)}_2<\dots <p^{(k)}_k<\dots\}$ and their elements, for $k,n\in\mathbb{N}$. Especially, we check whether these sets have dense sets of ratios in $\mathbb{R}_+$. Moreover, we compute their exponents of convergence and asymptotics of their counting functions.
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we give answers to some questions and prove a conjecture posed by Miska and Tóth in their recent paper concerning subsequences of the sequence of prime numbers. In particular, we establish explicit upper and lower bounds for $p_{n}^{(k)}$. We also study the behaviour of the counting functions of the sequences $(p_{n}^{(k)})_{k=1}^{\infty}$ and $(p_{k}^{(k)})_{k=1}^{\infty}$.
Let $k\in\N_{\geq 2}$ and for given $m\in\Z\setminus\{0\}$ consider the sequence $(S_{k,m}(n))_{n\in\N}$ defined by the power series expansion $$ \frac{1}{(1-x)^{m}}\prod_{i=0}^{\infty}\frac{1}{(1-x^{k^{i}})^{m}}=\sum_{n=0}^{\infty}S_{k,m}(n)x^{n}. $$ The number $S_{k,m}(n)$ for $m\in\N_{+}$ has a natural combinatorial interpretation: it counts the number of representations of $n$ as sums of powers of $k$, where the part equal to $1$ takes one among $mk$ colors and each part $>1$ takes $m(k-1)$ colors. We concentrate on the case when $k=p\in\mathbb{P}$. Our main result is the computation of the exact value of the $p$-adic valuation of $S_{p,m}(n)$. In particular, in each case the set of values of $ν_{p}(S_{p,m}(n))$ is finite and the maximum value is bounded by $\op{max}\{ν_{p}(m)+1,ν_{p}(m+1)+1\}$. Our results can be seen as a generalization of earlier work of Churchhouse and recent work of Gawron, Miska and Ulas, and the present authors.
Let $m\in\N_{\geq 2}$ and for given $k\in\N_{+}$ consider the sequence $(A_{m,k}(n))_{n\in\N}$ defined by the power series expansion $$ \prod_{n=0}^{\infty}\frac{1}{\left(1-x^{m^{n}}\right)^{k}}=\sum_{n=0}^{\infty}A_{m,k}(n)x^{n}. $$ The number $A_{m,k}(n)$ counts the number of representations of $n$ as sums of powers of $m$, where each summand has one among $k$ colors. In this note we prove that for each $p\in\mathbb{P}_{\geq 3}$ and $s\in\N_{+}$, the $p$-adic valuation of the number $A_{p,(p-1)(p^s-1)}(n)$ is equal to 1 for $n\geq p^s$. We also obtain some results concerning the behaviour of the sequence $(ν_{p}(A_{p,(p-1)(up^s-1)}(n)))_{n\in\N}$ for fixed $u\in\{2,\ldots,p-1\}$ and $p\geq 3$. Our results generalize the earlier findings obtained for $p=2$ by Gawron, Miska and the first author.
A composite positive integer $n$ has the Lehmer property if $ϕ(n)$ divides $n-1,$ where $ϕ$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$ is the number of prime divisors of $n$. We apply this bound to repunit numbers and prove that there are at most finitely many numbers with the Lehmer property in the set $$ \left\{\frac{g^{n}-1}{g-1}\ \bigg|\ n,g\in\mathbb{N},\ ν_{2}(g)+ν_{2}(g+1)\leq L\ \right\}, $$ where $ν_{2}(g)$ denotes the highest power of $2$ that divides $g$, and $L\geq 1$ is a fixed real number.
In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$ and $m$--ary partitions with no gaps $(c_{m}(n))_{m\in\mathbb{N}}$. We prove, for example, that for any natural number $2<h\leq m+1$ in both sequences $(b_{m}(n))_{m\in\mathbb{N}}$ and $(c_{m}(n))_{m\in\mathbb{N}}$ any residue class modulo $h$ appears infinitely many times. Moreover, we give new proofs of characterisations modulo $m$ in terms of base--$m$ representation of $n$ for sequences $(b_{m}(n))_{m\in\mathbb{N}}$ and $(c_{m}(n))_{m\in\mathbb{N}}$. We also present a general method of finding such characterisations modulo any power of $m$. Using our approach we get description of $(b_{m}(n)\mod{μ_{2}})_{n\in\mathbb{N}}$, where $μ_{2}=m^{2}$ if $m$ is odd and $μ_{2}=m^{2}/2$ if $m$ is even.