Related papers: Iteration of Exponentials with Sign Changes
Datalogo is an extension of Datalog that allows for aggregation and recursion over an arbitrary commutative semiring. Like Datalog, Datalogo programs can be evaluated via the natural iterative algorithm until a fixed point is reached.…
A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…
In this paper, we show that the concatenation of the Fibonacci sequence is \textit{normal} in base $10$, meaning every string of a given length, $k$, occurs as frequently as every other string of length $k$ (there are as many $1$'s as $2$'s…
We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…
We calculate the formal analytic expansions of certain formal translations in a space of formal iterated logarithmic and exponential variables. The results show how the algebraic structure naturally involves the Stirling numbers of the…
We consider a finite number of orientation preserving $C^2$ interval diffeomorphisms and apply them randomly in such a way that the expected Lyapunov exponents at the boundary points are positive. We prove the exponential decay of…
Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…
A refinement of the multinomial distribution is presented where the number of inversions in the sequence of outcomes is tallied. This refinement of the multinomial distribution is its joint distribution with the number of inversions in the…
In this paper, we first introduce the number of signed permutations with exactly $k$ inversions, which is denoted by $i_B(n,k)$ and called \textit{Mahonian numbers of type $B$}. Then we provide a recurrence relation for the Mahonian numbers…
We introduce and study non-uniform expansions of real numbers, given by two non-integer bases.
We introduce and study expansions of real numbers with respect to two integer bases.
Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…
We study whether several consecutive prime gaps can all be relatively large at the same time, or is it possible that all are squares or perfect powers, or perhaps none of them are squares? A few related results and problems are also…
The numerical computation of the exponentiation of a real matrix has been intensively studied. The main objective of a good numerical method is to deal with round-off errors and computational cost. The situation is more complicated when…
In this paper we find the number of different signatures of $P(3,1), P(5,1)$ and $P(7,1)$ upto switching isomorphism, where $P(n, k)$ denotes the generalised Petersen graph, $2k < n$. We also count the number of non-isomorphic signatures on…
A permutation p is realized by the shift on N symbols if there is an infinite word on an N-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as p. The set of realized permutations…