相关论文: Convergence exponent of Pierce expansion digit seq…
We introduce the error-sum function of Pierce expansions. Some basic properties of the error-sum function are analyzed. We also examine the fractal property of the graph of it by calculating the Hausdorff dimension, the box-counting…
We consider conditions for the convergence of sequences in terms of positive and alternating Perron expansions ($P$-representation and $P^-$-representation). These conditions are crucial to determine the continuity of functions that are…
We consider an arbitrary Gaussian Stationary Process X(T) with known correlator C(T), sampled at discrete times T_n = n \Delta T. The probability that (n+1) consecutive values of X have the same sign decays as P_n \sim \exp(-\theta_D T_n).…
The digits of Pierce expansion obey the law of large numbers, the central limit theorem, and the law of the iterated logarithm in the Lebesgue measure sense. We calculate the Hausdorff dimensions of the exceptional sets of each of the three…
Let $\{a_n(x)\}_{n\geq1}$ be the sequence of digits of $x\in(0,1)$ in infinite iterated function systems with polynomial decay of the derivative. We first study the multifractal spectrum of the convergence exponent defined by the sequence…
The purpose of this paper is to investigate integer sequences with exponent lifting property, a property common in Fibonacci or Lucas sequences.
An effective radius of convergence is defined and computed for any truncated Taylor series. Applications to well known series are performed and is shown that a range of good coincidence for actual and approximative plot can always be found.…
The digits of the Pierce expansion satisfy the law of large numbers. It is known that the Hausdorff dimension of the set of exceptions to the law of large numbers is 1. We provide an elementary proof of this fact by adapting Jun Wu's…
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…
Professor Tibor \v{S}al\'at, at one of his seminars at Comenius University, Bratislava, asked to study the influence of gaps of an integer sequence A={a_1<a_2<...<a_n<...} on its exponent of convergence. The exponent of convergence of A…
In this paper we discuss a closed-form approximation of the likelihood functions of an arbitrary diffusion process. The approximation is based on an exponential ansatz of the transition probability for a finite time step $\Delta t$, and a…
In this paper we study the set of digit frequencies that are realised by elements of the set of $\beta$-expansions. The main result of this paper demonstrates that as $\beta$ approaches $1,$ the set of digit frequencies that occur amongst…
We study the persistence probability for some discrete-time, time-reversible processes. In particular, we deduce the persistence exponent in a number of examples: first, we deal with random walks in random sceneries (RWRS) in any dimension…
An Engel series is a sum of reciprocals of a non-decreasing sequence $(x_n)$ of positive integers, which is such that each term is divisible by the previous one, and a Pierce series is an alternating sum of the reciprocals of a sequence…
Past works on remote lossy source coding studied the rate under average distortion and the error exponent of excess distortion probability. In this work, we look into how fast the excess distortion probability converges to 1 at small rates,…
Convergence of the Schwinger --- DeWitt expansion for the evolution operator kernel for special class of potentials is studied. It is shown, that this expansion, which is in general case asymptotic, converges for the potentials considered…
This paper provides a link between integer exponentiation and integer tetration since it is devoted to introducing some peculiar sets of perfect powers characterized by any given value of their constant congruence speed, revealing a…
We consider both finite and infinite power chi expansions of $f$-divergences derived from Taylor's expansions of smooth generators, and elaborate on cases where these expansions yield closed-form formula, bounded approximations, or analytic…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for…
This work establishes the exact exponents for the soft-covering phenomenon of a memoryless channel under the total variation metric when random (i.i.d. and constant-composition) channel codes are used. The exponents, established herein, are…