New Identities for Hall-Littlewood Polynomials and Applications

Starting from Macdonald's summation formula of Hall-Littlewood polynomials over bounded partitions and its even partition analogue, Stembridge (Trans. Amer. Math. Soc., 319(2), (1990) 469–498) derived sixteen multiple q-identities of Rogers–Ramanujan type. Inspired by our recent results on Schur functions (Adv. Appl. Math., 27, (2001) 493–509) and based on computer experiments we obtain two further such summation formulae of Hall-Littlewood polynomials over bounded partitions and derive six new multiple q-identities of Rogers–Ramanujan type. 2000 Mathematics Subject Classification: Primary–05A19; Secondary–05A17, 05A30     

TheN −1-property of maps and Luzin's condition (N)

A functionf∶G→ℝ ⁿ , whereG is an open set in ℝ ⁿ , has theN ⁻¹-property if for allE⊂ℝ ⁿ we have {|E|=0⇒|f ⁻¹(E)|=0} (|·| is the Lebesgue measure). The article is concerned with the relations between theN ⁻¹-property of functions, the maximal rank of derivatives, and the differentiability almost everywhere of composite functions. Translated fromMatematicheskie Zametki, Vol. 58. No. 3, pp. 411–418, September, 1995.     

Maximum principle for fully nonlinear equations via the iterated comparison function method

We present various versions of generalized Aleksandrov–Bakelman–Pucci (ABP) maximum principle for L ^p -viscosity solutions of fully nonlinear second-order elliptic and parabolic equations with possibly superlinear-growth gradient terms and unbounded coefficients. We derive the results via the “iterated” comparison function method, which was introduced in our previous paper (Koike and Święch in Nonlin. Diff. Eq. Appl. 11, 491–509, 2004) for fully nonlinear elliptic equations. Our results extend those of (Koike and Święch in Nonlin. Diff. Eq. Appl. 11, 491–509, 2004) and (Fok in Comm. Partial Diff. Eq. 23(5–6), 967–983) in the elliptic case, and of (Crandall et al. in Indiana Univ. Math. J. 47(4), 1293–1326, 1998; Comm. Partial Diff. Eq. 25, 1997–2053, 2000; Wang in Comm. Pure Appl. Math. 45, 27–76, 1992) and (Crandall and Święch in Lecture Notes in Pure and Applied Mathematics, vol. 234. Dekker, New York, 2003) in the parabolic case. Dedicated to Hitoshi Ishii on the occasion of his 60th birthday.     

Likelihood ratio tests for comparingk populations —The two-parameter nonregular models

Summary The null and nonnull distributions of the likelihood ratio statistics for testing the homogeneity ofk given populations, each associated with a nonregular density depending on two truncation parameters, are investigated. This generalizes to the two-parameter case the work of Hogg (1956,Ann. Math. Statist.,27, 529–532), Barr (1966,J. Amer. Statist. Assoc.,61, 856–864) and Khatri and Jaiswal (1969,Aust. J. Statist.,11, 79–84; 1969, 1971,Ann. Inst. Statist. Math.,21, 127–136;23, 199–210).     

Positive definite probability densities and probability distributions

In the first short survey article [H.-J. Rossberg,Wiss. Z. Karl Marx Univ.,37, 366–374 (1988)] the author indicated that positive definite probability densities deserve attention and that the investigation of this class leads to serious new mathematical problems. Later [R. Riedel and H.-J. Rossberg,Metrika, (submitted for publication)] it turned out that it is worthwhile to consider an even larger class of distribution functions, namely those having characteristic function f≥0; they were first briefly considered in [P. Lévy,C. R. Acad. Sci.,265, 249–252 (1967)]. We survey the basic ideas and the present state of the developing new theory; moreover, we formulate open problems. Some new results are proved. For the sake of brevity we do not enter into a discussion of continuation problems and limit theorems; for these subjects see [H.-J. Rossberg,Appendix to Gnedenko B. W., Einführung in die Wahrscheinlichkeitstheorie, 9th ed., Akademie-Verlag, Berlin (1991)], [H.-J. Rossberg,Math. Nachr.,141, 227–232 (1989)], and [H.-J. Rossberg,Lect. Notes Math.,1412, 296–308 (1989)]. Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, 1993.     

An example of a commutative basic algebra which is not an MV-algebra

Many algebras arising in logic have a lattice structure with intervals being equipped with antitone involutions. It has been proved in [CHK1] that these lattices are in a one-to-one correspondence with so-called basic algebras. In the recent papers [BOTUR, M.—HALAŠ, R.: Finite commutative basic algebras are MV-algebras, J. Mult.-Valued Logic Soft Comput. (To appear)]. and [BOTUR, M.—HALAŠ, R.: Complete commutative basic algebras, Order 24 (2007), 89–105] we have proved that every finite commutative basic algebra is an MV-algebra, and that every complete commutative basic algebra is a subdirect product of chains. The paper solves in negative the open question posed in [BOTUR, M.—HALAŠ, R.: Complete commutative basic algebras, Order 24 (2007), 89–105] whether every commutative basic algebra on the interval [0, 1] of the reals has to be an MV-algebra.     

A shorter proof of Kanter’s Bessel function concentration bound

We give a shorter proof of Kanter’s (J. Multivariate Anal. 6, 222–236, 1976) sharp Bessel function bound for concentrations of sums of independent symmetric random vectors. We provide sharp upper bounds for the sum of modified Bessel functions I₀(x) + I₁(x), which might be of independent interest. Corollaries improve concentration or smoothness bounds for sums of independent random variables due to Čekanavičius & Roos (Lith. Math. J. 46, 54–91, 2006); Roos (Bernoulli, 11, 533–557, 2005), Barbour & Xia (ESAIM Probab. Stat. 3, 131–150, 1999), and Le Cam (Asymptotic Methods in Statistical Decision Theory. Springer, Berlin Heidelberg New York, 1986).      

An alternating iterative method and its application in statistical inference

This paper studies non-convex programming problems. It is known that, in statistical inference, many constrained estimation problems may be expressed as convex programming problems. However, in many practical problems, the objective functions are not convex. In this paper, we give a definition of a semi-convex objective function and discuss the corresponding non-convex programming problems. A two-step iterative algorithm called the alternating iterative method is proposed for finding solutions for such problems. The method is illustrated by three examples in constrained estimation problems given in Sasabuchi et al. （Biometrika, 72, 465472 （1983））, Shi N. Z. （J. Multivariate Anal., 50, 282-293 （1994）） and El Barmi H. and Dykstra R. （Ann. Statist., 26, 1878 1893 （1998））.     

Nonlinear error bounds for lower semicontinuous functions on metric spaces

As a development of the theory of linear error bounds for lower semicontinuous functions defined on complete metric spaces, introduced in Azé et al. (Nonlinear Anal 49, 643–670, 2002) and refined in Azé and Corvellec (ESAIM Control Optim Calc Var 10, 409–425, 2004), we propose a similar approach to nonlinear error bounds, based on the notion of strong slope, the variational principle, and the change-of-metric principle, the latter allowing to obtain sharp estimates for such error bounds through a reduction to the linear case.     

A bernstein type inequality for derivatives of rational functions on two intervals

In this paper we establish an inequality for derivatives of rational functions with a fixed denominator generalizing V. S. Videnskii's inequality to the case of two intervals. To prove its asymptotic exactness, we use a new representation of Akhiezer-Zolotarev fractions with the least deviation from 0 on two intervals. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 508–514, October, 1999.     

Some notes on densely continuous forms

We consider a special space of set-valued functions (multifunctions), the space of densely continuous forms D(X, Y) between Hausdorff spaces X and Y, defined in [HAMMER, S. T.—McCOY, R. A.: Spaces of densely continuous forms, Set-Valued Anal. 5 (1997), 247–266] and investigated also in [HOLá, L’.: Spaces of densely continuous forms, USCO and minimal USCO maps, Set-Valued Anal. 11 (2003), 133–151]. We show some of its properties, completing the results from the papers [HOLY, D.—VADOVIČ, P.: Densely continuous forms, pointwise topology and cardinal functions, Czechoslovak Math. J. 58(133) (2008), 79–92] and [HOLY, D.—VADOVIČ, P.: Hausdorff graph topology, proximal graph topology and the uniform topology for densely continuous forms and minimal USCO maps, Acta Math. Hungar. 116 (2007), 133–144], in particular concerning the structure of the space of real-valued locally bounded densely continuous forms D _p ^*(X) equipped with the topology of pointwise convergence in the product space of all nonempty-compact-valued multifunctions. The paper also contains a comparison of cardinal functions on D _p ^*(X) and on real-valued continuous functions C _p (X) and a generalization of a sufficient condition for the countable cellularity of D _p ^*(X). This work was supported by Science and Technology Assistance Agency under the contract No. APVT-51-006904 and by the Eco-Net (EGIDE) programme of the Laboratoire de Mathématiques de l’Université de Saint-Etienne (LaMUSE), France.     

Some argument inequalities for certain analytic functions

For analytic functions f(z) in the open unit disk U and convex functions g(z) in U, Nunokawa et al. [NUNOKAWA, M.—OWA, S.—NISHIWAKI, J.—KUROKI, K.—HAYAMI, T: Differential subordination and argumental property, Comput. Math. Appl. 56 (2008), 2733–2736] have proved one theorem which is a generalization of the result [POMMERENKE, CH.: On close-toconvex analytic functions, Trans. Amer. Math. Soc. 114 (1965), 176–186]. The object of the present paper is to generalize the theorem due to Nunokawa et al..     

Classification of Refinable Splines in ℝ d

A refinable spline in ℝ ^d is a compactly supported refinable function whose support can be decomposed into simplices such that the function is a polynomial on each simplex. The best-known refinable splines in ℝ ^d are the box splines. Refinable splines play a key role in many applications, such as numerical computation, approximation theory and computer-aided geometric design. Such functions have been classified in one dimension in Dai et al. (Appl. Comput. Harmon. Anal. 22(3), 374–381, 2007), Lawton et al. (Comput. Math. 3, 137–145, 1995). In higher dimensions Sun (J. Approx. Theory 86, 240–252, 1996) characterized those splines when the dilation matrices are of the form A=mI, where m∈ℤ and I is the identity matrix. For more general dilation matrices the problem becomes more complex. In this paper we give a complete classification of refinable splines in ℝ ^d for arbitrary dilation matrices A∈M _d (ℤ).     

Embedding relations connected with strong approximation of Fourier series

We consider the embedding relation between the class W ^q H _β ^ω , including only odd functions and a set of functions defined via the strong means of Fourier series of odd continuous functions. We establish an improvement of a recent theorem of Le and Zhou [Math. Inequal. Appl. 11(4) (2008) 749–756] which is a generalization of Tikhonov’s results [Anal. Math. 31 (2005) 183–194]. We also extend the Leindler theorem [Anal. Math. 31 (2005) 175–182] concerning sequences of Fourier coefficients.     

Convergence and computation of simultaneous rational quadrature formulas

We discuss the convergence and numerical evaluation of simultaneous quadrature formulas which are exact for rational functions. The problem consists in integrating a single function with respect to different measures using a common set of quadrature nodes. Given a multi-index n, the nodes of the integration rule are the zeros of the multi-orthogonal Hermite–Padé polynomial with respect to (S, α, n), where S is a collection of measures, and α is a polynomial which modifies the measures in S. The theory is based on the connection between Gauss-type simultaneous quadrature formulas of rational type and multipoint Hermite–Padé approximation. The numerical treatment relies on the technique of modifying the integrand by means of a change of variable when it has real poles close to the integration interval. The output of some tests show the power of this approach in comparison with other ones in use.     

One-regular Normal Cayley Graphs on Dihedral Groups of Valency 4 or 6 with Cyclic Vertex Stabilizer

A graph G is one-regular if its automorphism group Aut（G） acts transitively and semiregularly on the arc set. A Cayley graph Cay（Г, S） is normal if Г is a normal subgroup of the full automorphism group of Cay（Г, S）. Xu, M. Y., Xu, J. （Southeast Asian Bulletin of Math., 25, 355-363 （2001）） classified one-regular Cayley graphs of valency at most 4 on finite abelian groups. Marusic, D., Pisanski, T. （Croat. Chemica Acta, 73, 969-981 （2000）） classified cubic one-regular Cayley graphs on a dihedral group, and all of such graphs turn out to be normal. In this paper, we classify the 4-valent one-regular normal Cayley graphs G on a dihedral group whose vertex stabilizers in Aut（G） are cyclic. A classification of the same kind of graphs of valency 6 is also discussed.     

On the errors of misclassification based on dichotomous and normal variables

Summary The distribution of the errors of misclassification in procedures based on dichotomous and normal variables is derived. The expressions forE(e ₁₂) andE(e ₂₁) are also obtained. The results in the paper extend those of Chang and Afifi (1974,J. Amer. Statist. Ass.,69, 336–339), using the earlier papers due to John (1961,Ann. Math. Statist.,32, 1125–1144), Subrahmaniam and Chinganda (1978,J. Statist. Plann. Inf.,2, 79–91).     

Minimal codewords in Reed–Muller codes

Minimal codewords were introduced by Massey (Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp 276–279, 1993) for cryptographical purposes. They are used in particular secret sharing schemes, to model the access structures. We study minimal codewords of weight smaller than 3 · 2 ^m−r in binary Reed–Muller codes RM(r, m) and translate our problem into a geometrical one, using a classification result of Kasami and Tokura (IEEE Trans Inf Theory 16:752–759, 1970) and Kasami et al. (Inf Control 30(4):380–395, 1976) on Boolean functions. In this geometrical setting, we calculate numbers of non-minimal codewords. So we obtain the number of minimal codewords in the cases where we have information about the weight distribution of the code RM(r, m). The presented results improve previous results obtained theoretically by Borissov et al. (Discrete Appl Math 128(1), 65–74, 2003), and computer aided results of Borissov and Manev (Serdica Math J 30(2-3), 303–324, 2004). This paper is in fact an extended abstract. Full proofs can be found on the arXiv.     

The Estimates for Sharp Maximal Functions of Multilinear Strongly Singular Integral Operators

In this paper, the author obtains that the multilinear operators of strongly singular integral operators and their dual operators are bounded from some L^p（R^n） to L^p（R^n） when the m-th order derivatives of A belong to L^p（R^n） for r large enough. By this result, the author gets the estimates for the Sharp maximal functions of the multilinear operators with the m-th order derivatives of A being Lipschitz functions. It follows that the multilinear operators are （L^p, L^p）-type operators for 1 〈 p 〈 ∞.     

A study of redundancy of some variables in covariate discriminant analysis

The redundancy of some variables in discriminant analysis and its tests were developed by Rao (1946,Sankhyā,7, 407–414; 1948,Biometrika,35, 58–79, 1970,Essays in Probability and Statistics, (eds. R. C. Boseet al.), 587–602, Univ. of North Carolina Press, Chapel Hill), and were further studied by McKay (1977,J. Roy. Statist. Soc. Ser. B,39, 371–380) and Fujikoshi (1982,Ann. Inst. Statist. Math.,34, 523–530). These are now extended to the most general situation which includes redundancy in covariate as well as main variables in discrimination between two or more groups. The likelihood ratio test is derived in a closed form. An alternative test is also suggested.