Related papers: A Recurrence Method for Generalizing Known Scienti…
The purpose of this paper is to establish several necessary and sufficient conditions to ensure the validity of a general functional inequality in terms of generalized quasi-arithmetic means. In particular cases, we consider H\"older-,…
This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…
We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.
We consider a new and simpler proof of an inequality of A.S. Gasparyan, which was originally derived in terms of complex algebraical objects --- multidimensional hyperdeterminants. Our proof is much simpler and use only standard technics…
In many cases commonsense knowledge consists of knowledge of what is usual. In this paper we develop a system for reasoning with usual information. This system is based upon the fact that these pieces of commonsense information involve both…
We use the theory of $x-y$ duality to propose a new definition / construction for the correlation differentials of topological recursion; we call it "generalized topological recursion". This new definition coincides with the original…
A generalization of the H\"older inequality is considered. Its relations with a previously obtained improvement of the Cauchy--Schwarz inequality are discussed.
We prove an abstract Nyquist criterion in a general set up. As applications, we recover various versions of the Nyquist criterion, some of which are new.
Positive polynomials arising from Muirhead's inequality, from classical power mean and elementary symmetric mean inequalities and from Minkowski's inequality can be rewritten as sums of squares.
In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…
In this shortnote, a series expansion technique introduced recently by Dancs and He for generating Euler-type formulae for odd zeta values $\:\zeta{(2 k +1)}$, $\zeta{(s)}$ being the Riemann zeta function and $k$ a positive integer, is…
In this paper we derive an extended Circle Pattern Theorem that allows obtuse overlap angles. As a consequence, we characterize a subclass of compact convex hyperbolic polyhedra with possibly obtuse dihedral angles and thus generalize…
An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…
In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…
The paper presents the generalized persistency of excitation conditions. They are not only valid for much broader range of applications than their classical counterparts but also elegantly prove the validity of the latter. The novelty and…
We introduce a recursive algorithm of conveniently general form for estimating the coefficient of a moving average model of order one and obtain convergence results for both correct and misspecified MA(1) models. The algorithm encompasses…
In 2015, Phulara established a generalization of the famous central set theorem by an original idea. Roughly speaking, this idea extends a combinatorial result from one large subset of the given semigroup to countably many. In this paper,…
In this paper we aim to generalize results obtained in the framework of fractional calculus by the way of reformulating them in terms of operator theory. In its own turn, the achieved generalization allows us to spread the obtained…
In this paper we prove a generalization of famous Larchr's theorem concerning good lattice points.
We have fundamentally corrected the proofs of the theorems from our paper [9] by giving an entirely different approach, using quite a simple method based on applications of some elementary inequalities, well-known H\"older's inequality, and…