相关论文: A Recurrence Method for Generalizing Known Scienti…
In the present note a generalization of Borel-Cantelli Lemma is proposed.
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
In this paper we present a complete proof of a conjecture due to V. V. Prelov in 2010 about an information inequality for the binary entropy function.
In the present paper, we propose a new generalization of the Borel-Cantelli lemma. This generalization can be further used to derive strong limit results for Markov chains. Illustrative applications are provided.
It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$…
Bell inequalities are a vital tool to detect the nonlocal correlations, but the construction of them for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of $(n+1)$-partite Bell inequalities…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
The aim of this paper is to investigate inequalities that are analogous to the Minkowski and H\"older inequalities by replacing the addition and the multiplication by a more general operation, and instead of using power means, generalized…
The method of exhaustion is generalized to a simple formula that can be used to integrate functions under very general conditions, provided that the integral exists. Both a geometric proof (following the usual procedure for the method of…
The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…
First we generalize a famous lemma of Gallagher on the mean square estimate for exponential sums by plugging a weight in the right hand side of Gallagher's original inequality. Then we apply it in the special case of the Cesaro weight, in…
This paper examines some methods and ideas underlying the author's successful probabilistic learning systems(PLS), which have proven uniquely effective and efficient in generalization learning or induction. While the emerging principles are…
We prove a generalization of one of Lie's Theorems in the context of Lie-like algebras$^{2-nd}$.
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
The pullback approach to global Finsler geometry is adopted. Three classes of recurrence in Finsler geometry are introduced and investigated: simple recurrence, Ricci recurrence and concircular recurrence. Each of these classes consists of…
Modus ponens (\emph{from $A$ and "if $A$ then $C$" infer $C$}, short: MP) is one of the most basic inference rules. The probabilistic MP allows for managing uncertainty by transmitting assigned uncertainties from the premises to the…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Baiocchi et al. generalized a few years ago a classical theorem of Ingham and Beurling by means of divided differences. The optimality of their assumption has been proven by the third author of this note. The purpose of this note to extend…