This paper gives necessary conditions and slightly stronger sufficient conditions for a holomorphic function to be the Segal-Bargmann transform of a function in L(R, ρ), where ρ is a Gaussian measure. The proof relies on a family of inversion formulas for the Segal-Bargmann transform, which can be “tuned” to give the best estimates for a given value of p. I also give a single necessary-and-suff...

We describe three different methods to compute all those characters of a finite group that have certain properties of transitive permutation characters. First, a combinatorial approach can be used to enumerate vectors of multiplicities. Secondly, these characters can be found as certain integral solutions of a system of inequalities. Thirdly, they are calculated via Gaussian elimination. The me...

The concepts of regular generalized functions in Gaussian analysis are presented. Spaces of regular generalized functions are characterized and their probabilistic structure is worked out. Finally, these concepts are applied to a nonlinear (Verhulst type) equation. Its solution is shown to be a regular generalized process with martingale property.

Terrain LOD algorithm is a dynamic and local dough sheet subduction algorithm. On the basis of the research on traditional quadtree algorithm, this paper proposed a new terrain LOD algorithm using quadtree. On deviation computing standard, besides static deviation and view distance, motion vector and observation vector are introduced, which made the result of deviation computing close to the ac...

A simple but powerful modification of the standard Gaussian distribution is studied. The variables of the rectified Gaussian are constrained to be nonnegative, enabling the use of nonconvex energy functions. Two multimodal examples, the competitive and cooperative distributions, illustrate the representational power of the rectified Gaussian. Since the cooperative distribution can represent the...

We present new complexity results on the class of All constraints The central idea involves func tional elimination a general method of elimination whose focus is on the subclass of functional constraints One result is that for the subclass of All constraints strong n consistency and minimality is achievable in O en time where e n are the number of constraints and variables The main result is t...

In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, ...

We show how the Gaussian min-max theorem provides direct proofs of several famous results in asymptotic geometric analysis, such as, the Dvoretzky theorem, the Johnson-Lindenstrauss Lemma, Gluskin’s theorem on embedding in `1 , and others.

in this study, an effort has been made to determine the most important risk factors of tuberculosis (tb) in district mardan. a total of 645 cases were examined, and their personal and medical data were collected. for each case, the phenomenon of tb was studied in relation to different risk factors. statistical techniques of logistic regression and backward elimination procedure were used to ana...