Convex 4-valent polytopes

Let {p_k}_k≥3 be a sequence of nonnegative integers which satisfies 8 + Σ_k≥3 (k-4) p_k = 0 and p₄ ≥ p₃. Then there is a convex 4-valent polytope P in E³ such that P has exactly p_k k-gons as faces. The inequality p₄ ≥ p₃ is the best possible in the sense that for c < 1 there exist sequences that are not 4-realizable that satisfy both 8 + Σ_{k ≥3} (k - 4) p_k = 0 and p₄ > cp₃. When Σ_{k ≥ 5} p_k ≠ 1, one can make the stronger statement that the sequence {p_k} is 4-reliazable if it satisfies 8 + Σ_{k ≥ 3} (k - 4) p_k = 0 and p₄ ≥ 2Σ_{k ≥ 5} p_k + max{k ¦ p_k ≠ 0}.     

A note on a property of a weak self-similar perfect set

Let S be a compact, weak self-similar perfect set based on a system of weak contractions f_j, j=1,…,m each of which is characterized by a variable contraction coefficient _j(l) as d(f_j(x),f_j(y)) _j(l)d(x,y), d(x,y)<l, l>0. If the relation ∑^m_j=1j(l₀)<1 holds at at least one point l₀, then every nonempty compact metric space is a continuous image of the set S.     

Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix

Let A be a positive definite, symmetric matrix. We wish to determine the largest eigenvalue, λ₁. We consider the power method, i.e. that of choosing a vector v₀ and setting v_k = A^kv₀; then the Rayleigh quotients R_k = (Av_k, v_k)/(v_k, v_k) usually converge to λ₁ as k → ∞ (here (u, v) denotes their inner product). In this paper we give two methods for determining how close R_k is to λ₁. They are both based on a bound on λ₁ − R_k involving the difference of two consecutive Rayleigh quotients and a quantity ω_k. While we do not know how to directly calculate ω_k, we can given an algorithm for giving a good upper bound on it, at least with high probability. This leads to an upper bound for λ₁ − R_k which is proportional to (λ₂/λ₁)^2k, which holds with a prescribed probability (the prescribed probability being an arbitrary δ > 0, with the upper bound depending on δ).     

More limit theory for the sample correlation function of moving averages

Let X_t = Σ^∞_j=-∞ c_jZ_{t - j} be a moving average process where {Z_t} is iid with common distribution in the domain of attraction of a stable law with index , 0 < < 2. If 0 < < 2, E|Z₁| < ∞ and the distribution of |Z₁|and |Z₁Z₂| are tail equivalent then the sample correlation function of {X₁} suitably normalized converges in distribution to the ratio of two dependent stable random variables with indices and /2. This is in sharp contrast to the case E|Z₁| ^{= ∞} where the limit distribution is that of the ratio of two independent stable variables. Proofs rely heavily on point process techniques. We also consider the case when the sample correlations are asymptotically normal and extend slightly the classical result.     

Inverse geophysical problems for some noncompactly supported inhomogeneities

Let[²+k²n(x₁,x₃)]u(x₁,x₂,x₃)=−δ(x₁,y₁δ(x₂,y₂)δ(x₃,y₃) in R³₊. Assume that u(x₁,x₂,x₃=0,y₁,y₂=0,y₃=0,k) is measured at the plane P {x:x₃=0} for all positions of the source on the line y = (y₁,y₂ = 0,y₃ = 0), -∞ < y₁ < ∞, and receiver on the plane(x₁,x₂,x₃ − <x₁,x₂ < ∞, and for low-frequencies 0 < k <k₀, k₀ > 0 is an arbitrary small wave number. Assume thatn(x₁,x₃) is an arbitrary bounded piecewise-continuous function. The basic result is: the above low-frequency surface data determinen(x₁,x₃)uniquely.     

Extremal properties of strong quadrature weights and maximal mass results for truncated strong moment problems

A bisequence of complex numbers {μ_n}_−∞^∞ determines a strong moment functional satisfying L[xⁿ] = μ_n. If is positive-definite on a bounded interval (a,b) R{0}, then has an integral representation , n=0, ±1, ±2,…, and quadrature rules {w_ni,x_ni} exist such that μ_k = ∑_i=i^n_ns_ni^kw_ni. This paper is concerned with establishing certain extremal properties of the weights w_ni and using these properties to obtain maximal mass results satisfied by distributions ψ(x) representing when only a finite bisequence of moments {μ_k}_k=−nⁿ⁻¹ is given.     

A uniform asymptotic expansion of the single variable Bell polynomials

In this paper, we investigate the uniform asymptotic behavior of the single variable Bell polynomials on the negative real axis, to which all zeros belong. It is found that there exists an ascending sequence {Z_k}₁^∞(−e,0) such that the polynomials are represented by a finite sum of infinite asymptotic series, each in terms of the Airy function and its derivative, and the number of series under this sum is 1 in the interval (−∞,Z₁) and k+1 in [Z_k,Z_k+1), k1. Furthermore, it is shown that an asymptotic expansion, also in terms of Airy function and its derivative, completed with error bounds, holds uniformly in (−∞,−δ] for positive δ.     

Oscillation criteria for first-order neutral nonlinear difference equations with variable coefficients

Consider the first-order neutral nonlinear difference equation of the form

, where τ > 0, σ_i ≥ 0 (i = 1, 2,…, m) are integers, {p_n} and {q_n} are nonnegative sequences. We obtain new criteria for the oscillation of the above equation without the restrictions Σ_n=0^∞ q_n = ∞ or Σ_n=0^∞ nq_n Σ_j=n^∞ q_j = ∞ commonly used in the literature.     

On some properties of the series ∑k=0 kx and the Stirling numbers of the second kind

We partially characterize the rational numbers x and integers n 0 for which the sum ∑_k=0^∞ kⁿx^k assumes integers. We prove that if ∑_k=0^∞ kⁿx^k is an integer for x = 1 − a/b with a, b> 0 integers and gcd(a,b) = 1, then a = 1 or 2. Partial results and conjectures are given which indicate for which b and n it is an integer if a = 2. The proof is based on lower bounds on the multiplicities of factors of the Stirling number of the second kind, S(n,k). More specifically, we obtain for all integers k, 2 k n, and a 3, provided a is odd or divisible by 4, where v_a(m) denotes the exponent of the highest power of a which divides m, for m and a> 1 integers.

New identities are also derived for the Stirling numbers, e.g., we show that ∑_k=0²ⁿk! S(2n, k) , for all integers n 1.     

Cyclic coloring of plane graphs

Let G be a plane graph, and let χ_k(G) be the minimum number of colors to color the vertices of G so that every two of them which lie in the boundary of the same face of the size at most k, receive different colors. In 1966, Ore and Plummer proved that χ_k(G)2k for any k3. It is also known that χ₃(G)4 (Appel and Haken, 1976) and χ₄(G)6 (Borodin, 1984). The result in the present paper is: χ₅(G)9, χ₆(G)11, χ₇(G)12, and χ_k(G)2k − 3 if k8.     

Flawless 0-sequences and Hilbert functions of Cohen-Macaulay integral domains

Let A = A₀A₁ be a commutative graded ring such that (i) A₀ = k a field, (ii) A = k[A₁] and (iii) dim_k A₁ < ∞. It is well known that the formal power series ∑^∞_{n = 0} (dim_kA_n)λ ⁿ is of the form (h₀ + h₁λ + + h_sλ^s)/(1 − λ)^dimA with each h_iε . We are interested in the sequence (h₀, h₁,…,h_s), called the h-vector of A, when A is a Cohen–Macaulay integral domain. In this paper, after summarizing fundamental results (Section 1), we study h-vectors of certain Gorenstein domains (Section 2) and find some examples of h-vectors arising from integrally closed level domains (Sections 3 and 4).     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

Graph spectra

The k-spectrum s_k(G) of a graph G is the set of all positive integers that occur as the size of an induced k-vertex subgraph of G. In this paper we determine the minimum order and size of a graph G with s_k (G) = {0, 1, …,(₂^k)} and consider the more general question of describing those sets S {0,1, … ,(₂^k)} such that S = s_k(G) for some graph G.     

Elasticity of factorizations in integral domains

For an atomic integral domain R, define(R)=sup{mn|x₁x_m=y₁y_n, each x_i,y_jεR is irreducible}. We investigate (R), with emphasis for Krull domains R. When R is a Krull domain, we determine lower and upper bounds for (R); in particular,(R)≤max{|Cl(R)| 2, 1}. Moreover, we show that for any real numbers r≥1 or R=∞, there is a Dedekind domain R with torsion class group such that (R)=r.     

The existence of Schröder designs with equal-sized holes

A holey Schröder design of type h₁^n₁h₂^n₂ … h_k^n_k (HSD(h₁^n₁h₂^n₂ … h_k^n_k)) is equivalent to a frame idempotent Schröder quasigroup (FISQ(h₁^n₁h₂^n₂ … h_k^n_k)) of order n with n_i missing subquasigroups (holes) of order h_i, (1 i k), which are disjoint and spanning, that is, Σ_{1 i k} n_ih_i = n. In this paper, it is shown that an HSD(hⁿ) exists if and only if h²n(n − 1) 0 (mod 4) with expceptions (h, n) ε {{(1,5),(1,9),(2,4)}} and the possible exception of (h, n) = (6,4).     

The game of n-times nim

The following game is considered. The first player can take any number of stones, but not all the stones, from a single pile of stones. After that, each player can take at most n-times as many as the previous one. The player first unable to move loses and his opponent wins. Let f₁,f₂,… be an initial sequence of stones in increasing order, such that the second player has a winning strategy when play begins from a pile of size f_i. It is proved that there exist constants c=c(n) and k₀=k₀(n) such that f_k+1=f_k+f_k−c for all k>k₀, and lim_n→∞ c(n)/(nlogn)=1.     

Length-bounded disjoint paths in planar graphs

The following problem is considered: given: an undirected planar graph G=(V,E) embedded in , distinct pairs of vertices {r₁,s₁},…,{r_k,s_k} of G adjacent to the unbounded face, positive integers b₁,…,b_k and a function ; find: pairwise vertex-disjoint paths P₁,…,P_k such that for each i=1,…,k, P_i is a r_i−s_i-path and the sum of the l-length of all edges in P_i is at most b_i. It is shown that the problem is NP-hard in the strong sense. A pseudo-polynomial-time algorithm is given for the case of k=2.     

First passage time for some stationary processes

For a 1-dependent stationary sequence {X_n} we first show that if u satisfies p₁=p₁(u)=P(X₁>u)0.025 and n>3 is such that 88np₁³1, then

P{max(X₁,…,X_n)u}=ν·μⁿ+O{p₁³(88n(1+124np₁³)+561)}, n>3,

where

ν=1−p₂+2p₃−3p₄+p₁²+6p₂²−6p₁p₂,μ=(1+p₁−p₂+p₃−p₄+2p₁²+3p₂²−5p₁p₂)⁻¹

with

p_k=p_k(u)=P{min(X₁,…,X_k)>u}, k1

and

|O(x)||x|.

From this result we deduce, for a stationary T-dependent process with a.s. continuous path {Y_s}, a similar, in terms of P{max_0skTY_s<u}, k=1,2 formula for P{max_0stY_su}, t>3T and apply this formula to the process Y_s=W(s+1)−W(s), s0, where {W(s)} is the Wiener process. We then obtain numerical estimations of the above probabilities.     

Cycle decompositions of crowns

For an integer n3, the crown S_n⁰ is defined to be the graph with vertex set {x₀,x₁,…,x_n−1,y₀,y₁,…,y_n−1} and edge set {x_iy_j: 0i,jn−1, i≠j}. In this paper we give some sufficient conditions for the edge decomposition of the crown into isomorphic cycles.     

On a question about sum-free sequences

An increasing sequence of positive integers {n₁, n₂, …} is called a sum-free sequence if every term is never a sum of distinct smaller terms. We prove that there exist sum-free sequences {n_k} with polynomial growth and such that lim_k→∞ n_k+1/n_k = 1.