搜索结果: 1-11 共查到“应用数学 UNIVERSAL”相关记录11条 . 查询时间(0.15 秒)
The purpose of this note is to define an Aronszajn line ηC and prove that under the assumption of PFA it is universal for the class of Aronszajn lines. Moreover ηC can be easily described in terms of ...
Universal covers and the GW/Kronecker correspondence
the GW/Kronecker correspondence math
2010/11/24
The tropical vertex is an incarnation of mirror symmetry found by Gross, Pandharipande and Siebert. It can be applied to $m$-Kronecker quivers $K(m)$ (together with a result of Reineke) to compute th...
A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edg...
Universal fractal scaling of self-organized networks
Universal fractal scaling self-organized networks
2010/11/10
There is an abundance of literature on complex networks describing a variety of relationships among units in social, biological, and technological systems. Such networks, consisting of interconnected ...
Determining When The Universal Abelian Cover of a Graph Manifold is a Rationla Homology Sphere
Universal Abelian Cover Graph Rationla Homology Sphere
2010/11/8
It was shown in my earlier article that the splice diagram of a rational homology sphere graph manifold determines the manifolds universal abelian cover. In this article we use the proof of this to g...
Universal limits of nonlinear measure redistribution processes and their applications
nonlinear measure redistribution processes their applications
2010/11/19
Deriving the time evolution of a distribution of probability (or a probability density matrix) is a problem encountered frequently in a variety of situations: for physical time, it could be a kinetic...
The universal Glivenko-Cantelli property
universal Glivenko-Cantelli classes uniformity classes
2010/12/10
Let F be a separable uniformly bounded family of measurable functions on a standard measurable space (X,X), and let N[](F, ", μ) be the smallest number of "-brackets in L1(μ) needed to cover F.
Toward the Universal Rigidity of General Frameworks
Toward the Universal Rigidity General Frameworks
2010/11/30
We prove that the (d + 1)-lateration graph with n(≥ d + 1) points, when points are in general position in Rd, not only is universally rigid but also admits a rank (n−d−1) positive semi-def...
Generalized universal theorem of isometric embedding
Mazur-Ulam theorem Figiel’s lemma Universal theorem
2010/9/17
Universal theorem is an important theorem, in this paper, Figiel’s lemma that concerns the isometric embedding from a Banach space X into the continuous space C(L) are extended. That is a form of exte...
Universal Approximation by Ridge Computational Models and Neural Networks: A Survey
nonlinear computational models ridge computational units universal approximation com-plexity
2008/11/10
Computational models made up of linear combinations of ridge basis functions, widely used in machine learning and artificial intelligence, are considered. For such models, the literature on the so-cal...
Entropy Lower Bounds Related to a Problem of Universal Coding and Prediction
Entropy Index of coincidence Rényi entropy Measure of roughness Universal coding Universal prediction
2008/7/1
Second order lower bounds for the entropy function expressed in terms of the index of coincidence are derived. Equivalently, these bounds involve entropy and Rényi entropy of order 2. The constants fo...