相关论文: A Recurrence Method for Generalizing Known Scienti…

In this note, we generalize an ancient Greek inequality about the sequence of primes to the cases of arithmetic progressions even multivariable polynomials with integral coefficients. We also refine Bouniakowsky's conjecture [16] and…

We prove a generalization of the well known Routh's triangle theorem. As a consequence, we get a unification of the theorems of Ceva and Menelaus. A connection to Feynman's triangle is also given.

The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…

A method to generalize results from Riemannian Geometry to Finsler geometry is presented. We use the method to generalize several results that involve only metric conditions. Between them we show that the topology induced by the Finsler…

As a first application of a very old theorem, known as Herschel's theorem, we provide direct elementary proofs of several explicit expressions for some numbers and polynomials that are known in combinatorics. The second application deals…

While Kolmogorov's probability axioms are widely recognized, it is less well known that in an often-overlooked 1930 note, Kolmogorov proposed an axiomatic framework for a unifying concept of the mean -- referred to as regular means. This…

The purpose of this paper is to generalize a very famous result on products of normal operators, due to I. Kaplansky. The context of generalization is that of bounded hyponormal and unbounded normal operators on complex separable Hilbert…

The strong recurrence is equivalent to the Riemann hypothesis. In the present paper, we give a simple proof of the generalized strong recurrence for all non-zero parameters.

We give here a general, best-possible, and smoothly-derived form of the Master Theorem for divide-and-conquer recurrences.

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

An overlooked formula of E. Lucas for the generalized Bernoulli numbers is proved using generating functions. This is then used to provide a new proof and a new form of a sum involving classical Bernoulli numbers studied by K. Dilcher. The…

This paper presents a general methodology for deriving information-theoretic generalization bounds for learning algorithms. The main technical tool is a probabilistic decorrelation lemma based on a change of measure and a relaxation of…

We study the generalized Hankel transform of the family of sequences satisfying the recurrence relation $a_{n+1} = \bigl(\alpha + \frac{\beta}{n+\gamma}\bigr) a_n$. We apply the obtained formula to several particular important sequences.…

We present an axiomatic approach to the mean and discuss generalizations of the mean, including one due to Kolmogorov based on the Weak Law of Large Numbers. We offer examples and counterexamples, describe conventional and unconventional…

This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…

We give some new refinements and reverses Young inequalities in both additive-type and multiplicative-type for two positive numbers/operators. We show our advantages by comparing with known results. A few applications are also given. Some…

The Chernoff bound is one of the most widely used tools in theoretical computer science. It's rare to find a randomized algorithm that doesn't employ a Chernoff bound in its analysis. The standard proofs of Chernoff bounds are beautiful but…

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…

We present a simple extension of Lindeberg's argument for the Central Limit Theorem to get a general invariance result. We apply the technique to prove results from random matrix theory, spin glasses, and maxima of random fields.