Numerical properties of Chern classes of certain covering manifolds

In this paper, we study numerical properties of Chern classes of certain covering manifolds. One of the main results is the following: Let ψ : X → Pⁿ be a finite covering of the n-dimensional complex projective space branched along a hypersurface with only simple normal crossings and suppose X is nonsingular. Let c_i(X) be the i-th Chern class of X. Then (i) if the canonical divisor K_X is numerically effective, then (−1)^kc_k(X) (k ≥ 2) is numerically positive, and (ii) if X is of general type, then (−1)ⁿcⁱ_l (X) cⁱ_r, (X) > 0, where i_l + … + i_r = n. Furthermore we show that the same properties hold for certain Kummer coverings.     

On weighted Lebesgue function type sums

Let I be a finite or infinite interval and dμ a measure on I. Assume that the weight function w(x)>0, w^′(x) exists, and the function w^′(x)/w(x) is non-increasing on I. Denote by ℓ_k's the fundamental polynomials of Lagrange interpolation on a set of nodes x₁<x₂<<x_n in I. The weighted Lebesgue function type sum for 1≤i<j≤n and s≥1 is defined by

In this paper the exact lower bounds of S_n(x) on a “big set” of I and are obtained. Some applications are also given.     

Existence results for -point boundary value problem of second order ordinary differential equations

This study concerns the existence of positive solutions to the boundary value problemwhere ξ_i(0,1) with 0<ξ₁<ξ₂<<ξ_n-2<1, a_i, b_i[0,∞) with and . By applying the Krasnoselskii's fixed-point theorem in Banach spaces, some sufficient conditions guaranteeing the existence of at least one positive solution or at least two positive solutions are established for the above general n-point boundary value problem.     

Constructing set systems with prescribed intersection sizes

Let f be an n-variable polynomial with positive integer coefficients, and let be a set system on the n-element universe. We define a set system and prove that f(H_i1∩H_i2∩∩H_ik)=|G_i1∩G_i2∩∩G_ik|, for any 1km, where f(H_i1∩H_i2∩∩H_ik) denotes the value of f on the characteristic vector of H_i1∩H_i2∩∩H_ik. The construction of is a straightforward polynomial-time algorithm from the set system and the polynomial f. In this paper we use this algorithm for constructing set systems with prescribed intersection sizes modulo an integer. As a by-product of our method, some upper bounds on the number of sets in set systems with prescribed intersection sizes are extended.     

Tails of Bipartite Distance-regular Graphs

Let Γ denote a bipartite distance-regular graph with diameterD  ≥  4 and valency k ≥  3. Let θ 0  > θ 1  >  >  θD denote the eigenvalues of Γ and let E₀, E₁, , E_Ddenote the associated primitive idempotents. Fix s(1  ≤  s ≤  D −  1 ) and abbreviate E: =  E_s. We say E is a tail whenever the entrywise product E   E is a linear combination of E₀, E and at most one other primitive idempotent of Γ. Letq_ij^{σi + 1 h} (0  ≤ h , i, j ≤  D) denote the Krein parameters of Γ and letΔ denote the undirected graph with vertices 0, 1, , D where two vertices i, j are adjacent whenever i ≠  =  j andq_ij^σi + 1s  ≠  =  0. We show E is a tail if and only if one of (i)–(iii) holds: (i) Δ is a path; (ii) Δ has two connected components, each of which is a path; (iii) D =  6 and Δ has two connected components, one of which is a path on four vertices and the other of which is a clique on three vertices.     

Signed permutations and the four color theorem

Let σ₁,σ₂ be two permutations in the symmetric group S_n. Among the many sequences of elementary transpositions τ₁,…,τ_r transforming σ₁ into σ₂=τ_rτ₁σ₁, some of them may be signable, a property introduced in this paper. We show that the four color theorem in graph theory is equivalent to the statement that, for any n≥2 and any σ₁,σ₂S_n, there exists at least one signable sequence of elementary transpositions from σ₁ to σ₂. This algebraic reformulation rests on a former geometric one in terms of signed diagonal flips, together with a codification of the triangulations of a convex polygon on n+2 vertices by permutations in S_n.     

Explicit expressions for the extremal excedance set statistics

The excedance set of a permutation π=π₁π₂π_k is the set of indices i for which π_i>i. We give explicit formulas for the number of permutations whose excedance set is the initial segment {1,2,…,m} and also of the form {1,2,…,m,m+2}. We provide two proofs. The first is an explicit combinatorial argument using rook placements. The second uses the chromatic polynomial and two variable exponential generating functions. We then recast these explicit formulas as LDU-decompositions of associated matrices and show that these matrices are totally non-negative.     

Avoiding squares and overlaps over the natural numbers

We consider avoiding squares and overlaps over the natural numbers, using a greedy algorithm that chooses the least possible integer at each step; the word generated is lexicographically least among all such infinite words. In the case of avoiding squares, the word is 01020103, the familiar ruler function, and is generated by iterating a uniform morphism. The case of overlaps is more challenging. We give an explicitly-defined morphism that generates the lexicographically least infinite overlap-free word by iteration. Furthermore, we show that for all with h≤k, the word φ^k−h(h) is the lexicographically least overlap-free word starting with the letter h and ending with the letter k, and give some of its symmetry properties.     

Stable extendibility of vector bundles over lens spaces mod 3 and the stable splitting problem

Let Lⁿ(3) denote the (2n+1)-dimensional standard lens space mod 3. In this paper, we study the conditions for a given real vector bundle over Lⁿ(3) to be stably extendible to L^m(3) for every mn, and establish the formula on the power ζ^k=ζζ (k-fold) of a real vector bundle ζ over Lⁿ(3). Moreover, we answer the stable splitting problem for real vector bundles over Lⁿ(3) by means of arithmetic conditions.     

A note on the distance between two consecutive zeros of m-orthogonal polynomials for a generalized Jacobi weight

Let , with

-1=x_0n<x_1n<<x_nn<x_n+1,n=1

denote the zeros of nth m-orthogonal polynomial for a generalized Jacobi weight

This note proves . The gap left over , is filled.     

Constant-sign solutions for systems of singular integral equations of Hammerstein type

We consider the system of Hammerstein integral equations

where T>0 is fixed, ρ_i’s are given functions and the nonlinearities f_i(t,x₁,x₂,…,x_n) can be singular at t=0 and x_j=0 where j{1,2,,n}. Criteria are offered for the existence of constant-sign solutions, i.e., θ_iu_i(t)≥0 for t[0,T] and 1≤i≤n, where θ_i{1,−1} is fixed. The tools used are a nonlinear alternative of Leray–Schauder type, Krasnosel’skii’s fixed point theorem in a cone and Schauder’s fixed point theorem. We also include examples and applications to illustrate the usefulness of the results obtained.     

Arbitrariness of the pilot estimator in adaptive kernel methods

Consider estimating a smooth p-variate density f at 0 using the classical kernel estimator f_n(0) = n⁻¹ Σ_ib_n^−pw(b_n⁻¹X_i) based on a sample {X_i} from f. Under familiar conditions, assigning b_n = bn^{−1/(4 + p)} gives the best MSE decay rate O(n^{−4/(4 + p)}, but the optimal b, b* say, depends on f through its second derivatives, raising a feasibility objection to its use. By prescribing a pilot estimate of b* based on the same sample, Woodroofe has shown that there need be asymptotically no loss as against knowing the constant exactly, but his proposal is critically dependent on achieving a certain consistency rate for b*. Admitting a minor change in the risk function, we show by a tightness argument applied to the error process that any consistent estimator of b* may be used to achieve the same performance.     

A generalization of a theorem of Pringsheim

We consider noncommutative continued fractions of the form b₀ + a₁(b₁ + a₂(b₂ + a₃(…)⁻¹ c₃)⁻¹ c₂)⁻¹ c₁, (1) where a_n, b_n and c_n are elements of some Banach algebra B and b_n⁻¹ exists. Such expressions play an important role in the numerical investigation of various problems in theoretical physics and in applied mathematics, but up to now their convergence was not studied in the general case. In this paper we prove a theorem which is an extension of a wellknown theorem of Pringsheim and, in particular, guarantees the convergence of (1) under the following hypotheses:

Full-size image

Full-size image

. As an application, we give a generalization of a theorem of van Vleck. The paper closes with an extensive bibliography.     

Primitive normal polynomials with a prescribed coefficient

In this paper, we established the existence of a primitive normal polynomial over any finite field with any specified coefficient arbitrarily prescribed. Let n15 be a positive integer and q a prime power. We prove that for any aF_q and any 1m<n, there exists a primitive normal polynomial f(x)=xⁿ−σ₁xⁿ⁻¹++(−1)ⁿ⁻¹σ_n−1x+(−1)ⁿσ_n such that σ_m=a, with the only exceptions σ₁≠0. The theory can be extended to polynomials of smaller degree too.     

On a generalization of a theorem of Erdős and Fuchs

Let A={a₁,a₂,…}(a₁<a₂<) be an infinite sequence of nonnegative integers, let k≥2 be a fixed integer and denote by r_k(A,n) the number of solutions of a_i1+a_i2++a_ik≤n. Montgomery and Vaughan proved that r₂(A,n)=cn+o(n^1/4) cannot hold for any constant c>0. In this paper, we extend this result to k>2.     

An Inequality on the Size of a Set in a Cartesian Product

Let Ω be a finite subset of the Cartesian productW₁  ×   × W_nof n sets. ForA    {1, 2, , n }, denote by Ω_Athe projection ofΩ onto the Cartesian product of W_i, i   A. Generalizing an inequality given in an article by Shen, we prove that | Ω |² ≤  |Ω_A1 || Ω_Ak| provided that { A₁, , A_k} is a double cover of {1, 2, , n }. This inequality is applied to give some bounds on the numbers of special subgraphs of a graph.     

Some extensions of a property of linear representation functions

Let A={a₁,a₂,…}(a₁<a₂<) be an infinite sequence of nonnegative integers. Let k≥2 be a fixed integer and for , let R_k(A,n) be the number of solutions of a_i1++a_ik=n,a_i1,…,a_ikA, and let and denote the number of solutions with the additional restrictions a_i1<<a_ik, and a_i1≤≤a_ik respectively. Recently, Horváth proved that if d>0 is an integer, then there does not exist n₀ such that for n>n₀. In this paper, we obtain the analogous results for R_k(A,n), and .     

The operator equation

The solution of the linear operator equation:A^n-1X+A^n-2XB++AXB^n-2+XB^n-1=Y is given by if the spectra of A and B are in the sector {z:z≠0,-π/n<argz<π/n}.     

Generic initial ideals and graded Artinian-level algebras not having the Weak-Lefschetz Property

We find a sufficient condition that is not level based on a reduction number. In particular, we prove that a graded Artinian algebra of codimension 3 with Hilbert function cannot be level if h_d≤2d+3, and that there exists a level O-sequence of codimension 3 of type for h_d≥2d+k for k≥4. Furthermore, we show that is not level if , and also prove that any codimension 3 Artinian graded algebra A=R/I cannot be level if . In this case, the Hilbert function of A does not have to satisfy the condition h_d−1>h_d=h_d+1.Moreover, we show that every codimension n graded Artinian level algebra having the Weak-Lefschetz Property has a strictly unimodal Hilbert function having a growth condition on (h_d−1−h_d)≤(n−1)(h_d−h_d+1) for every d>θ where

h₀<h₁<<h_α==h_θ>>h_s−1>h_s.