On limit distributions of first crossing points of Gaussian sequences

Let {X_k, k?Z} be a stationary Gaussian sequence with EX₁ – 0, EX²_k = 1 and EX₀X_k = r_k. Define τ_x = inf{k: X_k >– βk} the first crossing point of the Gaussian sequence with the function – βt (β > 0). We consider limit distributions of τ_x as β→0, depending on the correlation function r_k. We generalize the results for crossing points τ_x = inf{k: X_k >β?(k)} with ?(– t)?t^γL(t) for t→∞, where γ > 0 and L(t) varies slowly.     

Almost continuity on generalized topological spaces

For any unbounded sequence {n _k } of positive real numbers, there exists a permutation {n _σ(k)} such that the discrepancies of {n _σ(k) x} obey the law of the iterated logarithm exactly in the same way as the uniform i.i.d. sequence {U _k }.     

On factorable degree sequences

We call a degree sequence graphic (respectively, k-factorable, connected k-factorable) if there exists a graph (respectively, a graph with a k-factor, a graph with a connected k-factor) with the given degree sequence. In this paper we give a necessary and sufficient condition for a k-factorable sequence to be connected k-factorable when k ? 2. We also prove that every k-factorable sequence is (k − 2) factorable and 2-factorable, and also 1-factorable, when the sequence is of even length. Some conjectures are stated and it is also proved that, if {d_i} and {d_i − k} are graphic, then {d_i − r} is graphic for 0 ≤ r ≤ k provided rn is even.     

Pure Gaussian limit distributions of trigonometric series with bounded gaps

This paper is mainly concerned with the limit distribution of \((\cos 2\pi n_{1}x+\cdots +\cos 2\pi n_{N}x)/\sqrt{N}\) on the unit interval when the increasing sequence {n _k } has bounded gaps, i.e., 1≤n _k+1?n _k =O(1). By Bobkov–Götze [4], it was proved that the limiting variance must be less than 1/2 in this case. They proved that the centered Gaussian distribution with variance 1/4 together with mixtures of Gaussian distributions belonging to a huge class can be limit distributions. In this paper it is proved that any Gaussian distribution with variance less than 1/2 can be a limit distribution.     

Distribution of roots of quasianalytic functions

For functions of certain quasianalytic classes C{m_n} on (?∞, ∞) we determine a function ξ (x), depending on {m_n}, which is such that a sequence {x_k} is a sequence of the roots off(x) ε C{m_n} if and only if for somea $$\int_a^\infty {\tfrac{{dn(x)}}{{\xi (x - a}}< \infty ,} $$ where n(x) is a distribution function of the sequence {x_k}.     

An inverse problem for Toeplitz matrices and the synthesis of discrete transmission lines

Let A_m be a positive definite, m x m, Toeplitz matrix. Let A_k be its k x k principal minor (for any k?m), which is also positive definite and Toeplitz. Define the central mass sequence {?₁,…,?_m} by ?_k = sup{?: A_k ? ?Π_k > 0}, in which Π_k is the k x k matrix of all 1's. We show how knowledge of the sequence {?_k} is equivalent to knowledge of the matrix A_m. This result has application to the direct and inverse problems for a transmission line which consists of piecewise constant components. Knowing the impulse response of the transmission line, we can calculate the capacitance taper of the line, and vice versa.     

A central limit theorem for trigonometric series with bounded gaps

In this paper it is proved that there exists a sequence {n _k } of integers with 1 ?? n _k+1 ? n _k ?? 5 such that the distribution of ${(\cos 2\pi n_1 x + \dots + \cos 2\pi n_{N}) / \sqrt N}$ on ([?0, 1?], B, dx) converges to a Gaussian distribution. It gives an affirmative answer to the long standing problem on lacunary trigonometric series which ask the existence of series with bounded gaps satisfying a central limit theorem.     

Roots in differential rings of ultradifferentiable functions

Let {M _k } be a logconvex sequence satisfying the differentiability condition $$\sup (M_{n + 1} /M_n )^{1/n} < \infty $$ . It is shown that the Carleman class C{k! M _k } contains all C ^∞ roots of its nonflat elements, i.e., if f ∈ C{k! M _k } and α > 0, then $$f^\alpha \in C\{ k!M_k \} whenever f^\alpha \in C^\infty $$ . If {M _k } also satisfies the additional condition M _n ^1/n → ∞, then the Beurling class C(k! M _k ) is also contains all C ^∞ roots of its nonflat elements.     

On some criteria for completely regular growth of entire functions of exponential type

This paper sharpens the author’s previous results concerning the completely regular growth of an entire function of exponential type all of whose zeros are simple, forming a sequence Λ = {λ_k} _k=1 ^∞ . For a function with real zeros, we write the growth regularity conditions (on the real axis and on the entire plane) in terms of lower bounds only for the absolute value of the derivative at the points λ_k. We also obtain an analog of Krein’s theorem concerning the functions whose inverse can be expanded in the corresponding series of simple fractions.     

Approximation by antiderivatives

Let Ω ?C be an open set with simply connected components and suppose that the functionφ is holomorphic on Ω. We prove the existence of a sequence {φ ^(?n)} ofn-fold antiderivatives (i.e., we haveφ ⁽⁰⁾(z)∶=φ(z) andφ ^(?n)(z)=dφ ^(?n?1)(z)/dz for alln ∈ N₀ and z ∈ Ω) such that the following properties hold:

1. For any compact setB ?Ω with connected complement and any functionf that is continuous onB and holomorphic in its interior, there exists a sequence {n _k} such that {φ^?nk} converges tof uniformly onB.
2. For any open setU ?Ω with simply connected components and any functionf that is holomorphic onU, there exists a sequence {m _k} such that {φ^?mk} converges tof compactly onU.
3. For any measurable setE ?Ω and any functionf that is measurable onE, there exists a sequence {p _k} such that {φ ^(-Pk)} converges tof almost everywhere onE.

     

Log-concavity and LC-positivity

A triangle {a(n,k)}_0?k?n of nonnegative numbers is LC-positive if for each r, the sequence of polynomials is q-log-concave. It is double LC-positive if both triangles {a(n,k)} and {a(n,n−k)} are LC-positive. We show that if {a(n,k)} is LC-positive then the log-concavity of the sequence {xk} implies that of the sequence {zn} defined by , and if {a(n,k)} is double LC-positive then the log-concavity of sequences {xk} and {yk} implies that of the sequence {zn} defined by . Examples of double LC-positive triangles include the constant triangle and the Pascal triangle. We also give a generalization of a result of Liggett that is used to prove a conjecture of Pemantle on characteristics of negative dependence.     

The {k}-domatic number of a graph

For a positive integer k, a {k}-dominating function of a graph G is a function f from the vertex set V(G) to the set {0, 1, 2, . . . , k} such that for any vertex ${v\in V(G)}$ , the condition ${\sum_{u\in N[v]}f(u)\ge k}$ is fulfilled, where N[v] is the closed neighborhood of v. A {1}-dominating function is the same as ordinary domination. A set {f ₁, f ₂, . . . , f _d } of {k}-dominating functions on G with the property that ${\sum_{i=1}^df_i(v)\le k}$ for each ${v\in V(G)}$ , is called a {k}-dominating family (of functions) on G. The maximum number of functions in a {k}-dominating family on G is the {k}-domatic number of G, denoted by d _{k}(G). Note that d _{1}(G) is the classical domatic number d(G). In this paper we initiate the study of the {k}-domatic number in graphs and we present some bounds for d _{k}(G). Many of the known bounds of d(G) are immediate consequences of our results.     

Polynomials which take Gaussian integer values at Gaussian integers

A factorial set for the Gaussian integers is a set G = {g₁, g₂ … g_n} of Gaussian integers such that $\text{G(z) =}\text{Π}{}_{\mathrm{k}}\text{(z ? g}{}_{\mathrm{k}}\text{)}\text{g}{}_{\mathrm{k}}$ takes Gaussian integer values at Gaussian integers. We characterize factorial sets and give a lower bound for $\text{max}{}_{\mathrm{<mtext>\parallel z\parallel 2=</mtext><mtext>n</mtext><mtext>\pi </mtext>}}\text{∥ G(z)∥}$. It is conjectured that there are infinitely many factorial sets. A Gaussian integer valued polynomial (GIP) is a polynomial with the title property. A bound similar to the above is given for max_∥z∥2=n ∥ G(z)∥ if G(z) is a GIP. There is a relation between factorial sets and testing for GIP's. We discuss this and close with some examples of factorial sets, and speculate on how to find more.     

On the sequence of partial maxima of some random sequences

Let {X_n, n ? 1} be a sequence of identically distributed random variables, Z_n = max {X₁,…, X_n} and {u_n, n ? 1 } an increasing sequence of real numbers. Under certain additional requirements, necessary and sufficient conditions are given to have, with probability one, an infinite number of crossings of {Z_n} with respect to {u_n}, in two cases: (1) The X_n's are independent, (2) {X_n} is stationary Gaussian and satisfies a mixing condition.     

A RECOGNITION PROBLEM IN CONVERTING LINEAR PROGRAMMING TO NETWORK FLOW MODELS

The main goal of this paper is to study the following combinatorial problem.given a finite set E={e1,e2,…em} and a subset familly σ={S1,S2,…,Sn}of E,does there exist a tree T with the edge set E such that each induced subgraph T[Si] of Si is precisely a path (1≤i≤k)?     

Restrictions of continuous functions

Let α = {α₁, ...,α_k} be a finite multiset of non-negative real numbers. Consider the sequence of all positive integer multiples of all α _i ’s, and note the multiplicity of each term in this sequence. This sequence of multiplicities is the resonance sequence generated by {α ₁, ...,α_k}. Two multisets are combinatiorially equivalent if they generate the same resonance sequence. The paper is devoted to the classification of multisets up to combinatorial equivalence. We show that the problem of combinatorial equivalence of multisets is closely related to the problem of classification of systems of second order ordinary differential equations up to focal equivalence.     

A metric discrepancy result for a lacunary sequence with small gaps

For any ${G(k) \uparrow \infty}$ , there exists a sequence {n _k } of integers with 1 ?? n _k+1 ? n _k ?? G(k) such that the discrepancies of {n _k x} obey the law of the iterated logarithm in the same way as uniform distributed i.i.d.     

Doubly stochastic matrices with some equal diagonal sums

Let A be doubly stochastic, and let τ₁,…,τ_m be m mutually disjoint zero diagonals in A, 1?m?n-1. E. T. H. Wang conjectured that if every diagonal in A disjoint from each τ_k (k=1,…,m) has a constant sum, then all entries in A off the m zero diagonals τ_k are equal to (n?m)^-1. Sinkhorn showed the conjecture to be correct. In this paper we generalize this result for arbitrary doubly stochastic zero patterns.     

Interpolation in certain Hilbert spaces of analytic functions

In this article we study, for a Hilbert spaceB of analytic functions in the open unit disk, the dependence of the structure of the space of sequencesB(Z)={{f(z_k)} _k=1 ^∞ :f∈B} on the choice of the sequence Z={z_k} _k=1 ^∞ of distinct points of the unit disk [6].     

Next-fit packs a list and its reverse into the same number of bins

Suppose the next-fit algorithm packs {x₁, x₂, …, x_n} into k identical bins. Under modest assumptions about what fits into a bin, we prove that next-fit also packs {x_n, …, x₂, x₁} into k bins. Thus, the next-fit decreasing algorithm uses the same number of bins as a next-fit increasing algorithm.