Related papers: On a total function which overtakes all total recu…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…
In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…
We extend our result on the convergence of double recurrence Wiener-Wintner averages to the case where we have a polynomial exponent. We will show that there exists a single set of full measure for which the averages \[ \frac{1}{N}…
Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much…
This paper describes a generalization of Clark's completion that is applicable to logic programs containing arithmetic operations and produces syntactically simple, natural looking formulas. If a set of first-order axioms is equivalent to…
In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…
We find an integral representation for the generalized hypergeometric function unifying known representations via generalized Stieltjes, Laplace and cosine Fourier transforms. Using positivity conditions for the weight in this…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…
We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…
We give a precise definition of a formal mathematical object as any symbol for an individual constant, predicate letter, or a function letter that can be introduced through definition into a formal mathematical language without inviting…
Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…
A Fourier-type integral representation for Bessel's function of the first kind and complex order is obtained by using the Gegenbuaer extension of Poisson's integral representation for the Bessel function along with a trigonometric integral…
Polynomial functors are sums of covariant representable functors from the category of sets to itself. They have a robust theory with many applications -- from operads and opetopes to combinatorial species. In this paper, we define a…
This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…