Related papers: Counting nondecreasing integer sequences that lie …

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…

Let $F(x, y)$ be a binary form with integer coefficients, degree $n\geq 3$ and irreducible over the rationals. Suppose that only $s + 1$ of the $n + 1$ coefficients of $F$ are nonzero. We show that the Thue inequality $|F(x,y)|\leq m$ has…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

The order of the set of equivalent resistances, A(n) of n equal resistors combined in series and in parallel has been traditionally addressed computationally, for n up to 22. For larger n there have been constraints of computer memory.…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…

We study the recursions $A(n) = A(n-a-A^k(n-b)) + A(A^k(n-b))$ where $a \geq 0$, $b \geq 1$ are integers and the superscript $k$ denotes a $k$-fold composition, and also the recursion $C(n) = C(n-s-C(n-1)) + C(n-s-2-C(n-3))$ where $s \geq…

Bernoulli numbers are usually expressed in terms of their lower index numbers (recursive). This paper gives explicit formulas for Bernoulli numbers of even index. The formulas contain a remarkable sequence of determinants. The value of…

We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…

For any sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0},$ we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$. Let $f_i(x)~(0\leq i< k)$ be sequence polynomials…

We propose generating functions which encode the degeneracies and wall-crossing phenomena of $\mathcal{N}=2$ BPS structures. The generating functions have a representation-theoretic origin and are the analogs of the 1/4-BPS dyon counting…

This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are…