Асимптоический Анализ Распределения Статистики Диксона

. u 60-u u     

On the exactness of a theorem of G.A. Fomin

, . . [1] - . .     

О числе Делителей “Сдвинутых” Простых чисел-Близнецов

.      

Sur la répartition des valeurs de la fonction d'Euler

Let (x) denote the number of those integers n with (n) x, where denotes the Euler function. Improving on a well-known estimate of Bateman (1972), we show that (x)-Ax R(x), where A=(2)(3)/(6) and R(x) is essentially of the size of the best available estimate for the remainder term in the prime number theorem.     

Properties of Solutions to Second Order Evolution Control Systems. II

We continue the research of the first part of the article. We mainly study codensity for the set of admissible trajectory-control pairs of a system with nonconvex constraints in the set of admissible trajectory-control pairs of the system with convexified constraints. We state necessary and sufficient conditions for the set of admissible trajectory-control pairs of a system with nonconvex constraints to be closed in the corresponding function spaces. Using an example of a control hyperbolic system, we give an interpretation of the abstract results obtained. As application we consider the minimization problem for an integral functional on solutions of a control system.     

Moser-type inequalities in Lorentz spaces

Moser-type estimates for functions whose gradient is in the Lorentz space L(n, q), 1q, are given. Similar results are obtained for solutions uH _inf0 ^sup1 of Au=(f _i ) _{x i} , where A is a linear elliptic second order differential operator and |f|L(n, q), 2q.Work partially supported by MURST (40%).     

Regularity,partial regularity,partial information process,for a filtered statistical model

Summary We define partial regularity for a filtered statistical (semi-parametric) model indexed by ^d , as differentiability in a suitable sense of the partial likelihoods associated with a basic processX. Partial regularity turns out to be equivalent to some sort of differentiability in of the characteristics ofX. We also prove that regularity of the model implies partial regularity, and we define a partial information process, which is smaller than the complete information process. We apply these results to obtain a generalization of Cramer-Rao inequality, and to prove that partial likelihood processes are optimal among all quasi-likelihood processes which are stochastic integrals with respect to the basic processX.     

Convex Separable Minimization Subject to Bounded Variables

A minimization problem with convex and separable objective function subject to a separable convex inequality constraint and bounded variables is considered. A necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem. Convex minimization problems subject to linear equality/linear inequality constraint, and bounds on the variables are also considered. A necessary and sufficient condition and a sufficient condition, respectively, are proved for a feasible solution to be an optimal solution to these two problems. Algorithms of polynomial complexity for solving the three problems are suggested and their convergence is proved. Some important forms of convex functions and computational results are given in the Appendix.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

0-1-sequences of Toeplitz type

Summary 0-1-sequences are constructed by successive insertion of a periodic sequence of symbols 0, 1 and hole into the holes of the sequence already constructed. Assuming that finally all holes are filled with symbols 0, 1, an almost periodic point in shift space results. Under certain conditions, it is even strictly ergodic. It is proved that the attached invariant measure has pure point spectrum, and a rather explicit expression for eigenvectors is obtained.     

On the Heyde Theorem for Finite Abelian Groups

It is well-known Heyde's characterization theorem for the Gaussian distribution on the real line: if _j are independent random variables, _j , _j are nonzero constants such that _i ± _j ^–1 _j 0 for all i j and the conditional distribution of L ₂=_{1 1} + ··· + _{n n} given L ₁=_{1 1} + ··· + _{n n} is symmetric, then all random variables _j are Gaussian. We prove some analogs of this theorem, assuming that independent random variables take on values in a finite Abelian group X and the coefficients _j , _j are automorphisms of X.     

Direct and converse imbedding theorems for seminormed spaces

. n=2 . ., 103 498      

On convergence of multiparameter strong submartingales in Banach lattices

- , ., B - — , B- {M _n ,nN ^d } n. .     

Independence in hypergraphs

Suppose an integral function (|A|)q₁ defined on the subsets of edges of a hypergraph (X,u,) satisfies the following two conditions: 1) any set W u such that |A|(|A|) for any AW is matroidally independent; 2) if W is an independent set, then there exists a unique partitionW=T₁+ T₂+...+T_v such that |T ⁱ |=(|T ⁱ |),i1:v, and for any AW, |A|(|A|) there exists a T_i such that AT_i. The form of such a function is found, in terms of parameters of generalized connected components, hypercycles, and hypertrees.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 196–204, 1982.     

Isolation theorem for forms corresponding to purely real algebraic fields

Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X₀₎| for some integer vector X₀ 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.     

Sûto's method applied to a problem of Färe and Mitchell

Summary A real solution of the functional equation(x + (y – x)) = f(x) + g(y) + h(x)k(y) on a set ² is a 6-tuple (f, g, h, k, , ) of real valued functions such that the equation is identically fulfilled on. Except for cases known before—e.g. when is linear—we present all real solutions in an arbitrary region where the functions have derivatives of second order.     

The possibility of integral formulas in R n

We consider the integral We solve the problem of determination of necessary and sufficient conditions in order that (u) be independent of the values of u(x) inside a bounded domain . These conditions are written in the form of a set of differential equations for the functions f(x,u,¯p,T^ij) on the set m{x; u+¯p+ T^ij<}. For such functions (u) is represented in the form of a boundary integral.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 52, pp. 35–51, 1975.     

Sensitivity analysis methods for a crop-mix problem in linear programming

Summary Four different methods of analyzing the sensitivity of the optimal solution of a crop-mix problem in linear programming, e. g., (a) variability analysis for second-best and third-best solutions, (b) perturbation analysis around a specific optimal basis, (c) the sensitivity coefficient approach, and (d) the method of fractile criterion by which a specified fractile of the distribution of profits is maximized, are investigated here. The objective is to compare the different operational methods of sensitivity analysis applied to an empirical economic problem.

---

Zusammenfassung Die vorliegende Arbeit behandelt vier Methoden zur Untersuchung der Sensitivität der optimalen Lösung eines crop-mix-Problems der linearen Programmierung: a) variability analysis für zweit- und drittbeste Lösungen, b) perturbation analysis der optimalen Basis, c) das sensitivity-coefficient-Verfahren und d) die fractile-criterion-Methode, durch die ein bestimmter Teil der Gewinnverteilung maximiert wird. Ziel der Arbeit ist ein Vergleich der Methoden bezüglich ihrer Anwendung auf empirische ökonomische Probleme.

---

---

Work done under the NSF Projects 420-21-17 and 420-04-62 at the Department of Economics, Iowa State University, Ames, Iowa. Other research work closely related to this paper may be found inSengupta; Sengupta-Portillo-Campbell; Sengupta-Tintner.     

Adjungierte Funktoren in der Kategorie der p-Bornologischen Räume

In the category p b of p-convex vector spaces and linear maps preserving bounded sets a p-bornological topology will be introduced on the tensor product of two spaces, likewise on the spaces of morphisms Hom(E,F). Thus one gets a pair of adjoint functors from p to p , p being the category of p-bornological spaces and continuous linear maps, and the topologies being introduced will be characterized by extreme properties with respect to the adjoint transformations.

---

---

Dieser Arbeit liegt ein Teil der Dissertation des Autors, Kiel 1967, zugrunde.     

Nonexistence of new order-9 projective plane with order-13 collineation

The order-9 Desarguesian projective plane and the known self-dual non-Desarguesian plane (Carmichael or Hughes plane) each have a 13-collineation displacing all points and all lines. We show that no previously undiscovered 9-plane has this property.