To the problem of a strong differentiability of integrals along different directions

It is proved that for any given sequence (σ _n ,n ∈ ℕ)=Γ₀ ⊂ Γ, where Γ is the set of all directions in ℝ² (i.e., pairs of orthogonal straight lines) there exists a locally integrable functionf on ℝ² such that: (1) for almost all directionsσ ∈ Γ\Γ₀ the integral ∫f is differentiable with respect to the familyB _2σ of open rectangles with sides parallel to the straight lines fromσ: (2) for every directionσ _n ∈ Γ₀ the upper derivative of ∫f with respect toB _{2σ n} equals +∞; (3) for every directionσ ∈ Γ the upper derivative of ∫ |f| with respect toB _2σ equals +∞.     

MAXIMUM TREES OF FINITE SEQUENCES

ＭＡＸＩＭＵＭＴＲＥＥＳＯＦＦＩＮＩＴＥＳＥＱＵＥＮＣＥＳ￥ＷＵＳＨＩＱＵＡＮＡｂｓｔｒａｃｔ：Ｌｅｔｎ，ｓ１，ｓ２，．．．，ｓｎｂｅｎｏｎ－ｎｅｇａｔｉｖｅｉｎｔｅｇｅｒｓａｎｄＭ（ｓ１，ｓ２，．．．，ｓｎ）＝｛（ａ１，ａ２，．．．，ａ．）｜ａｉｉ...     

Correlations of functions of normal variables

Let (X₁, X₂,…, X_k, Y₁, Y₂,…, Y_k) be multivariate normal and define a matrix C by C_ij = cov(X_i, Y_j). If (i) (X₁,…, X_k) = (Y₁,…, Y_k) and (ii) C is symmetric positive definite, then 0 < varf(X₁,…, X_k) < ∞ corr(f(X₁,…, X_k),f(Y₁,…, Y_k)) > 0. Condition (i) is necessary for the conclusion. The sufficiency of (i) and (ii) follows from an infinite-dimensional version, which can also be applied to a pair of jointly normal Brownian motions.     

Polynomial interpolation and sums of powers of integers

In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, P_k(n) and Q_k(n), such that P_k(n) = Q_k(n) = f_k(n) for n = 1, 2,…?, k, where f_k(1), f_k(2),…?, f_k(k) are k arbitrarily chosen (real or complex) values. Then, we focus on the case that f_k(n) is given by the sum of powers of the first n positive integers S_k(n) = 1^k + 2^k + ??? + n^k, and show that S_k(n) admits the polynomial representations S_k(n) = P_k(n) and S_k(n) = Q_k(n) for all n = 1, 2,…?, and k ≥ 1, where the first representation involves the Eulerian numbers, and the second one the Stirling numbers of the second kind. Finally, we consider yet another polynomial formula for S_k(n) alternative to the well-known formula of Bernoulli.     

Adjacency in subposets of the lattice of T 1-topologies on a set

Summary We study subposets of the lattice L_₁(X) of all T1-topologies on a set X, namely Σ_t(X), Σ₃(X) and Σ_lc(X), being respectively the collections of all Tychonoff, all T₃ and all locally compact Hausdorff topologies on X, with a view to deciding which elements of these partially ordered sets have and which do not have covers, that is to say immediate successors, in the respective posets. In the final section we discuss the subposet Σ _G of all Hausdorff group topologies on a group G.     

Real Solving of Elementary-Algebraic Systems

In this paper we present a new method for enclosing all the real roots in a bounded box of a system of n elementary-algebraic equations depending on n variables. This system is denoted by h(x)=P(x,f ₁(x ₁),...,f _k (x ₁),f ₁(x ₂),...,f _k (x _n )), where x=(x ₁,x ₂,...,x _n ) R ⁿ , P is a system of polynomials depending on n+kn variables and the univariate functions f _i are simple. This method arises from the exclusion method of Dedieu and Yakoubsohn. We provide both a theoretical complexity bound and some numerical experiments.     

On Cramer Approximations under Violation of Cramer's Condition

Let X ₁, X ₂,... be independent identically distributed random variables with distribution function F, S ₀ = 0, S _n = X ₁ + ⋯ + X _n , and Sˉ _n = max_1⩽k⩽n S _k . We obtain large-deviation theorems for S _n and Sˉ _n under the condition 1 − F(x) = P{X ₁ ⩾ x} = e^−l(x), l(x) = x ^α L(x), α ∈ (0, 1), where L(x) is a slowly varying function as x → ∞. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 447–456, October–December, 2005.     

p-Norm bounds on the expectation of the maximum of a possibly dependent sample

Let X₁, X₂,…, X_n be identically distributed possibly dependent random variables with finite pth absolute moment assumed without loss of generality to be equal to 1. Denote the order statistics by X_1:n, X_2:n,…, X_n:n. Bounds are derived for E(X_n:n) when it is assumed that the X_i's are (i) arbitrarily dependent and (ii) independent. The effect of assuming a symmetric common distribution for the X_i's is discussed. Analogous bounds are described for the expected range of the sample. Bounds on expectations of general linear combinations of order statistics are described in the independent case.     

Reducing system of parameters and the Cohen-Macaulay property

Let R be a local ring and let (x ₁, …, x _r) be part of a system of parameters of a finitely generated R-module M, where r < dim_R M. We will show that if (y ₁, …, y _r) is part of a reducing system of parameters of M with (y ₁, …, y _r) M = (x ₁, …, x _r) M then (x ₁, …, x _r) is already reducing. Moreover, there is such a part of a reducing system of parameters of M iff for all primes P ε Supp M ∩ V _R(x ₁, …, x _r) with dim_R R/P = dim_R M − r the localization M _P of M at P is an r-dimensional Cohen-Macaulay module over R _P. Furthermore, we will show that M is a Cohen-Macaulay module iff y _d is a non zero divisor on M/(y ₁, …, y _d−1) M, where (y ₁, …, y _d) is a reducing system of parameters of M (d:= dim_R M).     

Spectra of Extended Double Cover Graphs

The construction of the extended double cover was introduced by N. Alon [1] in 1986. For a simple graph G with vertex set V = {v ₁, v ₂, ..., v _n }, the extended double cover of G, denoted G ^*, is the bipartite graph with bipartition (X, Y) where X = {x ₁, x ₂, ..., x _n } and Y = {y ₁, y ₂, ..., y _n }, in which x _i and y _j are adjacent iff i = j or v _i and v _j are adjacent in G.In this paper we obtain formulas for the characteristic polynomial and the spectrum of G ^* in terms of the corresponding information of G. Three formulas are derived for the number of spanning trees in G ^* for a connected regular graph G. We show that while the extended double covers of cospectral graphs are cospectral, the converse does not hold. Some results on the spectra of the nth iterared double cover are also presented.     

On the clustering of independent uniform random variables

We consider the number K_n of clusters at a distance level d_n ∈ (0, 1) of n independent random variables uniformly distributed in [0, 1], or the number K_n of connected components in the random interval graph generated by these variables and d_n, and, depending upon how fast d_n → 0 as n → ∞, determine the asymptotic distribution of K_n, with rates of convergence, and of related random variables that describe the cluster sizes. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

The Largest Left Quotient Ring of a Ring

The left quotient ring (i.e., the left classical ring of fractions) Q_cl(R) of a ring R does not always exist and still, in general, there is no good understanding of the reason why this happens. In this article, existence of the largest left quotient ring Q_l(R) of an arbitrary ring R is proved, i.e., Q_l(R) = S₀(R)^?1R where S₀(R) is the largest left regular denominator set of R. It is proved that Q_l(Q_l(R)) = Q_l(R); the ring Q_l(R) is semisimple iff Q_cl(R) exists and is semisimple; moreover, if the ring Q_l(R) is left Artinian, then Q_cl(R) exists and Q_l(R) = Q_cl(R). The group of units Q_l(R)* of Q_l(R) is equal to the set {s^?1t | s, t ∈ S₀(R)} and S₀(R) = R ∩ Q_l(R)*. If there exists a finitely generated flat left R-module which is not projective, then Q_l(R) is not a semisimple ring. We extend slightly Ore's method of localization to localizable left Ore sets, give a criterion of when a left Ore set is localizable, and prove that all left and right Ore sets of an arbitrary ring are localizable (not just denominator sets as in Ore's method of localization). Applications are given for certain classes of rings (semiprime Goldie rings, Noetherian commutative rings, the algebra of polynomial integro-differential operators).     

On the Space bvp（F） of Sequences of p-bounded Variation of Fuzzy Numbers

Recently, the space bvp of real or complex numbers consisting of all sequences whose differences are in the space lp has been studied by Basar, Altay [Ukrainian Math. J. 55（1）（2003）, 136-147], where 1 ≤ p ≤ ∞. The main purpose of the present paper is to introduce the space bvp（F） of sequences of p-bounded variation of fuzzy numbers. Moreover, it is proved that the space bvp（F） includes the space lp（F） and also shown that the spaces bvp（F） and lp（F） axe isomorphic for 1 ≤ p ≤∞. Furthermore, some inclusion relations have been given.     

On Strassen's version of the law of the iterated logarithm for the two-parameter Gaussian process

Strassen's version of the law of the iterated logarithm is extended to the two-parameter Gaussian process {X(s, t); ε(s, t) [0, ∞)²} with the covariance function R((s₁,t₁),(s₂,t₂)) = min(s₁,s₂)min(t₁,t₂).     

Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors

A hereditary property of graphs is any class of graphs closed under isomorphism and subgraphs. Let 𝒫₁, 𝒫₂,…, 𝒫_n be hereditary properties of graphs. We say that a graph G has property 𝒫_1°𝒫_2°···_°𝒫_n if the vertex set of G can be partitioned into n sets V₁, V₂,…, V_n such that the subgraph of G induced by V_i belongs to 𝒫_i; i = 1, 2,…, n. A hereditary property is said to be reducible if there exist hereditary properties 𝒫₁ and 𝒫₂ such that ℛ = 𝒫_1°𝒫₂; otherwise it is irreducible. We prove that the factorization of a reducible hereditary property into irreducible factors is unique whenever the property is additive, i.e., it is closed under the disjoint union of graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 44–53, 2000     

A note on the interlacing of zeros and orthogonality

Let be a sequence of monic polynomials with deg(t_n)=n such that, for each n∈N, the zeros of t_n are real and simple and t_n and t_n+1 have no common zeros. We discuss the connection between the orthogonality of the sequence, the positivity of a certain ratio, and the interlacing of the zeros of t_n and t_n+1 for n≥1, n∈N.     

D 3-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations

We construct a new triangulation of (0, 1] ×R ⁿ , calledD ₃-triangulation, with continuous refinement of grid sizes for simplicial deformation algorithms for computing solutions of nonlinear equations. It is proved that theD ₃-triangulation is superior to the well-knownK ₃-triangulation andJ ₃-triangulation in the number of simplices. The surface density of theD ₃-triangulation also must be less than that of theK ₃-triangulation and theJ ₃-triangulation. Numerical tests show that the simplicial deformation algorithm based on theD ₃-triangulation indeed is much more efficient.The author would like to thank Dolf Talman for his remarks on an earlier version of this paper, three anonymous referees for their constructive suggestions, and Gerard van der Laan, Kaizhou Chen, and Xuchu He for their encouragement.     

The ABC of hyper recursions

Each member of the family of Gauss hypergeometric functions

f_n=₂F₁(a+ε₁n,b+ε₂n;c+ε₃n;z),