On the minimization of the product of the powers of several integrals

This paper considers the minimization of the product of the powers ofn integrals, each of which depends on a functiony(x) and its derivative . The necessary conditions for the extremum are derived within the frame of the Mayer-Bolza formulation of the calculus of variations, and it is shown that the extremal arc is governed by a second-order differential equation involvingn undetermined multipliers related to the unknown values of the integrals. After the general solution is combined with the definitions of the multipliers and the end conditions, a system ofn+2 algebraic equations is obtained; it involvesn+2 unknowns, that is, then undetermined multipliers and two integration constants.The procedure discussed here can be employed in the study of shapes which are aerodynamically optimum at supersonic, hypersonic, and free-molecular flow velocities, that is, wings and fuselages having the maximum lift-to-drag ratio or the minimum drag. The problem of a slender body of revolution having the minimum pressure drag in Newtonian hypersonic flow is developed as an example. First, a general solution is derived for any pair of conditions imposed on the length, the thickness, the wetted area, and the volume. Then, a particular case is treated, that in which the thickness and the wetted area are given, while the length and the volume are free; the shape minimizing the pressure drag is a cone.This research, supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67, is a condensed version of the investigation described in Ref. 1. The author is indebted to Messrs. H. Y. Huang, J. C. Heideman, and J. N. Damoulakis for analytical and numerical assistance.     

The Picard group of the forms of the affine line and of the additive group

We obtain an explicit upper bound on the torsion of the Picard group of the forms of ${\mathbb{A}}_k^1$ and their regular completions. We also obtain a sufficient condition for the Picard group of the forms of ${\mathbb{A}}_k^1$ to be nontrivial and we give examples of nontrivial forms of ${\mathbb{A}}_k^1$ with trivial Picard groups.     

Calculation of the SDE-contribution of the dissipation operator to the energy spectrum of developed turbulence

The nonanalytic correction to the energy spectrum of the developed turbulence in the one-loop approximation of ε-expansion is calculated. It has the form y⁴ ln u (u≡kL, L is the external scale of the turbulence), which is in agreement with Wilson's short distance expansion prediction. The amplitude of the contribution of the dissipation operator to the energy spectrum is determined. Bibliography: 7 titles. Dedicated to the memory of V. N. Popov Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 224, 1995, pp. 36–42. Translated by N. Yu. Netsvetaev.     

On the probability of union in the n-space

In this paper, our sets are orthants in $R^n$ and $N$, the number of them, is large ($N>n$). We introduce the modified inclusion–exclusion formula in order to efficiently calculate the probability of a union of such events. The new formula works in the bivariate case, and can also be used in $R^n,n\ge 3$ with a condition on the projected sets onto lower dimensional spaces. Numerical examples are presented.     

Hydroelastic phenomena in the neighborhood of the bifurcation of the aorta

The mechanical behavior of the vessels and the blood near a bifurcation is analyzed. A single-layer homogeneous shell is taken as a model of the aorta on the assumption that the intima is much less stiff than the other layers. In analyzing the blood flow in large vessels, the blood is treated as a viscous Newtonian liquid, whose motion is described by the Navier-Stokes equations and the continuity equation.Zhukovskii Air Force Engineering Academy, Moscow; Institute of Polymer Mechanics, Academy of Sciences of the Latvian SSR, Riga. Translated from Mekhanika Polimerov, No. 1, pp. 164–166, January–February, 1971.     

A note on the performance of the gamma kernel estimators at the boundary

The gamma kernel estimator is proposed in Chen [Chen, S.X., 2000. Probability density function estimation using gamma kernels. Annals of the Institute of Statistical Mathematics 52, 471–480] to estimate densities with support $[0,\infty )$. It is shown in his paper that the gamma kernel estimator is non-negative, free of boundary bias, and achieves the optimal rate of convergence for the mean integrated squared error. Numerical results reported in Chen’s paper show that, in the boundary region, the gamma kernel estimator even outperforms some widely used boundary corrected density estimators such as the boundary kernel estimator. However, our study finds that the gamma kernel estimator at $x=0$ is actually the reflection estimator when the double exponential kernel is used and is only boundary problem free when the estimated density has a shoulder at $x=0$ (i.e., the first derivative of the density at $x=0$ is zero). For densities not satisfying the shoulder condition, we show that the gamma kernel estimator has a severe boundary problem and its performance is inferior to that of the boundary kernel estimator.     

Numerical analysis of the spectrum of the Orr-Sommerfeld problem

A high-accuracy method for computing the eigenvalues λ _n and the eigenfunctions of the Orr-Sommerfeld operator is developed. The solution is represented as a combination of power series expansions, and the latter are then matched. The convergence rate of the expansions is analyzed by applying the theory of recurrence equations. For the Couette and Poiseuille flows in a channel, the behavior of the spectrum as the Reynolds number R increases is studied in detail. For the Couette flow, it is shown that the eigenvalues λ _n regarded as functions of R have a countable set of branch points R _k > 0 at which the eigenvalues have a multiplicity of 2. The first ten of these points are presented within ten decimals.     

Toll number of the Cartesian and the lexicographic product of graphs

Toll convexity is a variation of the so-called interval convexity. A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\in V\left(G\right)$ is a set $T_G(u,v)=\{x\in V\left(G\right):x\text{ lies on a tolled walk between }u\text{ and }v\}$. A set $S?V\left(G\right)$ is toll convex, if $T_G(u,v)?S$ for all $u,v\in S$. A toll closure of a set $S?V\left(G\right)$ is the union of toll intervals between all pairs of vertices from $S$. The size of a smallest set $S$ whose toll closure is the whole vertex set is called a toll number of a graph $G$, $tn\left(G\right)$. The first part of the paper reinvestigates the characterization of convex sets in the Cartesian product of two graphs. It is proved that the toll number of the Cartesian product of two graphs equals 2. In the second part, the toll number of the lexicographic product of two graphs is studied. It is shown that if $H$ is not isomorphic to a complete graph, $tn(G°H)\le 3?tn\left(G\right)$. We give some necessary and sufficient conditions for $tn(G°H)=3?tn\left(G\right)$. Moreover, if $G$ has at least two extreme vertices, a complete characterization is given. Furthermore, graphs with $tn(G°H)=2$ are characterized. Finally, the formula for $tn(G°H)$ is given — it is described in terms of the so-called toll-dominating triples or, if $H$ is complete, toll-dominating pairs.     

On the difference property of the family of functions with the Baire property

We show that it is consistent with ZFC that the family of functions with the Baire property has the difference property. That is, every function for which f(x + h)-f(x) has the Baire property for every h∈R is of the form f=g + Awhere g has the Baire property and A is additive. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the mixing time of the flip walk on triangulations of the sphere

A simple way to sample a uniform triangulation of the sphere with a fixed number n of vertices is the Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound of order $n^{5/4}$ on the mixing time of this Markov chain.     

On the vertices of the -additive core

The core of a game v on N, which is the set of additive games φ dominating v such that φ(N)=v(N), is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the k-additive core by replacing additive games by k-additive games in the definition of the core, where k-additive games are those games whose Möbius transform vanishes for subsets of more than k elements. For a sufficiently high value of k, the k-additive core is nonempty, and is a convex closed polyhedron. Our aim is to establish results similar to the classical results of Shapley and Ichiishi on the core of convex games (corresponds to Edmonds’ theorem for the greedy algorithm), which characterize the vertices of the core.     

Determination of the element numbers of the regular polytopes

Let ?? be a set of n-dimensional polytopes. A set ?? of n-dimensional polytopes is said to be an element set for ?? if each polytope in ?? is the union of a finite number of polytopes in ?? identified along (n ? 1)-dimensional faces. The element number of the set ?? of polyhedra, denoted by e(??), is the minimum cardinality of the element sets for ??, where the minimum is taken over all possible element sets ${\Omega \in \mathcal{E}(\Sigma)}$ . It is proved in Theorem 1 that the element number of the convex regular 4-dimensional polytopes is 4, and in Theorem 2 that the element numbers of the convex regular n-dimensional polytopes is 3 for n ?? 5. The results in this paper together with our previous papers determine completely the element numbers of the convex regular n-dimensional polytopes for all n ?? 2.