On convex hull of Gaussian samples

Let X _i = {X _i (t), t ∈ T} be i.i.d. copies of a centered Gaussian process X = {X(t), t ∈ T} with values in\( {\mathbb{R}^d} \) defined on a separable metric space T. It is supposed that X is bounded. We consider the asymptotic behavior of convex hulls

$ {W_n} = {\text{conv}}\left\{ {{X_1}(t), \ldots, {X_n}(t),\,\,t \in T} \right\} $

and show that, with probability 1,

$ \mathop {{\lim }}\limits_{n \to \infty } \frac{1}{{\sqrt {{2\ln n}} }}{W_n} = W $

(in the sense of Hausdorff distance), where the limit shape W is defined by the covariance structure of X: W = conv{K _t , t ∈ T}, Kt being the concentration ellipsoid of X(t). We also study the asymptotic behavior of the mathematical expectations E f(W _n ), where f is an homogeneous functional.

     

Precise large deviations for sums of random vectors with dependent components of consistently varying tails

Let {X _i = (X _1,i ,...,X _m,i )^?, i ≥ 1} be a sequence of independent and identically distributed nonnegative m-dimensional random vectors. The univariate marginal distributions of these vectors have consistently varying tails and finite means. Here, the components of X ₁ are allowed to be generally dependent. Moreover, let N(·) be a nonnegative integer-valued process, independent of the sequence {X _i , i ≥ 1}. Under several mild assumptions, precise large deviations for S _n = Σ _i=1 ⁿ X _i and S _N(t) = Σ _i=1 ^N(t) X _i are investigated. Meanwhile, some simulation examples are also given to illustrate the results.     

On boundary value problems for systems of nonlinear generalized ordinary differential equations

A general theorem (principle of a priori boundedness) on solvability of the boundary value problem dx = dA(t) · f(t, x), h(x) = 0 is established, where f: [a, b]×R ⁿ → R ⁿ is a vector-function belonging to the Carathéodory class corresponding to the matrix-function A: [a, b] → R ^n×n with bounded total variation components, and h: BV_s([a, b],R ⁿ ) → R ⁿ is a continuous operator. Basing on the mentioned principle of a priori boundedness, effective criteria are obtained for the solvability of the system under the condition x(t₁(x)) = B(x) · x(t ₂(x))+c ₀, where t _i: BV_s([a, b],R ⁿ ) → [a, b] (i = 1, 2) and B: BV_s([a, b], R ⁿ ) → R ⁿ are continuous operators, and c ₀ ∈ R ⁿ .     

Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths

In 1982 Thomassen asked whether there exists an integer f(k,t) such that every strongly f(k,t)-connected tournament T admits a partition of its vertex set into t vertex classes V ₁,…V _t such that for all i the subtournament T[V _i] induced on T by V _i is strongly k-connected. Our main result implies an affirmative answer to this question. In particular we show that f(k, t)=O(k ⁷ t ⁴) suffices. As another application of our main result we give an affirmative answer to a question of Song as to whether, for any integer t, there exists aninteger h(t) such that every strongly h(t)-connected tournament has a 1-factor consisting of t vertex-disjoint cycles of prescribed lengths. We show that h(t)=O(t ⁵) suffices.     

Limit theorems for supremum of Gaussian processes over a random interval

Let {X(t), t ≥ 0} be a centered stationary Gaussian process with correlation r(t)such that 1-r(t) is asymptotic to a regularly varying function. With T being a nonnegative random variable and independent of X(t), the exact asymptotics of P(sup_(t∈[0,T])X(t) x) is considered, as x →∞.     

A Probabilistic Characterization of the Dominance Order on Partitions

We present a probabilistic characterization of the dominance order on partitions. Let ν be a partition and Y _ν its Ferrers diagram, i.e. a stack of rows of cells with row i containing ν _i cells. Let the cells of Y _ν be filled with independent and identically distributed draws from the random variable X = B i n(r, p) with r ≥ 1 and p ∈ (0, 1). Given j, t ≥ 0, let P(ν, j, t) be the probability that the sum of all the entries in Y _ν is j while the sum of the entries in each row of Y _ν is no more than t. It is shown that if ν and μ are two partitions of n, ν dominates μ if and only if P(ν, j, t) ≤ P(μ, j, t) for all j, t ≥ 0. It is shown that the same result holds if X is any log-concave integer valued random variable with {i : P(X = i) > 0} = {0, 1,…,r} for some r ≥ 1.     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

Obstructions to the uniform stability of a <Emphasis Type="Italic">C</Emphasis><Subscript>0</Subscript>-semigroup

Let T _t : X → X be a C ₀-semigroup with generator A. We prove that if the abscissa of uniform boundedness of the resolvent s ₀(A) is greater than zero then for each nondecreasing function h(s): ?₊ → R ₊ there are x′ ∈ X′ and x ∈ X satisfying ∫ ₀ ^∞ h(|〈x′, T _x x〉|)dt = ∞. If i? ∩ Sp(A) ≠ Ø then such x may be taken in D(A ^∞).     

Estimation Problems for Periodically Correlated Isotropic Random Fields

Spectral theory of isotropic random fields in Euclidean space developed by M. I. Yadrenko is exploited to find a solution to the problem of optimal linear estimation of the functional

$$ A\zeta ={\sum\limits_{t=0}^{\infty}}\,\,\,{\int_{S_n}} \,\,a(t,x)\zeta (t,x)\,m_n(dx) $$

which depends on unknown values of a periodically correlated (cyclostationary with period T) with respect to time isotropic on the sphere S _n in Euclidean space E ⁿ random field ζ(t, x), t?∈?Z, x?∈?S _n . Estimates are based on observations of the field ζ(t, x)?+?θ(t, x) at points (t, x), t?=???1,???2, ..., x?∈?S _n , where θ(t, x) is an uncorrelated with ζ(t, x) periodically correlated with respect to time isotropic on the sphere S _n random field. Formulas for computing the value of the mean-square error and the spectral characteristic of the optimal linear estimate of the functional Aζ are obtained. The least favourable spectral densities and the minimax (robust) spectral characteristics of the optimal estimates of the functional Aζ are determined for some special classes of spectral densities.

     

Existence of linear Pfaffian systems whose lower characteristic set has positive measure in <Emphasis Type="Italic">R</Emphasis><Superscript>3</Superscript>

We prove the existence of a completely integrable Pfaffian system ?x/?t i = A _i (t)x, x ∈ R ⁿ , t = (t ₁, t ₂, t ₃) ∈ R ₊ ³ , i = 1, 2, 3, with infinitely differentiable bounded coefficients and with lower characteristic set of positive three-dimensional Lebesgue measure.     

Designs associated with maximum independent sets of a graph

A (v, β _o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i ≠ j and if i and j are not adjacent in G then there are exactly μ blocks containing i and j. In this paper, we study (v, β _o , μ)-designs over the graphs K _n × K _n , T(n)-triangular graphs, L ₂(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schläfli graph and non-existence of (v, β _o , μ)-designs over the three Chang graphs T ₁(8), T ₂(8) and T ₃(8).     

A tournament approach to pattern avoiding matrices

We consider the following Turán-type problem: given a fixed tournament H, what is the least integer t = t(n,H) so that adding t edges to any n-vertex tournament, results in a digraph containing a copy of H. Similarly, what is the least integer t = t(T _n ,H) so that adding t edges to the n-vertex transitive tournament, results in a digraph containing a copy of H. Besides proving several results on these problems, our main contributions are the following:

• Pach and Tardos conjectured that if M is an acyclic 0/1 matrix, then any n × n matrix with n(log n) ^O(1) entries equal to 1 contains the pattern M. We show that this conjecture is equivalent to the assertion that t(T _n ,H) = n(log n) ^O(1) if and only if H belongs to a certain (natural) family of tournaments.
• We propose an approach for determining if t(n,H) = n(log n) ^O(1). This approach combines expansion in sparse graphs, together with certain structural characterizations of H-free tournaments. Our result opens the door for using structural graph theoretic tools in order to settle the Pach–Tardos conjecture.

     

Connecting orbits of Lagrangian systems in a nonstationary force field

We study connecting orbits of a natural Lagrangian system defined on a complete Riemannian manifold subjected to the action of a nonstationary force field with potential U(q, t) = f(t)V(q). It is assumed that the factor f(t) tends to ∞ as t→±∞ and vanishes at a unique point t ₀ ∈ ?. Let X ₊, X _? denote the sets of isolated critical points of V (x) at which U(x, t) as a function of x distinguishes its maximum for any fixed t > t ₀ and t < t ₀, respectively. Under nondegeneracy conditions on points of X _± we prove the existence of infinitely many doubly asymptotic trajectories connecting X _? and X ₊.     

An improvement of the five halves theorem of J. Boardman

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = ∪ _j=0 ⁿ F ^j (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. The famous Five Halves Theorem of J. Boardman, announced in 1967, establishes that, if F is nonbounding, then m ≤ 5/2n. In this paper we obtain an improvement of the Five Halves Theorem when the top dimensional component of F, F ⁿ , is nonbounding. Specifically, let ω = (i ₁, i ₂, …, i _r ) be a non-dyadic partition of n and s _ω (x ₁, x ₂, …, x _n ) the smallest symmetric polynomial over Z ₂ on degree one variables x ₁, x ₂, …, x _n containing the monomial \(x_1^{i_1 } x_2^{i_2 } \cdots x_r^{i_r }\). Write s _ω (F ⁿ ) ∈ H ⁿ (F ⁿ , Z ₂) for the usual cohomology class corresponding to s _ω (x ₁, x ₂, …, x _n ), and denote by ?(F ⁿ ) the minimum length of a nondyadic partition ω with s _ω (F ⁿ ) ≠ 0 (here, the length of ω = (i ₁, i ₂, …, i _r ) is r). We will prove that, if (M ^m , T) is an involution for which the top dimensional component of the fixed point set, F ⁿ , is nonbounding, then m ≤ 2n + ?(F ⁿ ); roughly speaking, the bound for m depends on the degree of decomposability of the top dimensional component of the fixed point set. Further, we will give examples to show that this bound is best possible.     

Coloring number and on-line Ramsey theory for graphs and hypergraphs

Let c,s,t be positive integers. The (c,s,t)-Ramsey game is played by Builder and Painter. Play begins with an s-uniform hypergraph G ₀=(V,E ₀), where E ₀=Ø and V is determined by Builder. On the ith round Builder constructs a new edge e _i (distinct from previous edges) and sets G _i =(V,E _i ), where E _i =E _i?1∪{e _i }. Painter responds by coloring e _i with one of c colors. Builder wins if Painter eventually creates a monochromatic copy of K _s ^t , the complete s-uniform hypergraph on t vertices; otherwise Painter wins when she has colored all possible edges.We extend the definition of coloring number to hypergraphs so that χ(G)≤col(G) for any hypergraph G and then show that Builder can win (c,s,t)-Ramsey game while building a hypergraph with coloring number at most col(K _s ^t ). An important step in the proof is the analysis of an auxiliary survival game played by Presenter and Chooser. The (p,s,t)-survival game begins with an s-uniform hypergraph H ₀ = (V,Ø) with an arbitrary finite number of vertices and no edges. Let H _i?1=(V _i?1,E _i?1) be the hypergraph constructed in the first i ? 1 rounds. On the i-th round Presenter plays by presenting a p-subset P _i ?V _i?1 and Chooser responds by choosing an s-subset X _i ?P _i . The vertices in P _i ? X _i are discarded and the edge X _i added to E _i?1 to form E _i . Presenter wins the survival game if H _i contains a copy of K _s ^t for some i. We show that for positive integers p,s,t with s≤p, Presenter has a winning strategy.     

Solvability of Mixed Problems for the Klein–Gordon–Fock Equation in the Class <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> for <Emphasis Type="Italic">p</Emphasis> ≥ 1

We prove that the mixed problem for the Klein–Gordon–Fock equation u _tt (x, t) ? u _xx (x, t) + au(x, t) = 0, where a ≥ 0, in the rectangle Q _T = [0 ≤ x ≤ l] × [0 ≤ t ≤ T] with zero initial conditions and with the boundary conditions u(0, t) = μ(t) ∈ L _p [0, T ], u(l, t) = 0, has a unique generalized solution u(x, t) in the class L _p (Q _T ) for p ≥ 1. We construct the solution in explicit analytic form.     

On the sectionwise connectedness of a contingent

Let X be a real normed space and let f: ? → X be a continuous mapping. Let T _f (t ₀) be the contingent of the graph G(f) at a point (t ₀, f(t ₀)) and let S ⁺ ? (0,∞) × X be the “right” unit hemisphere centered at (0, 0 _X ). We show that

1. 1.
   If dimX < ∞ and the dilation D(f, t ₀) of f at t ₀ is finite then T _f (t ₀) ∩ S ⁺ is compact and connected. The result holds for \(T_f (t_0 ) \cap \overline {S^ + } \) even with infinite dilation in the case f: [0,∞) → X.
    
2. 2.
   If dimX = ∞, then, given any compact set F ? S ⁺, there exists a Lipschitz mapping f: ? → X such that T _f (t ₀) ∩ S ⁺ = F.
    
3. 3.
   But if a closed set F ? S ⁺ has cardinality greater than that of the continuum then the relation T _f (t ₀) ∩ S ⁺ = F does not hold for any Lipschitz f: ? → X.
    

     

On λ-Fold Equipartite Oberwolfach Problem with Uniform Table Sizes

We consider the following generalization of the Oberwolfach problem:”At a gathering there are n delegations each having m people. Is it possible to arrange a seating of mn people present at s round tables T ₁, T ₂, . . . , T _s (where each T _i can accommodate \( t_i\geq3 \) people and \( \sum t_i = mn \)) for k different meals so that each person has every other person not in the same delegation for a neighbor exactly λ times?” For λ= 1, Liu has obtained the complete solution to the problem when all tables accommodate the same number t of people. In this paper, we give the completesolution to the problem for \( \lambda\geq2 \) when all tables have uniform sizes t.     

On the limiting behavior of the characteristic function of the ergodic distribution of the semi-Markov walk with two boundaries

The semi-Markov walk (X(t)) with two boundaries at the levels 0 and β > 0 is considered. The characteristic function of the ergodic distribution of the processX(t) is expressed in terms of the characteristics of the boundary functionals N(z) and S _N(z), where N(z) is the firstmoment of exit of the random walk {Sn}, n ≥ 1, from the interval (?z, β ? z), z ∈ [0, β]. The limiting behavior of the characteristic function of the ergodic distribution of the process W _β (t) = 2X(t)/β ? 1 as β → ∞ is studied for the case in which the components of the walk (η _i) have a two-sided exponential distribution.     

An algorithm to compute <Emphasis Type="Italic">ω</Emphasis>-primality in a numerical monoid

Let M be a commutative, cancellative, atomic monoid and x a nonunit in M. We define ω(x)=n if n is the smallest positive integer with the property that whenever x∣a ₁???a _t , where each a _i is an atom, there is a T?{1,2,…,t} with |T|≤n such that x∣∏_k∈T a _k . The ω-function measures how far x is from being prime in M. In this paper, we give an algorithm for computing ω(x) in any numerical monoid. Simple formulas for ω(x) are given for numerical monoids of the form 〈n,n+1,…,2n?1〉, where n≥3, and 〈n,n+1,…,2n?2〉, where n≥4. The paper then focuses on the special case of 2-generator numerical monoids. We give a formula for computing ω(x) in this case and also necessary and sufficient conditions for determining when x is an atom. Finally, we analyze the asymptotic behavior of ω(x) by computing \(\lim_{x\rightarrow \infty}\frac{\omega(x)}{x}\).