相关论文: Compositions into Powers of $b$: Asymptotic Enumer…

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

We establish some asymptotic expansions for infinite weighted convolutions of distributions having light subexponential tails. Examples are presented, some showing that in order to obtain an expansion with two significant terms, one needs…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

We examine the sum of modified Bessel functions with argument depending non-linearly on the summation index given by \[S_{\nu,p}(a)=\sum_{n\geq 1} (an^p/2)^{-\nu} K_\nu(an^p)\qquad (a>0,\ 0\leq\nu<1)\] as the parameter $a\to 0+$, where $p$…

We investigate a family of integrals involving modified Bessel functions that arise in the context of neutrino scattering. Recursive formulas are derived for evaluating these integrals and their asymptotic expansions are computed. We prove…

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.

We use directed graphs called "syzygy quivers" to study the asymptotic growth rates of the dimensions of the syzygies of representations of finite dimensional algebras. For any finitely generated representation of a monomial algebra, we…

The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…

The asymptotics, as $n\to\infty$, for the expected number of distinct part sizes in a random composition of an integer n is obtained.

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

The aim of this work is to analyze general infinite sums containing modified Bessel functions of the second kind. In particular we present a method for the construction of a proper asymptotic expansion for such series valid when one of the…

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

Which integers can be written as a quotient of sums of distinct powers of three? We outline our first steps toward an answer to this question, beginning with a necessary and almost sufficient condition. Then we discuss an algorithm that…

We study a refined version of the Linnik problem on the asymptotic behavior of the number of representations of integer $m$ by an integral polynomial as $m$ tends to infinity. We assume that the polynomial arises from invariant theory, and…