Related papers: Completeness of Positive Linear Recurrence Sequenc…
A family of nested recurrence relations $a(n+1) = n - a^{(m)}(n) + a^{(m+1)}(n)$, parameterized by an integer $m \ge 1$ with initial condition $a(1)=1$, is studied. We prove that $a(n)=n-h(n)$ is the unique solution satisfying this…
Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…
This work explores new classes of nonstationary stochastic sequences associated with polynomial hypergroups. Their covariance structures are analyzed through positive definite kernels and corresponding Hilbert spaces. Novel consistent…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
We prove that any positive rational number is the sum of distinct unit fractions with denominators in $\{p-1 : p\textrm{ prime}\}$. The same conclusion holds for the set $\{p-h : p\textrm{ prime}\}$ for any $h\in\mathbb{Z}\backslash\{0\}$,…
For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…
In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…
A topological group $G$ is {\em sequentially $h$-complete} if all the continuous homomorphic images of $G$ are sequentially complete. In this paper we give necessary and sufficient conditions on a complete group for being compact, using the…
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.
Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant…
We consider existence and uniqueness properties of a solution to homogeneous cone complementarity problem (HCCP). Employing the $T$-algebraic characterization of homogeneous cones, we generalize the $P, P_0, R_0$ properties for a nonlinear…
Let $(P_1,...,P_n)$ be an $n$--tuple of projections in a unital $C^*$--algebra $\aa$. We say $\pn$ is complete in $\aa$ if $\aa$ is the linear direct sum of the closed subspaces $P_1\aa,...,P_n\aa$. In this paper, we give some necessary and…
In this paper, we consider matrices whose entries are combinatorial sequences which can be expressed in terms of a convolution of elementary and complete homogeneous symmetric functions. We establish the total positivity of these matrices…
We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain $\Omega$ of a rectangular domain $I\times I$ to a covariance kernel on the entire domain $I\times I$. For a…
We introduce a new criterion providing a sufficient condition for a hypersurface in an unramified regular local ring to be perfectoid pure. The criterion is formulated in terms of an explicitly computable sequence of integers, called the…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…