On the structure of singular sets of convex functions

Whenf is a convex function ofR ^h, andk is an integer with 0<k, then the set ^k (f)=x:dim(f(x)k may be covered by countably many manifolds of dimensionh–k and classC ² except an _h–k negligible subset.The author is supported by INdAM     

A note on smoothed estimating functions

The kernel estimate of regression function in likelihood based models has been studied in Staniswalis (1989,J. Amer. Statist. Assoc.,84, 276–283). The notion of optimal estimation for the nonparametric kernel estimation of semimartingale intensity (t) is proposed. The goal is to arrive at a nonparametric estimate of ₀=(t ₀) for a fixed pointt ₀ [0, 1]. We consider the estimator that is a solution of the smoothed optimal estimating equation is the optimal estimating function as in Thavaneswaran and Thompson (1986,J. Appl. Probab.,23, 409–417).     

The Product of Independent Random Variables with Regularly Varying Tails

A distribution is said to have regularly varying tail with index – (0) if lim _x(kx,)/(x,)=k ^– for each k>0. Let X and Y be independent positive random variables with distributions and , respecitvely. The distribution of product XY is called Mellin–Stieltjes convolution (MS convolution) of and . It is known that D() (the class of distributions on (0,) that have regularly varying tails with index –) is closed under MS convolution. This paper deals with decomposition problem of distributions in D() related to MS convolution. A representation of a regularly varying function F of the following form is investigated: F(x)= _k=0 ^n–1 b _k f(a ^k x), where f is a measurable function and a and b _k (k=1,...,n–1) are real constants. A criterion is given for these constants in order that f be regularly varying. This criterion is applicable to show that there exist two distributions and such that neither nor belongs to D() (>0) and their MS convolution belongs to D().     

Sparse hypergraphs and pebble game algorithms

A hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V^′V spans more than k|V^′|−ℓ hyperedges. We characterize (k,ℓ)-sparse hypergraphs in terms of graph theoretic, matroidal and algorithmic properties. We extend several well-known theorems of Haas, Lovász, Nash-Williams, Tutte, and White and Whiteley, linking arboricity of graphs to certain counts on the number of edges. We also address the problem of finding lower-dimensional representations of sparse hypergraphs, and identify a critical behavior in terms of the sparsity parameters k and ℓ. Our constructions extend the pebble games of Lee and Streinu [A. Lee, I. Streinu, Pebble game algorithms and sparse graphs, Discrete Math. 308 (8) (2008) 1425–1437] from graphs to hypergraphs.     

An extreme value theory for long head runs

Summary For an infinite sequence of independent coin tosses withP(Heads)=p(0,1), the longest run of consecutive heads in the firstn tosses is a natural object of study. We show that the probabilistic behavior of the length of the longest pure head run is closely approximated by that of the greatest integer function of the maximum ofn(1-p) i.i.d. exponential random variables. These results are extended to the case of the longest head run interrupted byk tails. The mean length of this run is shown to be log(n)+klog(n)+(k+1)log(1–p)–log(k!)+k+/–1/2+ r₁(n)+ o(1) where log=log_1/p , =0.577 ... is the Euler-Mascheroni constant, =ln(1/p), andr ₁(n) is small. The variance is ₂/6²+1/12 +r ₂(n)+ o(1), wherer ₂(n) is again small. Upper and lower class results for these run lengths are also obtained and extensions discussed.This work was supported by a grant from the System Development Foundation     

A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter d = 3i − 1 with b i = 1 and k > 2

Let be a distance regular graph with intersection array b ₀, b ₁,..., b _d–1; c ₁,..., c _d. It is shown that in some cases (c _i–1, a _i–1, b _i–1) = (c ₁, a ₁, b ₁)and (c _2i–1, a _2i–1, b _2i–1) imply k 2b _i + 1. As a corollary all distance regular graphs of diameter d = 3i – 1 with b _i = 1 and k > 2 are determined.     

Steiner systems andn −1-isomorphisms

In this work we introduce the concept of n ^–1-isomorphism between Steiner systems (this coincides with the concept of isomorphism whenever n=1).Precisely two Steiner systems S₁ and S₂ are said to be n^–1-isomorphic if there exist n partial systems S _i ⁽¹⁾ ,...,S _i ⁽ⁿ⁾ contained in Si, i.{1,2},such that S ₁ ^(k) and S ₂ ^(k) are isomorphic for each k{1,..., n}.The n^–1-isomorphisms are also used to study nets replacements, see Ostrom [8], and to study the transformation methods of designs and other incidence structures introduced in [9] and generalized in [1] and [10].Work done under the auspicies of G.N.S.A.G.A. supported by 40% grants of M.U.R.S.T.     

On the solution of singular linear systems of algebraic equations by semiiterative methods

Summary For a square matrixT ^n,n , where (I–T) is possibly singular, we investigate the solution of the linear fixed point problemx=T x+c by applying semiiterative methods (SIM's) to the basic iterationx ₀ ⁿ ,x _k T c _k–1+c(k1). Such problems arise if one splits the coefficient matrix of a linear systemA x=b of algebraic equations according toA=M–N (M nonsingular) which leads tox=M ^–1 N x+M ^–1 bT x+c. Even ifx=T x+c is consistent there are cases where the basic iteration fails to converge, namely ifT possesses eigenvalues 1 with ||1, or if =1 is an eigenvalue ofT with nonlinear elementary divisors. In these cases — and also ifx=T x+c is incompatible — we derive necessary and sufficient conditions implying that a SIM tends to a vector which can be described in terms of the Drazin inverse of (I–T). We further give conditions under which is a solution or a least squares solution of (I–T)x=c.Research supported in part by the Alexander von Humboldt-Stiftung     

A convexity-preservingC 2 parametric rational cubic interpolation

Summary AC ² parametric rational cubic interpolantr(t)=x(t) i+y(t) j,t[t ₁,t _n] to data S={(x_j, y_j)|j=1,...,n} is defined in terms of non-negative tension parameters _j ,j=1,...,n–1. LetP be the polygonal line defined by the directed line segments joining the points (x _j ,y _j ),t=1,...,n. Sufficient conditions are derived which ensure thatr(t) is a strictly convex function on strictly left/right winding polygonal line segmentsP. It is then proved that there always exist _j ,j=1,...,n–1 for whichr(t) preserves the local left/righ winding properties of any polygonal lineP. An example application is discussed.This research was supported in part by the natural Sciences and Engineering Research Council of Canada.     

Block-Transitive Point-Imprimitive t-Designs

We study block-transitive point-imprimitive t–(v, k, ) designs. It was showed by Cameron and Praeger that in such designs t = 2 or 3. In 1989, Delandtsheer and Doyen proved that a block-transitive point-imprimitive 2-design satisfies v (( ^k ₂)–1)². In this paper, we give a proof of the Cameron–Praeger conjecture which states that for t = 3 the stronger inequality v ( ^k ₂)+1 holds. We find two infinite families of 3-designs for which this bound is met. We also show that the above designs cannot have = 1, and that = 2 is possible only if v attains its maximal value, and various other restrictions are met.     

The Domination Parameters of Cubic Graphs

Let ir(G), (G), i(G), ₀(G), (G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In this paper we show that for any nonnegative integers k₁, k₂, k₃, k₄, k₅ there exists a cubic graph G satisfying the following conditions: (G) – ir(G) k₁, i(G) – (G) k₂, ₀(G) – i(G) > k₃, (G) – ₀(G) – k₄, and IR(G) – (G) – k₅. This result settles a problem posed in [9].Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093).Supported by RUTCOR.     

Resolvable Mendelsohn designs with block size 4

Summary Letv andK be positive integers. A (v, k, 1)-Mendelsohn design (briefly (v, k, 1)-MD) is a pair (X,B) whereX is av-set (ofpoints) andB is a collection of cyclically orderedk-subsets ofX (calledblocks) such that every ordered pair of points ofX are consecutive in exactly one block ofB. A necessary condition for the existence of a (v, k, 1)-MD isv(v–1) 0 (modk). If the blocks of a (v, k, 1)-MD can be partitioned into parallel classes each containingv/k blocks wherev ) (modk) or (v – 1)/k blocks wherev 1 (modk), then the design is calledresolvable and denoted briefly by (v, k, 1)-RMD. It is known that a (v, 3,1)-RMD exists if and only ifv 0 or 1 (mod 3) andv 6. In this paper, it is shown that the necessary condition for the existence of a (v, 4, 1)-RMD, namelyv 0 or 1 (mod 4), is also sufficient, except forv = 4 and possibly exceptingv = 12. These constructions are equivalent to a resolvable decomposition of the complete symmetric directed graphK _v ^* onv vertices into 4-circuits.Research supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-5320.     

Two combinatorial problems on posets

Bialostocki proposed the following problem: Let nk2 be integers such that k|n. Let p(n, k) denote the least positive integer having the property that for every poset P, |P|p(n, k) and every Z _k -coloring f: P Z _k there exists either a chain or an antichain A, |A|=n and _aA f(a) 0 (modk). Estimate p(n, k). We prove that there exists a constant c(k), depends only on k, such that (n+k–2)²–c(k) p(n, k) (n+k–2)²+1. Another problem considered here is a 2-dimensional form of the monotone sequence theorem of Erdös and Szekeres. We prove that there exists a least positive integer f(n) such that every integral square matrix A of order f(n) contains a square submatrix B of order n, with all rows monotone sequences in the same direction and all columns monotone sequences in the same direction (direction means increasing or decreasing).     

Linking (n − 2)-dimensional panels inn-space I: (k − 1,k)-graphs and (k − 1,k)-frames

A (k – 1,k)-graph is a multi-graph satisfyinge (k – 1)v – k for every non-empty subset ofe edges onv vertices, with equality whene = |E(G)|. A (k – 1,k)-frame is a structure generalizing an (n – 2, 2)-framework inn-space, a structure consisting of a set of (n – 2)-dimensional bodies inn-space and a set of rigid bars each joining a pair of bodies using ball joints. We prove that a graph is the graph of a minimally rigid (with respect to edges) (k – 1,k)-frame if and only if it is a (k – 1,k)-graph. Rigidity here means infinitesimal rigidity or equivalently statical rigidity.     

Groups with Largely Splitting Automorphisms of Orders Three and Four

A subset X of a group G is said to be large (on the left) if, for any finite set of elements g₁,l... ,g_kin G, an intersection of the subsets g_iX=g_imid x in X is not empty, that is, limits_{i=1} ^{k}g_iX . It is proved that a group in which elements of order 3 form a large subset is in fact of exponent 3. This result follows from the more general theorem on groups with a largely splitting automorphism of order 3, thus answering a question posed by Jaber amd Wagner in [1]. For groups with a largely splitting automorphism of order 4, it is shown that if His a normal -invariant soluble subgroup of derived length d then the derived subgroup [H,H] is nilpotent of class bounded in terms of d. The special case where =1 yields the same result for groups that are largely of exponent 4.     

Fundamental equation of information revisited

Summary This paper presents a new, shorter and more direct proof of the following result of J. Aczél and C. T. Ng: IfM: J R (J =]0, 1[ ^k ) is both multiplicative and additive, then the general solution: J R of(x) + M(1 – x)(y/1 – x) = (y) + M(1 – y)(x/1 – y) (x, y, x + y J) is given by(x) = ifM = 0,(x) = M(x)[L(x) + ] + M(1 – x)L(1 – x) ifM 0,where is an arbitrary constant andL: J R is an arbitrary solution of the logarithmic functional equationL(xy) = L(x) + L(y) (x, y J). Also, some extensions of this result to fields more general than the reals are given.     

Nonparametric time series regression

Consider ak-times differentiable unknown regression function(·) of ad-dimensional measurement variable. LetT() denote a derivative of(·) of orderm and setr=(k–m)/(2k+d). Given a bivariate stationary time series of lengthn, under some appropriate conditions, a sequence of local polynomial estimators of the functionT() can be chosen to achieve the optimal rate of convergencen ^–r inL ₂ norms restricted to compacts; and the optimal rate (n ^–1 logn) ^r in theL norms on compacts. These results generalize those by Stone (1982,Ann. Statist.,10, 1040–1053) which deals with nonparametric regression estimation for random (i.i.d.) samples. Applications of these results to nonlinear time series problems will also be discussed.This work was completed while the author was visiting Mathematical Sciences Research Institute at Berkeley, California. Research was supported in part by NSF Grant DMS-8505550, NC Board of Science and Technology Development Award 90SE06 and UNC Research Council.     

Submodule lattice quasivarieties and exact embedding functors for rings with prime power characteristic

Given ringsR with prime power characteristicp ^k , quasivarieties (R) of lattices generated by lattices of submodules ofR-modules are studied. An algebra of expressionsd not dependent onR is developed, such that each suchd uniquely determines a two-sides ideald _R ofR. The main technical result is that (R) (S) makes all implications of the formd _s =S d_R=R true, for any such expressiond. The proof makes use of the known equivalence between (R) (S) and existence of an exact embedding functorR-Mod S -Mod. Fork 2, the ordered setW(p ^k ) of all lattice quasivarieties (R),R having characteristic p _K , is shown to be large and complicated, with ascending and descending chains and antichains having continuously many elements. More precisely,W(p ^k ) has a subset which is order isomorphic to the Boolean algebra of all subsets of a denumerably infinite set. Also, given any prime powerp ^k ,k 2, a ringR can be constructed so that (R) and (R ^op) for the opposite ringR ^op are distinct elements ofW(p ^k ).Presented by R. Freese.Research partially supported by Hungarian National Foundation for Scientific Research grant no. 1903.     

Projective surfaces withk-very ample line bundles of genus ≤3k+1

Let be the set of surfaces,S, polarized by a k-very ample line bundle,L, with genus≤3k+1. All the elements (S, L) of are listed. The classification of surfaces polarized by ak-very ample line bundle of degree ≤4k+4 is completed by proving that this class of surfaces is a subset of .