首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 234 毫秒
1.
《Quaestiones Mathematicae》2013,36(3):315-339
ABSTRACT

(PART II): In terms of a given Hamiltonian function the 1-form w = dH + ?j|dπj is defined, where {?j:j = 1,…, n} denotes an invariant basis of the planes of the distribution Dn. The latter is said to be canonical if w = 0 (which is analogous to the definition of Hamiltonian vector fields in symplectic geometry). This condition is equivalent to two sets of canonical equations that are expressed explicitly in term of the derivatives of H with respect to its positional arguments. The distribution Dn is said to be pseudo-Lagrangian if dπj(?j,Vh) = 0; if Dn, is both canonical and pseudo-Lagrangian it is integrable and such that H = const. on each leaf of the resulting foliation. The Cartan form associated with this construction [9] is defined a II = π2 ? ? πn. If π is closed, the distribution DN is integrable, and the exterior system {πj} admits the representation ψj = dSj in terms of a set of 0-forms Sj on M. If, in addition, the distribution DN is canonical, these functions satisfy a single first order Hamilton-Jacobi equation, and conversely. Finally, a complete figure is constructed on the basis of the assumptions that (i) the Cartan form be closed, and (ii) that the distribution Dn, be both canonical and integrable. The last of these requirements implies the existence of N functions ψA that depend on xh and N parameters wB, whose derivatives are given by ?ψA (xh, wB)/?xj = BA j (xh, ψB (xh,wB)). The complete figure then consists of two complementary foliations: the leaves of the first are described by the functions ψA and satisfy the standard Euler-Lagrange equations, while the second, that is, the transversal foliation, is represented by the aforementioned solution of the Hamilton-Jacobi equation. The entire configuration then gives rise in a natural manner to a generalized Hilbert independent integral and consequently also to a generalized Weierstrass excess function.  相似文献   

2.
《Quaestiones Mathematicae》2013,36(2):205-229
ABSTRACT

(PART I): A field-theoretic treatment of variational problems in n independent variables {xj} and N dependent variables A)} is presented that differs substantially from the standard field theories, such as those of Carathéodory [4] and Weyl [10], inasmuch as it is not stipulated ab initio that the Lagrangian be everywhere positive. This is accomplished by the systematic use of a canonical formalism. Since the latter must necessarily be prescribed by appropriate Legendre transformations, the construction of such transformations is the central theme of Part I.—The underlying manifold is M = Mn x MN, where Mn, MN are manifolds with local coordinates {xj}, {ψA}, respectively. The basic ingredient of the theory consists of a pair of complementary distributions Dn, DN on M that are defined respectively by the characteristic subspaces in the tangent spaces of M of two sets of smooth 1-forms {πA:A = 1,…, N}, {πj = 1,…, n} on M. For a given local coordinate system on M the planes of 4, have unique (adapted) basis elements Bj = (?/?x j) + BA j (?/?ψA), whose coefficients BA j will assume the role of derivatives such as ?ψA/?xj in the final analysis of Part II. The first step toward a Legendre transformation is a stipulation that prescribes BA j as a function of the components {πj hj A} of {πj}—these components being ultimately the canonical Variables—in such a manner that BA j is unaffected by the action of any unimodular transformation applied to the exterior system {πj}. A function H of the canonical variables is said to be an acceptable Hamiltonian if it satisfies a similar invariance requirement, together with a determinantal condition that involves its Hessian with respect to πj A. The second part of the Legendre transformation consists of the identification in terms of H and the canonical variables of a function L that depends solely on BA j and the coordinates on M. This identification imposes a condition on the Hessian of L with respect to BA j. Conversely, any function L that satisfies these requirements is an acceptable Lagrangian, whose Hamiltonian is uniquely determined by the general construction.  相似文献   

3.
In this paper,a uniqueness theorem for meromorphic mappings partially sharing 2N+3 hyperplanes is proved.For a meromorphic mapping f and a hyperplane H,set E(H,f) = {z|ν(f,H)(z) 0}.Let f and g be two linearly non-degenerate meromorphic mappings and {Hj}j2=N1+ 3be 2N + 3 hyperplanes in general position such that dim f-1(Hi) ∩ f-1(Hj) n-2 for i = j.Assume that E(Hj,f) E(Hj,g) for each j with 1 j 2N +3 and f = g on j2=N1+ 3f-1(Hj).If liminfr→+∞ 2j=N1+ 3N(1f,Hj)(r) j2=N1+ 3N(1g,Hj)(r) NN+1,then f ≡ g.  相似文献   

4.
Let A?? N be an algebraic variety with dim?AN?2. Given discrete sequences {a j },{b j }?? N \ A with slow growth ( $\sum_{j}{1\over|a_{j}|^{2}}<\infty,\sum_{j}{1\over |b_{j}|^{2}}<\inftyLet A⊂ℂ N be an algebraic variety with dim AN−2. Given discrete sequences {a j },{b j }⊂ℂ N \ A with slow growth ( ?j[1/(|aj|2)] < ¥,?j[1/(|bj|2)] < ¥\sum_{j}{1\over|a_{j}|^{2}}<\infty,\sum_{j}{1\over |b_{j}|^{2}}<\infty ) we construct a holomorphic automorphism F with F(z)=z for all zA and F(a j )=b j for all j∈ℕ. Additional approximation of a given automorphism on a compact polynomially convex set, fixing A, is also possible. Given unbounded analytic variety A there is a tame set E such that F(E)≠{(j,0 N−1):j∈ℕ} for all automorphisms F with F| A =id. As an application we obtain an embedding of a Stein manifold into the complement of an algebraic variety in ℂ N with interpolation on a given discrete set.  相似文献   

5.
Summary This paper concerns the nonlinear filtering problem of calculating estimates E[f(xt)¦y s, st] where {x t} is a Markov process with infinitesimal generator A and {y t} is an observation process given by dy t=h(xt)dt +dwtwhere {w t} is a Brownian motion. If h(xt) is a semimartingale then an unnormalized version of this estimate can be expressed in terms of a semigroup T s,t y obtained by a certain y-dependent multiplicative functional transformation of the signal process {x t}. The objective of this paper is to investigate this transformation and in particular to show that under very general conditions its extended generator is A t y f=ey(t)h(A– 1/2h2)(e–y(t)h f).Work partially supported by the U.S. Department of Energy (Contract ET-76-C-01-2295) at the Massachusetts Institute of Technology  相似文献   

6.
Let Ω = {t0, t1, …, tN} and ΩN = {x0, x1, …, xN–1}, where xj = (tj + tj + 1)/2, j = 0, 1, …, N–1 be arbitrary systems of distinct points of the segment [–1, 1]. For each function f(x) continuous on the segment [–1, 1], we construct discrete Fourier sums Sn, N( f, x) with respect to the system of polynomials {p?k,N(x)} k=0 N–1 , forming an orthonormal system on nonuniform point systems ΩN consisting of finite number N of points from the segment [–1, 1] with weight Δtj = tj + 1tj. We find the growth order for the Lebesgue function Ln,N (x) of the considered partial discrete Fourier sums Sn,N ( f, x) as n = O(δ N ?2/7 ), δN = max0≤ jN?1 Δtj More exactly, we have a two-sided pointwise estimate for the Lebesgue function Ln, N(x), depending on n and the position of the point x from [–1, 1].  相似文献   

7.
Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:VA induces an edge labeling f:EA defined by f(xy)=f(x)+f(y). For iA, let vf(i)=card{vV:f(v)=i} and ef(i)=card{eE:f(e)=i}. A labeling f is said to be A-friendly if |vf(i)−vf(j)|≤1 for all (i,j)∈A×A, and A-cordial if we also have |ef(i)−ef(j)|≤1 for all (i,j)∈A×A. When A=Z2, the friendly index set of the graph G is defined as {|ef(1)−ef(0)|:the vertex labelingf is Z2-friendly}. In this paper we completely determine the friendly index sets of 2-regular graphs. In particular, we show that a 2-regular graph of order n is cordial if and only if n?2 (mod 4).  相似文献   

8.
Let {? i } i=∩ n be continuous real functions on the compact set M?R. We consider the problem of best uniform approximation of the function? by polynomials \(\sum\nolimits_{i = 1}^n {c_i \varphi _i }\) on M. Let V(?0, A) be a set of polynomials of best approximation on A ? M. We show that \(V(\varphi _0 ,M) = \mathop \cap \limits_{A_{n + 1} } V(\varphi _0 ,A_{n + 1} )\) , where An+1 represents all the possible sets of n+ 1 points {x1, ..., xn+1} in M, containing the characteristic set of the given problem of best approximation and for which the the rank of ∥?i ∥ (i=1, ...,n; j=1,..., n+1) is equal to n. This theorem is applied to a problem of uniform approximation where {? i } i=1 n is a weakly Chebyshev system.  相似文献   

9.
Denote by span {f 1,f 2, …} the collection of all finite linear combinations of the functionsf 1,f 2, … over ?. The principal result of the paper is the following. Theorem (Full Müntz Theorem in Lp(A) for p ∈ (0, ∞) and for compact sets A ? [0, 1] with positive lower density at 0). Let A ? [0, 1] be a compact set with positive lower density at 0. Let p ∈ (0, ∞). Suppose (λ j ) j=1 is a sequence of distinct real numbers greater than ?(1/p). Then span {x λ1,x λ2,…} is dense in Lp(A) if and only if $\sum\limits_{j = 1}^\infty {\frac{{\lambda _j + \left( {1/p} \right)}}{{\left( {\lambda _j + \left( {1/p} \right)} \right)^2 + 1}} = \infty } $ . Moreover, if $\sum\limits_{j = 1}^\infty {\frac{{\lambda _j + \left( {1/p} \right)}}{{\left( {\lambda _j + \left( {1/p} \right)} \right)^2 + 1}} = \infty } $ , then every function from the Lp(A) closure of {x λ1,x λ2,…} can be represented as an analytic function on {z ∈ ? \ (?∞,0] : |z| < rA} restricted to A ∩ (0, rA) where $r_A : = \sup \left\{ {y \in \mathbb{R}:\backslash ( - \infty ,0]:\left| z \right|< r_A } \right\}$ (m(·) denotes the one-dimensional Lebesgue measure). This improves and extends earlier results of Müntz, Szász, Clarkson, Erdös, P. Borwein, Erdélyi, and Operstein. Related issues about the denseness of {x λ1,x λ2,…} are also considered.  相似文献   

10.
We study the behavior of measure-preserving systems with continuous time along sequences of the form {n α}n∈#x2115;} where α is a positive real number1. Let {S t } t∈? be an ergodic continuous measure preserving flow on a probability Lebesgue space (X, β, μ). Among other results we show that:
  1. For all but countably many α (in particular, for all α∈???) one can find anL -functionf for which the averagesA N (f)(1/N)=Σ n=1 N f(S nα x) fail to converge almost everywhere (the convergence in norm holds for any α!).
  2. For any non-integer and pairwise distinct numbers α1, α2,..., α k ∈(0, 1) and anyL -functionsf 1,f 2, ...,f k , one has $$\mathop {lim}\limits_{N \to \infty } \left\| {\frac{1}{N}\sum\limits_{n - 1}^N {\prod\limits_{i - 1}^k {f_i (S^{n^{\alpha _i } } x) - \prod\limits_{i - 1}^k {\int_X {f_i d\mu } } } } } \right\|_{L^2 } = 0$$
We also show that Furstenberg’s correspondence principle fails for ?-actions by demonstrating that for all but a countably many α>0 there exists a setE?? having densityd(E)=1/2 such that, for alln∈?, $$d(E \cap (E - n^\alpha )) = 0$$ .  相似文献   

11.
Let {xn} be a sequence of real numbers and let a(n) be a sequence of positive real numbers, with A(N) = Σn=1Na(n). Tsuji has defined a notion of a(n)-uniform distribution mod 1 which is related to the problem of determining those real numbers t0 for which A(N)?1 Σn=1Na(n)e?it0xn → 0 as N → ∞. In case f(s) = Σn=1a(n)e?sxn, s = σ + it, is analytic in the right half-plane 0 < σ, and satisfies a certain smoothness condition as σ → 0 +, we show that f(σ)?1f(σ + it0) → 0 as σ → 0 + if and only if A(N)?1 Σn=1Na(n)e?it0xn → 0 as N → ∞.  相似文献   

12.
The local behavior of the iterates of a real polynomial is investigated. The fundamental result may be stated as follows: THEOREM. Let xi, for i=1, 2, ..., n+2, be defined recursively by xi+1=f(xi), where x1 is an arbitrary real number and f is a polynomial of degree n. Let xi+1?xi≧1 for i=1, ..., n + 1. Then for all i, 1 ≦i≦n, and all k, 1≦k≦n+1?i, $$ - \frac{{2^{k - 1} }}{{k!}}< f\left[ {x_1 ,... + x_{i + k} } \right]< \frac{{x_{i + k + 1} - x_{i + k} + 2^{k - 1} }}{{k!}},$$ where f[xi, ..., xi+k] denotes the Newton difference quotient. As a consequence of this theorem, the authors obtain information on the local behavior of the solutions of certain nonlinear difference equations. There are several cases, of which the following is typical: THEOREM. Let {xi}, i = 1, 2, 3, ..., be the solution of the nonlinear first order difference equation xi+1=f(xi) where x1 is an arbitrarily assigned real number and f is the polynomial \(f(x) = \sum\limits_{j = 0}^n {a_j x^j } ,n \geqq 2\) . Let δ be positive with δn?1=|2n?1/n!an|. Then, if n is even and an<0, there do not exist n + 1 consecutive increments Δxi=xi+1?xi in the solution {xi} with Δxi≧δ. The special case in which the iterated polynomial has integer coefficients leads to a “nice” upper bound on a generalization of the van der Waerden numbers. Ap k -sequence of length n is defined to be a strictly increasing sequence of positive integers {x 1, ...,x n } for which there exists a polynomial of degree at mostk with integer coefficients and satisfyingf(x j )=x j+1 forj=1, 2, ...,n?1. Definep k (n) to be the least positive integer such that if {1, 2, ...,p k (n)} is partitioned into two sets, then one of the two sets must contain ap k -sequence of lengthn. THEOREM. pn?2(n)≦(n!)(n?2)!/2.  相似文献   

13.
14.
Abstract

A highly flexible nonparametric regression model for predicting a response y given covariates {xk}d k=1 is the projection pursuit regression (PPR) model ? = h(x) = β0 + ΣjβjfjT jx) where the fj , are general smooth functions with mean 0 and norm 1, and Σd k=1α2 kj=1. The standard PPR algorithm of Friedman and Stuetzle (1981) estimates the smooth functions fj using the supersmoother nonparametric scatterplot smoother. Friedman's algorithm constructs a model with M max linear combinations, then prunes back to a simpler model of size MM max, where M and M max are specified by the user. This article discusses an alternative algorithm in which the smooth functions are estimated using smoothing splines. The direction coefficients αj, the amount of smoothing in each direction, and the number of terms M and M max are determined to optimize a single generalized cross-validation measure.  相似文献   

15.
Konrad Engel 《Combinatorica》1984,4(2-3):133-140
LetP be that partially ordered set whose elements are vectors x=(x 1, ...,x n ) withx i ε {0, ...,k} (i=1, ...,n) and in which the order is given byxy iffx i =y i orx i =0 for alli. LetN i (P)={x εP : |{j:x j ≠ 0}|=i}. A subsetF ofP is called an Erdös-Ko-Rado family, if for allx, y εF it holdsxy, x ≯ y, and there exists az εN 1(P) such thatzx andzy. Let ? be the set of all vectorsf=(f 0, ...,f n ) for which there is an Erdös-Ko-Rado familyF inP such that |N i (P) ∩F|=f i (i=0, ...,n) and let 〈?〉 be its convex closure in the (n+1)-dimensional Euclidean space. It is proved that fork≧2 (0, ..., 0) and \(\left( {0,...,0,\overbrace {i - component}^{\left( {\begin{array}{*{20}c} {n - 1} \\ {i - 1} \\ \end{array} } \right)}k^{i - 1} ,0,...,0} \right)\) (i=1, ...,n) are the vertices of 〈?〉.  相似文献   

16.
Let 〈h n 〉 denote a sequence of positive real numbers. We show that for every set A ? ? there exists a function f: ? → ω such that A = {x ∈ ?: (∈〈h n 〉)[h n ↘ 0 & (? n ∈ ?)(f(x ? h n ) = f(x + h n ) = f(x))]}. This solves a problem of K. Ciesielski, K. Muthuvel and A. Nowik.  相似文献   

17.
Let At(i, j) be the transition matrix at time t of a process with n states. Such a process may be called self-adjusting if the occurrence of the transition from state h to state k at time t results in a change in the hth row such that At+1(h, k) ? At(h, k). If the self-adjustment (due to transition hkx) is At + 1(h, j) = λAt(h, j) + (1 ? λ)δjk (0 < λ < 1), then with probability 1 the process is eventually periodic. If A0(i, j) < 1 for all i, j and if the self-adjustment satisfies At + 1(h, k) = ?(At(h, k)) with ?(x) twice differentiable and increasing, x < ?(x) < 1 for 0 ? x < 1,?(1) = ?′(1) = 1, then, with probability 1, lim At does not exist.  相似文献   

18.
For a sequence A = {Ak} of finite subsets of N we introduce: δ(A) = infm?nA(m)2n, d(A) = lim infn→∞ A(n)2n, where A(m) is the number of subsets Ak ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b) constitutes a finite semi-group N (semi-group N) (group N1). For N, N we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for N, N, N1 analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {Akr}, where Akr | Akr+1 for r = 1, 2, …. In Section 6 we consider for N∪, N∩, N1 analogues of Rohrbach inequality: 2n ? g(n) ? 2n, where g(n) = min k over the subsets {a1 < … < ak} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = ai + aj.Pour une série A = {Ak} de sous-ensembles finis de N on introduit les densités: δ(A) = infm?nA(m)2m, d(A) = lim infn→∞ A(n)2nA(m) est le nombre d'ensembles Ak ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b, un semi-groupe fini N, N ou un groupe N1 respectivement. Pour N, N on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour N, N, N1 l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {Akr}, où Akr|Akr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N, N, N1 les analogues de l'inégalité de Rohrbach: 2n ? g(n) ? 2n, où g(n) = min k pour les ensembles {a1 < … < ak} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = ai + aj.  相似文献   

19.
For a number ? > 0 and a real function f on an interval [a, b], denote by N(?, f, [a, b]) the least upper bound of the set of indices n for which there is a family of disjoint intervals [a i , b i ], i = 1, …, n, on [a, b] such that |f(a i ) ? f(b i )| > ? for any i = 1, …, n (sup Ø = 0). The following theorem is proved: if {f j } is a pointwise bounded sequence of real functions on the interval [a, b] such that n(?) ≡ lim sup j→∞ N(?, f j , [a, b]) < ∞ for any ? > 0, then the sequence {f j } contains a subsequence which converges, everywhere on [a, b], to some function f such that N(?, f, [a, b]) ≤ n(?) for any ? > 0. It is proved that the main condition in this theorem related to the upper limit is necessary for any uniformly convergent sequence {f j } and is “almost” necessary for any everywhere convergent sequence of measurable functions, and many pointwise selection principles generalizing Helly’s classical theorem are consequences of our theorem. Examples are presented which illustrate the sharpness of the theorem.  相似文献   

20.
Let f,gi,i=1,…,l,hj,j=1,…,m, be polynomials on Rn and S?{xRngi(x)=0,i=1,…,l,hj(x)≥0,j=1,…,m}. This paper proposes a method for finding the global infimum of the polynomial f on the semialgebraic set S via sum of squares relaxation over its truncated tangency variety, even in the case where the polynomial f does not attain its infimum on S. Under a constraint qualification condition, it is demonstrated that: (i) The infimum of f on S and on its truncated tangency variety coincide; and (ii) A sums of squares certificate for nonnegativity of f on its truncated tangency variety. These facts imply that we can find a natural sequence of semidefinite programs whose optimal values converge, monotonically increasing to the infimum of f on S.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号