Completely monotone multisequences, symmetric probabilities and a normal limit theorem

Let G _n,k be the set of all partial completely monotone multisequences of ordern and degreek, i.e., multisequencesc _n(β₁,β₂,…, β _k ), β₁,β₂,…, β_k = 0,1,2,…, β₁+β₂ + … +β _k ≤n,c _n(0,0,…, 0) = 1 and whenever β₀ ≤n - (β₁ + β₂ + … + β _k ) where Δc _n(β₁,β₂,…, β _k ) =c _n(β₁ + 1, β₂,…, β _k )+c _n(β₁,β₂+1,…, β _k )+…+c _n (β₁,β₂,…, β _k +1) -c _n(β₁,β₂,…, β _k ). Further, let Π _n,k be the set of all symmetric probabilities on {0,1,2,…,k} ⁿ . We establish a one-to-one correspondence between the sets G _n,k and Π _n,k and use it to formulate and answer interesting questions about both. Assigning to G _n,k the uniform probability measure, we show that, asn→∞, any fixed section {it{c_n}(β₁,β₂,…, β _k ), 1 ≤ Σβ _i ≤m}, properly centered and normalized, is asymptotically multivariate normal. That is, converges weakly to MVN[0, Σ _m ]; the centering constantsc ₀(β₁, β₂,…, β _k ) and the asymptotic covariances depend on the moments of the Dirichlet (1, 1,…, 1; 1) distribution on the standard simplex inR ^k.     

Canonical edge-colourings of locally finite graphs

A variety of results on edge-colourings are proved, the main one being the following: ifG is a graph without loops or multiple edges and with maximum degree Δ=Δ(G), and if ν is a given integer 1≦ν≦Δ(G), thenG can be given a proper edge-colouring with the coloursc ₁, ...,c _Δ+1 with the additional property that any edge colouredc _μ with μ≧ν is on a vertex which has on it edges coloured with at least ν − 1 ofc ₁, ...,c _v .     

Mollification formulas and implicit smoothing

This paper develops some mollification formulas involving convolutions between popular radial basis function (RBF) basic functions Φ, and suitable mollifiers. Polyharmonic splines, scaled Bessel kernels (Matern functions) and compactly supported basic functions are considered. A typical result is that in ℛ^d the convolution of |{•}|^β and (•²+c ²)^−(β+2d)/2 is the generalized multiquadric (•²+c ²)^β/2 up to a multiplicative constant. The constant depends on c>0, β, where ℜ(β)>−d, and d. An application which motivated the development of the formulas is a technique called implicit smoothing. This computationally efficient technique smooths a previously obtained RBF fit by replacing the basic function Φ with a smoother version Ψ during evaluation.     

On some generalized difference paranormed sequence spaces associated with multiplier sequence defined by modulus function

In this article we introduce the paranormed sequence spaces(f,Λ,△m,p),c0(f,Λ,△m,p) and ■∞(f,Λ,△m,p),associated with the multiplier sequence Λ =(λk),defined by a modulus function f.We study their different properties like solidness,symmetricity,completeness etc.and prove some inclusion results.     

Congruence-preserving subdirect products

An algebra A is said to be a congruence-preserving extension of a subalgebra B if the mapping from the congruence lattice of B to that of A, assigning to each congruence relation β on B the minimal congruence relation on A containing β, is an isomorphism. We give a necessary and sufficient condition on the congruence lattice of a subdirect product B of finitely many algebras in a congruence-distributive variety that the full direct product be a congruence-preserving extension of B. We give several applications to congruence lattices of lattices. Received May 25, 2000; accepted in final form January 22, 2001.     

Spectral Theory for Discrete Laplacians

We give the spectral representation for a class of selfadjoint discrete graph Laplacians Δ, with Δ depending on a chosen graph G and a conductance function c defined on the edges of G. We show that the spectral representations for Δ fall in two model classes, (1) tree-graphs with N-adic branching laws, and (2) lattice graphs. We show that the spectral theory of the first class may be computed with the use of rank-one perturbations of the real part of the unilateral shift, while the second is analogously built up with the use of the bilateral shift. We further analyze the effect on spectra of the conductance function c: How the spectral representation of Δ depends on c.     

Face rings of simplicial complexes with singularities

The face ring of a simplicial complex modulo m generic linear forms is shown to have finite local cohomology if and only if the link of every face of dimension m or more is nonsingular, i.e., has the homology of a wedge of spheres of the expected dimension. This is derived from an enumerative result for local cohomology of face rings modulo generic linear forms, as compared with local cohomology of the face ring itself. The enumerative result is generalized to squarefree modules. A concept of Cohen–Macaulay in codimension c is defined and characterized for arbitrary finitely generated modules and coherent sheaves. For the face ring of an r-dimensional complex Δ, it is equivalent to nonsingularity of Δ in dimension r − c; for a coherent sheaf on projective space, this condition is shown to be equivalent to the same condition on any single generic hyperplane section. The characterization of nonsingularity in dimension m via finite local cohomology thus generalizes from face rings to arbitrary graded modules.     

Sulla funzione di Hilbert di un sottoschema zero-dimensionale diP 3

Riassunto In questo lavoro diamo una caratterizzazione aritmetica della differenza prima ΔH(X,−) della funzione di Hilbert di un sottoschema chiuso 0-dimensionaleX diP ³. Il risultato principale viene applicato per dimostrare che seX è contenuto in una completa intersezione di tipo(a, b, c), a≦b≦c allora ΔH(X, n) è decrescente pern≧a+c−2.

---

Summary In this paper we give an aritmetical characterization of the first difference ΔH(X,−) of the Hilbert function of a closed 0-dimensional subschemeX ofP ³. The main result is then applied to prove that ifX is contained in a complete intersection of type(a, b, c), a≦b≦c then ΔH(X, n) is decreasing forn≧a+c−2.

---

---

Lavoro svolto con finanziamento MPI.     

Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system

A conic linear system is a system of the form?P(d): find x that solves b - Ax∈C _Y , x∈C _X ,? where C _X and C _Y are closed convex cones, and the data for the system is d=(A,b). This system is“well-posed” to the extent that (small) changes in the data (A,b) do not alter the status of the system (the system remains solvable or not). Renegar defined the “distance to ill-posedness”, ρ(d), to be the smallest change in the data Δd=(ΔA,Δb) for which the system P(d+Δd) is “ill-posed”, i.e., d+Δd is in the intersection of the closure of feasible and infeasible instances d’=(A’,b’) of P(·). Renegar also defined the “condition measure” of the data instance d as C(d):=∥d∥/ρ(d), and showed that this measure is a natural extension of the familiar condition measure associated with systems of linear equations. This study presents two categories of results related to ρ(d), the distance to ill-posedness, and C(d), the condition measure of d. The first category of results involves the approximation of ρ(d) as the optimal value of certain mathematical programs. We present ten different mathematical programs each of whose optimal values provides an approximation of ρ(d) to within certain constants, depending on whether P(d) is feasible or not, and where the constants depend on properties of the cones and the norms used. The second category of results involves the existence of certain inscribed and intersecting balls involving the feasible region of P(d) or the feasible region of its alternative system, in the spirit of the ellipsoid algorithm. These results roughly state that the feasible region of P(d) (or its alternative system when P(d) is not feasible) will contain a ball of radius r that is itself no more than a distance R from the origin, where the ratio R/r satisfies R/r≤c ₁ C(d), and such that r≥ and R≤c ₃ C(d), where c ₁,c ₂,c ₃ are constants that depend only on properties of the cones and the norms used. Therefore the condition measure C(d) is a relevant tool in proving the existence of an inscribed ball in the feasible region of P(d) that is not too far from the origin and whose radius is not too small. Received November 2, 1995 / Revised version received June 26, 1998?Published online May 12, 1999     

Maximal Betti numbers of Cohen–Macaulay complexes with a given <Emphasis Type="Italic">f</Emphasis>-vector

Given the f-vector f = (f₀, f₁, . . .) of a Cohen–Macaulay simplicial complex, it will be proved that there exists a shellable simplicial complex Δ_f with f(Δ_f) = f such that, for any Cohen–Macaulay simplicial complex Δ with f(Δ) = f, one has for all i and j, where f(Δ) is the f-vector of Δ and where β _ij (I _Δ) are graded Betti numbers of the Stanley–Reisner ideal I _Δ of Δ. The first author is supported by JSPS Research Fellowships for Young Scientists. Received: 23 January 2006     

Explicit Forms of q-Deformed Levy-Meixner Polynomials and Their Generating Functions

The classical Levy-Meixner polynomials are distinguished through the special forms of their generating functions. In fact, they are completely determined by 4 parameters： c1, c2,γ and β. In this paper, for-1 〈q〈 1, we obtain a unified explicit form of q-deformed Levy-Meixner polynomials and their generating functions in term of c1, c2, γand β, which is shown to be a reasonable interpolation between classical case （q=1） and fermionic case （q=-1）.In particular, when q=0 it＇s also compatible with the free case.     

Some new generalized difference sequence spaces defined by a sequence of moduli

The idea of difference sequence sets X( ) = {x = (x k ) : x ∈ X} with X = l ∞ , c and c 0 was introduced by Kizmaz [12]. In this paper, using a sequence of moduli we define some generalized difference sequence spaces and give some inclusion relations.     

Sum of sequence spaces and matrix transformations mapping in s α 0 ((Δ ? λ I ) h ) + s β ( c ) ((Δ ? μ I ) l )

We deal with the sum of sequence spaces. Then we apply these results to characterize matrix transformations mapping between s ^h,l (λ, μ) = s _α ⁰((Δ − λI) ^h ) + s _β ^(c)((Δ − μI) ^l ) and s _γ . Among other things the aim of this paper is to reduce the set (s ^h,l (λ, μ), s _γ to a set of the form S _τ,γ .      

Schreier type theorems for bicrossed products

We prove that the bicrossed product of two groups is a quotient of the pushout of two semidirect products. A matched pair of groups (H;G; α; β) is deformed using a combinatorial datum (σ; v; r) consisting of an automorphism σ of H, a permutation v of the set G and a transition map r: G → H in order to obtain a new matched pair (H; (G; *); α′, β′) such that there exists a σ-invariant isomorphism of groups H _α⋈β G ≅H _{α′⋈β′} (G, *). Moreover, if we fix the group H and the automorphism σ ∈ Aut H then any σ-invariant isomorphism H _α⋈β G ≅ H _{α′⋈β′} G′ between two arbitrary bicrossed product of groups is obtained in a unique way by the above deformation method. As applications two Schreier type classification theorems for bicrossed products of groups are given.     

Upper bound theorems for homology manifolds

In this paper we prove the Upper Bound Conjecture (UBC) for some classes of (simplicial) homology manifolds: we show that the UBC holds for all odd-dimensional homology manifolds and for all 2k-dimensional homology manifolds Δ such that β _k (Δ)⩽Σ{β _i (Δ):i ≠k-2,k,k+2 and 1 ⩽i⩽2k-1}, where β _i (Δ) are reduced Betti numbers of Δ. (This condition is satisfied by 2k-dimensional homology manifolds with Euler characteristic χ≤2 whenk is even or χ≥2 whenk is odd, and for those having vanishing middle homology.) We prove an analog of the UBC for all other even-dimensional homology manifolds. Kuhnel conjectured that for every 2k-dimensional combinatorial manifold withn vertices, . We prove this conjecture for all 2k-dimensional homology manifolds withn vertices, wheren≥4k+3 orn≤3k+3. We also obtain upper bounds on the (weighted) sum of the Betti numbers of odd-dimensional homology manifolds.     

Monotone perturbations of the laplacian inL 1(R N )

The semilinear perturbation of Poisson’s equation (E): −Δu+β(u)∋f, where β is a maximal monotone graph inR, has been investigated by Ph. Bénilan, H. Brézis and M. Crandall forf∈L ¹(R ^N ),N≧1, under the assumptions 0∈β(0) ifN≧3 and 0∈β(0) ∩ Int β(R) ifN=1,2. We discuss in this paper the solvability and well-posedness of (E) in terms of any maximal monotone graph β. In particular, if β takes only positive values andN≧3 we prove that no solution exists; ifN=2 we give necessary and sufficient conditions on β andf for (E) to be solvable in a natural sense.     

Distributions of Points in <Emphasis Type="Italic">d</Emphasis> Dimensions and Large <Emphasis Type="Italic">k</Emphasis>-Point Simplices

We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1] ^d , such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ _k,d (n), the supremum of this minimum volume over all distributions of n points in [0,1] ^d , we show that c _k,d ⋅(log n)^1/(d−k+1)/n ^k/(d−k+1)≤Δ _k,d (n)≤c _k,d ′/n ^k/d for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ _k,d (n)≤c _k,d ″/n ^{k/d+(k−1)/(2d(d−1))}, where c _k,d ,c _k,d ′,c _k,d ″>0 are constants. A preliminary version of this paper appeared in COCOON ’05.     

The size-Ramsey number of trees

IfG andH are graphs, let us writeG→(H)₂ ifG contains a monochromatic copy ofH in any 2-colouring of the edges ofG. Thesize-Ramsey number r _e(H) of a graphH is the smallest possible number of edges a graphG may have ifG→(H)₂. SupposeT is a tree of order |T|≥2, and lett ₀,t ₁ be the cardinalities of the vertex classes ofT as a bipartite graph, and let Δ(T) be the maximal degree ofT. Moreover, let Δ₀, Δ₁ be the maxima of the degrees of the vertices in the respective vertex classes, and letβ(T)=T ₀Δ₀+t ₁Δ₁. Beck [7] proved thatβ(T)/4≤r _e(T)=O{β(T)(log|T|)¹²}, improving on a previous result of his [6] stating thatr _e(T)≤Δ(T)|T|(log|T|)¹². In [6], Beck conjectures thatr _e(T)=O{Δ(T)|T|}, and in [7] he puts forward the stronger conjecture thatr _e(T)=O{β(T)}. Here, we prove the first of these conjectures, and come quite close to proving the second by showing thatr _e(T)=O{β(T)logΔ(T)}.     

On the bore radius for minimal surfaces

A least upper bound for the inner radiusR of an opening in a complete minimal hypersurface contained in a parallel layer is given. Namely, if Δ is the width of this layer, thenR≤Δ/(2c _p), wherec _p is an absolute constant depending only on the dimensionp of the minimal hypersurface. Translated fromMatematicheskie Zametki, Vol. 59, No. 6, pp. 909–913, June, 1996. I thank V. M. Milyukov for useful discussions of this work. This research was supported by the “Culture Initiative. Mathematics” Foundation.     

Packing,covering and decomposing of a complete uniform hypergraph into delta-systems

Anh-uniform hypergraph generated by a set of edges {E ₁,...,E _c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE _i⌢E _j=F,∀i≠j. The main result of this paper says that givenp, h andc, there isn ₀ such that forn≥n ₀ the set of edges of a completeh-uniform hypergraphK _n ^h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if . This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK _n ^h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK _n ^h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK _n ^h into subsets generating small but not necessarily isomorphic delta-systems.