Search

In Sec. 1 a correction is given of the estimate of the Hausdorff dimension and an estimate of the fractal dimension of a bounded subset of a Hilbert space, semiinvariant with respect to a flattening transformation. In Sec. 2 the results, proved by the author for semigroups with a continuous group parameter t∈R+≡[0, ∞), are carried over to the case when t runs through the semigroup ℑ+≡{t∈ℑ∣t⩾0} of some additive group ℑ⊂R=(−∞, ∞).

In Venkaiah [1] an algorithm for solving linear optimization problems based on the idea of the projective algorithm of Karmarkar, is proposed. The essential simplification in the new algorithm is the use of a fixed projection operator. In this way the algorithm requires onlyO(n2) operations to obtain a sufficient exact solution. In this note it is shown that in some special cases the algorithm of Venkaiah yields a feasible solution that is far from the optimal one.

In the previous paper [T] we gave a classification of hermitian forms over the real function fieldk=R(t) and its completionsk v with respect to valuationsv trivial onR. Unfortunately in the local case the arguments given for cases A and D, in general, were not correct. Therefore the resulting local and local-global classifications obtained were incorrect. I would like also to thank Dr. D. Hoffmann for pointing out these mistakes and the referee for useful comments. Here we would like to make necessary corrections to [T]. We keep the same notation used there, except that in the first paragraph,J is not the standard involution of a quaternion division algebraD (with basis {1,i,j,ij}). All hermitian forms will be hermitian forms with respect toJ, with values inD.

We show functoriality of γα in our joint paper with A. Csaszar “Further remarks on δ- and θ-modifications”.

Professor Zbigniew Lipecki from the University of Wroclaw has told me that the definition of “small ball property” introduced in the paper “Metric spaces with the small ball property” by E. Behrends and V. Kadets (Studia Math. 148, No. 3, 275-287, 2001), has been investigated under different names earlier in the literature and that some of the results in this paper and in my paper quoted in the title are rediscoveries of known facts. In particular this applies to Proposition 2.3. I am grateful to Professor Lipecki for providing the following references to us: – Ch. Bandt, Mathematika 28 (1981), 206-210. – R. Duda and R. Telgarsky, Czechoslovak Math. J. 18(93) (1968), 66-82. – E. Szpilrajn-Marczewski, Fund. Math. 15 (1930), 126-27. – E. Szpilrajn-Marczewski, Fund. Math. 22 (1934), 303-311. – B. Tsaban, Real Analysis Exchange 27 (2001/2002), 757-764.

An existence theorem is proved for closed convex surfaces whose principal radii of curvature regarded as functions of the unit normal vectorn satisfy the equation $$R_1 R_2 + \Phi (R_1 + R_2 ,R_1 ,R_2 ,n) + c \cdot n = \varphi (n),$$ wheree is an unknown constant vector being sought along with the surface. This equation has been studied by Miranda, who proved a variety of existence and uniqueness theorems about its solutions. The results obtained lead to a certain simplification in the hypotheses imposed on the functions Φ andϕ in these theorems.

In the paper [1], the authors obtain a KAM theorem for nearly integrable hamiltonian systems under the Russmann’s non-degeneracy condition, which is known to be sharpest one for small divisor conditions. However, the Remark 1.3 is wrong because we have ignored the null set − ∗, which may contain zeros of ω of high order such that (1.4) does not hold for all p ∈ . The Remark 1.3 might mislead the readers that the condition (1.5) of Theorem B is equivalent to the Russmann’s non-degeneracy condition. Actually, the Russmann’s non-degeneracy condition is equivalent to the condition (1.4) of Theorem A as proved in [1]. Under the Russmann’s non-degeneracy condition (1.4), as proved in the Remark 3.1 the condition (1.5) holds if we replace n − 1 by a sufficiently large number N depending on h, and then the conclusion of Theorem B remains valid if in the measure estimate n − 1 is replaced by N .

We note that Theorem 5.4 of the paper ``Characteristic cycles of perverse sheaves and Milnor fibers" (by P. Nang and K. Takeuchi, published online in Math. Zeitschrift, October 15, 2004) holds for "any" non-zero complex number $a$., Comment: 1page

Månsson and Shukur (Econ Model 28:1475–1481, 2011) proposed a Poisson ridge regression estimator (PRRE) to reduce the negative effects of multicollinearity. However, a weakness of the PRRE is its relatively large bias. Therefore, as a remedy, Türkan and Özel (J Appl Stat 43:1892–1905, 2016) examined the performance of almost unbiased ridge estimators for the Poisson regression model. These estimators will not only reduce the consequences of multicollinearity but also decrease the bias of PRRE and thus perform more efficiently. The aim of this paper is twofold. Firstly, to derive the mean square error properties of the Modified Almost Unbiased PRRE (MAUPRRE) and Almost Unbiased PRRE (AUPRRE) and then propose new ridge estimators for MAUPRRE and AUPRRE. Secondly, to compare the performance of the MAUPRRE with the AUPRRE, PRRE and maximum likelihood estimator. Using both simulation study and real-world dataset from the Swedish football league, it is evidenced that one of the proposed, MAUPRRE ($$ \hat{k}_{q4} $$ k ^ q 4 ) performed better than the rest in the presence of high to strong (0.80–0.99) multicollinearity situation.

This paper deals with Schrodinger operators as they were treated by Kato - Ikebe [3]. It is shown that every element of the domain of definition of the adjoint of such an operator has locally square integrable distributional derivatives up to the order 2. For this the potential of the Schrodinger operator must fulfil a local Stummel condition; if the potential is only locally square integrable a somewhat weaker statement is possible for three dimensions (see remark 2 at the end of this paper).

This paper presents a review of the elementary theories on the bending of straight and curved beams, on plates and shells, using asymptotic approximations of the basic linearized equations of elasticity in three dimensions. The maximun norm has been chosen to specify the orders of magnitude of the quantities involved. The expansions are given as usual in terms of the small geometrical parameter characterizing the thinness of the structure. Most of the ideas and results are well known. Nevertheless, in the cases where more than one small parameter may be involved, such as small curvatures (shallow structures) or the small loading parameter used to linearize the equations of elasticity, the discussion on the limits of validity of the different theories lead to some interesting newer aspects. Moreover, the main ideas presented in this paper concerning multiple parameter expansions may be applied to discuss the behaviour of the structures and to obtain valuable analytical results in more complicated situations such as moderate and strong anisotropy, dynamic problems, stability etc.

Supplement to the paper cited in the title. One presents the results of the calculations on an electronic computer, by the method developed in that paper, proving Minkowski's conjecture regarding the critical determinant of the region ∣x∣p+∣y∣p 2.035 and for 1.01⩽p⩽1.99.

In the mentioned paper of Hadwiger an upper bound is given for α (A)·N(A), where α (A) is the density of covering ℝn by lattice translates ofA⊂ℝn andN(A) is the number of neighbours ofA. Using “dual” descriptions of α (A) andN(A), in the paper a sharpening of Hadwiger's inequality as well as a lower bound for α (A)·N(A) are proved.

Why do I think that Z.v.G.II was an epoch-making paper? (1) It was the paradigm for subsequent efforts to classify the possible structures for any mathematical object. Hawkins [15] documents the fact that Killing’s paper was the immediate inspiration for the work of Cartan, Molien, and Maschke on the structure of linearassociative algebras which culminated in Wedderburn’s theorems. Killing’s success was certainly an example which gave Richard Brauer the will to persist in the attempt to classify simple groups. (2) Weyl’s theory of the representation of semi-simple Lie groups would have been impossible without ideas, results, and methods originated by Killing in Z.v.G.II. Weyl’s fusion of global and local analysis laid the basis for the work of Harish-Chandra and the flowering of abstract harmonic analysis. (3) The whole industry of root systems evinced in the writings of I. Macdonald, V. Kac, R. Moody, and others started with Killing. For the latest see [21]. (4) The Weyl group and the Coxeter transformation are in Z.v.G.II. There they are realized not as orthogonal motions of Euclidean space but as permutations of the roots. In my view, this is the proper way to think of them for general Kac-Moody algebras. Further, the conditions for symmetrisability which play a key role in Kac’s book [17] are given on p. 21 of Z.v.G.II. (5) It was Killing who discovered the exceptional Lie algebra E8, which apparently is the main hope for saving Super-String Theory—not that I expect it to be saved! (6) Roughly one third of the extraordinary work of Elie Cartan was based more or less directly on Z.v.G.II.

Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant question is whether one can give a polynomial-time characterization of submodular instances, for prominent cooperative games that are in general non-convex. In this paper, we focus on a fundamental and widely studied cooperative game, namely the spanning tree game. An efficient recognition of submodular instances of this game was not known so far, and explicitly mentioned as an open question in the literature. We here settle this open problem by giving a polynomial-time characterization of submodular spanning tree games.

In a paper which appeared a few years ago the authors investigated the exponential representation of functions analytic in the upper half-plane with positive imaginary part there [1]. We refer to that paper in the sequel as A-D. One of the principal results of A-D, there called Theorem A, can be extended to a considerably more general result, the proof of which is perhaps simpler than that given in A-D. We give the extended version of Theorem A here. We will use the notations and results of A-D without further explanations. Before we present the extension and its proof we would like to add some information that by oversight was omitted from the list of fundamental properties of the functions in the class P given in Section 1 of A-D. In such a comprehensive review one should mention that the classical theorem on representation of a positive harmonic function in a circle by a Poisson-Stieltjes integral is due to G. Herglotz [2]. The following results of L. H. Loomis [3] were not given: XVII. For all ~ for which /t[~] = O, the limits lira Im[~b(~ + iq)] ~l~ O and lira hOg(A) exist and are f ini te simultaneously and are equal. Their ~ 0 common value is the symmetric derivative of #(A) at 2 = ~ multiplied by ~r. XVIII. I f for two values of 0 in the interval 0 < 0 < ~

In a recent paper M.C. Cheng proposed new criteria for the simplex algorithm which guarantee that (i) a nonbasic variable of a basic feasible solution will remain nonbasic in an optimal basic solution, (ii) a basic variable of a basic solution will remain basic in an optimal basic solution. This comment gives (i) a slight generalization of the first result and (ii) a counterexample to the second proposition.

Let A be a partition of the segment [0, 1] into a countable number of disjoint subsets of positive measure, let t∈L1(0,1), let Nt be the smallest rearrangement-invariant order ideal vector lattice in L1(0,1), containing t. In the paper one investigates the properties of the image E(Nt¦A) of the averaging operator with respect to A. In particular, one elucidates under what conditions there exists a function g, g∈L1(0,1), such that E(Nt¦A)⊂Ng. One formulates a generalization of the known Hardy-Littlewood inequality, namely Theorem E(t∣A)≺QE(t*∣A*), where ≺ is the Hardy-Littlewood preorder, t* and A* are the decreasing rearrangements of the function ¦t¦ and (in a special sense) of the partition A, while Q is an absolute constant, 1⩽Q⩽25. One formulates the problem of the smallest value of Q.

One gives an application of the results of the paper mentioned in the title to the problem of the range of the system of initial coefficients on the class Vk,λ(k⩾2, 0⩽λ

The paper ‘A Homological Foundation for Scale Problems in Physics’ (Atkin & Bastin, 1970) is criticised on account of several inconsistencies in the argument. Possible applications of the general ideas used are then discussed in the context of a ‘quantum logic’ type of framework.

It is pointed out that theL1 convergence classes of Fourier series of even functions considered in [2] and [3] are subclasses of theL1 convergence classes of Fomin [7]. Moreover, showing the simple fact that for eachp>1 the classesCp andVp considered in [2] coincide, whereCp={(ak):ak=o (1) and\(n^{p - 1} \sum\limits_{k = n}^\infty {\left| {\Delta _{ak} } \right|^p = o} \left( 1 \right)\)}, it follows that the main result in [2] reduces to an earlier theorem of Fomin [5]. Other equivalent descriptions of these classes are also given.

It is shown that unbranched proper holomorphic maps between pseudoconvex domains with smooth C∞ boundaries, one of which satisfies subelliptic estimates for the\(\bar \partial\)-Neumann problem on (0,1)-forms, extend to unbranched C∞-coverings between the closures of the domains.