The inversion formula

Our main objective is to establish the so-called connection formula, $$\displaystyle \begin{aligned} p_n(x)=\sum_{k=0}^{n}C_{k}(n)y_k(x), \end{aligned} $$ (0.1) which for p n(x) = x n is known as the inversion formula $$\displaystyle \begin{aligned} x^n=\sum _{k=0}^{n}I_{k}(n)y_k(x), \end{aligned} $$ for the family y k(x), where \(\{p_n(x)\}_{n\in \mathbb {N}_0}\) and \(\{y_n(x)\}_{n\in \mathbb {N}_0}\) are two polynomial systems. If we substitute x by ax in the left hand side of (0.1) and y k by p k, we get the multiplication formula $$\displaystyle \begin{aligned} p_n(ax)=\sum _{k=0}^{n}D_{k}(n,a)p_k(x). \end{aligned} $$ The coefficients C k(n), I k(n) and D k(n, a) exist and are unique since deg p n = n, deg y k = k and the polynomials {p k(x), k = 0, 1, …, n} or {y k(x), k = 0, 1, …, n} are therefore linearly independent. In this session, we show how to use generating functions or the structure relations to compute the coefficients C k(n), I k(n) and D k(n, a) for classical continuous orthogonal polynomials.KeywordsOrthogonal polynomialsInversion coefficientsMultiplication coefficientsConnection coefficientsMathematics Subject Classification (2000)33C4533D4533D1533F1068W30

The Pick's theorem is one of the rare gems of elementary mathematics because this is a very innocent sounding hypothesis imply a very surprising conclusion (Bogomolny 1997). Yet the statement of the theorem can be understood by a fifth grader. Call a polygon a lattice polygon if the co-ordinates of its vertices are integers. Pick's theorem asserts that the area of a lattice polygon P is given by A(P) = I(P) + B(P) / 2 - 1 = V(P) - B(P) / 2 - 1 where I(P), B(P) and V(P) are the number of interior lattice points, the number of boundary lattice points and the total number of lattice points of P respectively. It is worth to mention that the I(P) (understand like digital area) is digital mapping standard in USA since decade (Morrison, J. L. 1988 and 1989). Because the Pick's theorem was first published in 1899 therefore our planned presentation had timing its 100 anniversary. Currently it has greater importance than realized heretofore because of the Pick's theorem forms a connection between the old Euclidean and the new digital (discrete) geometry. During this long period lots of proof had been made of Pick's theorem and many trial of its generalization from simple polygons towards complex polygon networks, moreover tried to extend it to the direction of 3D geometrical objects as well. It is also turned out that nowadays the inverse Pick's formulas comes to the front instead of the original ones, consequently of powerful spreading the digital geometry and mapping. Today the question is not the old one: how can we produce traditional area without co-ordinates, using only inside points and boundary points. Just on the contrary: how is it possible to simply determine digital boundary and digital area (namely the number of boundary points and inside points) using known co-ordinates of vertices. The inverse formulas are: B(P)=ΣGCD (AX, AY, AZ) (1D Pick's theorem) and I(P)=A(P)-B(P)/2+1 (2D Pick's theorem) where GCD is the Great Common Divisor of the co-ordinate differences of two-two neighboring vertices. The our main object is not these formulas to present, but we desire to show that the Pick's theorem (after adequate redrafting) indeed valid for every spatial triangle which are determined by three arbitrary points of a 3D lattice. The original planar theorem is only a special case of it. However if it is true then its valid not only for triangles but all irregular polygons also which are lying in space and have its vertices in spatial lattice points. Finally if the extended Pick's theorem is true for all face of a lattice polyhedron then it is true for total surface as well. Consequently we developed so simple and effective algorithms which solve enumeration tasks without the time- and memory-wasting immediate computing. These algorithms make possible that using the vertex-co-ordinate list and the topological description of a convex or non-convex polyhedron (cube, prism, tetrahedron etc.) getting answer many elementary questions. For example, how many vaxels can be found on the complex surface of a polyhedron, how many on its edges or on its individual faces. We succeeded to extend our results also to the surface of non-cornered geometric objects (circle, sphere, cylinder, cone, ellipsoid etc.), but anyway, this have to be object of another presentation.

A contour integration method, used to study the asymptotic of the sums of coefficients of Dirichlet series, is based on the Inversion formula. It allows you to express the sum of the coefficients in terms of the sum of the series. This approach gives effective estimates if the abscissa of absolute convergence 𝜎𝑎 > 1. In some cases, when studying arithmetical functions in generating Dirichlet series, this value is less than 1. As a rule, in this case, the Tauberian Delange theorem, which gives only the main term of asymptotic, is applied. However, generating Dirichlet series have better analytical properties than we need for the Delange theorem application. The contour integration method allows to count on precise results, but it need the inversion formula which is effective for series with 𝜎𝑎 < 1. In this paper the such inversion formula is presented and is proved to be an effective tool on examining the distribution of d(n) function values in the residue classes coprim with a module. W. Narkievicz used Delange theorem to obtain the main term of the asymptotic for frequency of hits of the values of function d(n) in residue classes. Application of the inversion formula allowed us to obtain more precise results.

Recently, Koornwinder and Walter derived an inversion formula for the finite continuous Jacobi transform for all α, β > −1. This inversion formula generalizes the one obtained earlier by Walter and Zayed for α,β > −1 and α+ β is a non-negative integer. In this paper we extend the finite continuous Jacobi transform and its inversion formula as obtained by Koornwinder and Walter to generalized functions. In particular, a fundamental space will be constructed and the generalized transform will be defined on the dual space. Several properties of the generalized transform will be studied along with a generalized inversion formula. Some examples of the finite continuous Jacobi transform and its inversion formula will also be given.

Let B B be a real separable Banach space, and let μ \mu be a probability measure on B ( B ) \mathcal {B}(B) , the Borel sets of B B . The characteristic functional (Fourier transform) ϕ \phi of μ \mu , defined by ϕ ( y ) = ∫ B exp ⁡ { i ( y , x ) } d μ ( x ) \phi (y) = \int _B {\exp \{ i(y,x)\} d\mu (x)\;} for y ∈ B ∗ y \in {B^\ast } (the topological dual of B B ), uniquely determines μ \mu . In order to determine μ \mu on B ( B ) \mathcal {B}(B) , it suffices to obtain the value of ∫ B G ( s ) d μ ( s ) \int _B {G(s)d\mu (s)} for every real-valued bounded continuous function G G on B B . Hence an inversion formula for μ \mu in terms of ϕ \phi is obtained if one can uniquely determine the value of ∫ B G ( s ) d μ ( s ) \int _B {G(s)d\mu (s)} for all real-valued bounded continuous functions G G on B B in terms of ϕ \phi and G G . The main efforts of this paper will be to prove such inversion formulae of various types. For the Orlicz space E α {E_\alpha } of real sequences we establish inversion formulae (Main Theorem II) which properly generalize the work of L. Gross and derive as a corollary the extension of the Main Theorem of L. Gross to E α {E_\alpha } spaces (Corollary 2.2.12). In Part I we prove a theorem (Main Theorem I) which is Banach space generalization of the Main Theorem of L. Gross by reinterpreting his necessary and sufficient conditions in terms of convergence of Gaussian measures. Finally, in Part III we assume our Banach space to have a shrinking Schauder basis to prove inversion formulae (Main Theorem III) which express the measure directly in terms of ϕ \phi and G G without the use of extension of ϕ \phi as required in the Main Theorems I and II. Furthermore this can be achieved without using the Lévy Continuity Theorem and we hope that one can use this theorem to obtain a direct proof of the Lévy Continuity Theorem.

In this article, an inversion formula is obtained for the spherical transform which integrates functions, defined on the unit sphere \(S^{2}\), on circles. The inversion formula is for the case where the circles of integration are obtained by intersections of \(S^{2}\) with hyperplanes passing through a common point \(\overline{a}\) strictly inside \(S^{2}\). In particular, this yields inversion formulas for two well-known special cases. The first inversion formula is for the special case where the family of circles of integration consists of great circles; this formula is obtained by taking \(\overline{a} = 0\). The second inversion formula is for the special case where the circles of integration pass through a common point \(p\) on \(S^{2}\); this formula is obtained by taking the limit \(\overline{a}\rightarrow p\).

An inversion formula was developed by Bukhgeim and Kazantsev for attenuated fan-beam projections [Russian Academy of Science Siberian Branch: The Sobolev Institute of Mathematics (2002)]. The inversion formula was obtained by relating the attenuated fan-beam projections to unattenuated fan-beam projections and by trickily processing the unattenuated fan-beam projections. We show in this paper that the inversion formula can be readily obtained from Novikov's inversion formula for the two-dimensional (2D) attenuated radon transform. The derivation provides an alternative proof of Bukhgeim and Kazantsev's inversion formula by the use of transformation between parallel-beam coordinates and fan-beam coordinates and thus is quite elementary.

Dual operators and Lagrange inversion in several variables

We describe an algorithm that evaluates queries over probabilistic databases using Mobius' inversion formula in incidence algebras. The queries we consider are unions of conjunctive queries (equivalently: existential, positive First Order sentences), and the probabilistic databases are tuple-independent structures. Our algorithm runs in PTIME on a subset of queries called queries, and is complete, in the sense that every unsafe query is hard for the class FP#P. The algorithm is very simple and easy to implement in practice, yet it is non-obvious. Mobius' inversion formula, which is in essence inclusion-exclusion, plays a key role for completeness, by allowing the algorithm to compute the probability of some safe queries even when they have some subqueries that are unsafe. We also apply the same lattice-theoretic techniques to analyze an algorithm based on lifted conditioning, and prove that it is incomplete.

The use of the repeated Cauchy principal value affords greater facility in the application of inversion formulae involving characteristic functions. Formula (2) below is especially useful in obtaining the inversion formula (1) for the distribution of the ratio of linear combinations of random variables which may be correlated. Formulae (1), (10), (12) generalize the special cases considered by Cramer [2], Curtiss [4], Geary [6], and are free of some restrictions they impose. The results are further generalized in section 6, where inversion formulae are given for the joint distribution of several ratios. In section 7, the joint distribution of several ratios of quadratic forms in random variables $X_1, X_2,\cdots,X_n$ having a multivariate normal distribution is considered.

Inversion Formula for Continuous Multifractals

On the inversion formula for two polynomials in two variables

Inverse Measures, the Inversion Formula, and Discontinuous Multifractals

Data clustering is one area of data mining that falls into the data mining class of unsupervised learning. Cluster analysis divides data into different classes by discovering the internal structure of data set objects and their relationship. This paper presented a new density clustering method based on the modified inversion formula density estimation. This new method should allow one to improve the performance and robustness of the k-means, Gaussian mixture model, and other methods. The primary process of the proposed clustering algorithm consists of three main steps. Firstly, we initialized parameters and generated a T matrix. Secondly, we estimated the densities of each point and cluster. Third, we updated mean, sigma, and phi matrices. The new method based on the inversion formula works quite well with different datasets compared with K-means, Gaussian Mixture Model, and Bayesian Gaussian Mixture model. On the other hand, new methods have limitations because this one method in the current state cannot work with higher-dimensional data (d &gt; 15). This will be solved in the future versions of the model, detailed further in future work. Additionally, based on the results, we can see that the MIDEv2 method works the best with generated data with outliers in all datasets (0.5%, 1%, 2%, 4% outliers). The interesting point is that a new method based on the inversion formula can cluster the data even if data do not have outliers; one of the most popular, for example, is the Iris dataset.

An Inversion Formula and Its Application to Soliton Theory