Off‐diagonal and asymptotic results on the Ramsey number r(K2,m,K2,n)

An upper bound on the Ramsey number r(K_2,n‐s,K_2,n) where s ≥ 2 is presented. Considering certain r(K_2,n‐s,K_2,n)‐colorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of r(K_2,n‐s,K_2,n) in infinitely many cases if holds. Moreover, the asymptotic behavior of r(K_2,m,K_2,n) is studied for n being sufficiently large depending on m. We conclude with a table of all known Ramsey numbers r(K_2,m,K_2,n) where m,n ≤ 10. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 252–268, 2003     

Large deviations for heavy-tailed random sums of independent random variables with dominatedly varying tails

We prove large deviation results on the partial and random sums Sn = ∑i=1n Xi,n≥1; S(t) = ∑i=1N(t) Xi, t≥0, where {N(t);t≥0} are non-negative integer-valued random variables and {Xn;n≥1} are independent non-negative random variables with distribution, Fn, of Xn, independent of {N(t); t≥0}. Special attention is paid to the distribution of dominated variation.     

Geometric structure in stochastic approximation

1. IntroductionLet f: Re -- R be a differelltiable fUnction. f reaChes its extremes on the setJ = {x E R"lfx(x) = 0}, (1.1)where,x(X) = (V,..., V)". (1.2)If jx can be observed exactly at any x e R", then there are various numerical methods toconstruct {xh}, xk E Re such that the distance d(xk, J) between uk and J tends to zero ask -- co. However, in many application problems jx can only be observed with noise, i.e.,the observation at time k 1 isYk 1 = fi(~k) (k 1, (1'3)where xk is …     

Sets of Type (a, b) From Subgroups of ΓL(1, pR)

In this paper k-sets of type (a, b) with respect to hyperplanes are constructed in finite projective spaces using powers of Singer cycles. These are then used to construct further examples of sets of type (a, b) using various disjoint sets. The parameters of the associated strongly regular graphs are also calculated. The construction technique is then related to work of Foulser and Kallaher classifying rank three subgroups of AL(1, p ^R). It is shown that the sets of type (a, b) arising from the Foulser and Kallaher construction in the case of projective spaces are isomorphic to some of those constructed in the present paper.     

Dependence Properties of Multivariate Mixture Distributions and Their Applications

Consider a multivariate mixture model where the random variables X ₁, ..., X _n given (₁, ..., _n ), are conditionally independent. Conditions are obtained under which different kinds of positive dependence hold among X _i 's. The results obtained are applied to a variety of problems including the concomitants of order statistics and of record values; and to frailty models.     

Generalized Variation of Mappings with Applications to Composition Operators and Multifunctions

We study (set-valued) mappings of bounded -variation defined on the compact interval I and taking values in metric or normed linear spaces X. We prove a new structural theorem for these mappings and extend Medvedev's criterion from real valued functions onto mappings with values in a reflexive Banach space, which permits us to establish an explicit integral formula for the -variation of a metric space valued mapping. We show that the linear span GV (I;X) of the set of all mappings of bounded -variation is automatically a Banach algebra provided X is a Banach algebra. If h:I× X Y is a given mapping and the composition operator is defined by (f)(t)=h(t,f(t)), where tI and f:I X, we show that :GV (I;X) GV (I;Y) is Lipschitzian if and only if h(t,x)=h₀(t)+h₁(t)x, tI, xX. This result is further extended to multivalued composition operators with values compact convex sets. We prove that any (not necessarily convex valued) multifunction of bounded -variation with respect to the Hausdorff metric, whose graph is compact, admits regular selections of bounded -variation.     

Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).     

First Alexandroff Decomposition Theorem for Topological Lattice Group Valued Measures

Let (X, F) be an Alexandroff space, let A(F) be the Boolean subalgebra of 2 ^X generated by F, let G be a Hausdorff commutative topological lattice group and let rba_F(A(F), G) denote the set of all order bounded F-inner regular finitely additive set functions from A(F) into G. Using some special properties of the elements of rba_F(A(F), G), we extend to this setting the first decomposition theorem of Alexandroff.     

Strongly Regular Graphs and Designs with Three Intersection Numbers

We investigate BIBDs with three intersection numbers,x, y, and z, such that the relation on the block set given byA B iff the cardinality of the intersectionof A and B is not equal to x is an equivalence relation. Withsuch a design, we associate a family of strongly regular graphswith the same parameters. Two constructions producing infinitefamilies of such designs are given.     

Minimum Distance Bounds for s-Regular Codes

A code C F ⁿ is s-regular provided, forevery vertex x F ⁿ, if x is atdistance at most s from C then thenumber of codewords y C at distance ifrom x depends only on i and the distancefrom x to C. If denotesthe covering radius of C and C is -regular,then C is said to be completely regular. SupposeC is a code with minimum distance d,strength t as an orthogonal array, and dual degrees ^*. We prove that d 2t + 1 whenC is completely regular (with the exception of binaryrepetition codes). The same bound holds when C is(t + 1)-regular. For unrestricted codes, we show thatd s ^* + t unless C is a binary repetitioncode.