Adjoining batch Markov arrival processes of a Markov chain

A batch Markov arrival process (BMAP) X* = (N, J) is a 2-dimensional Markov process with two components, one is the counting process N and the other one is the phase process J. It is proved that the phase process is a time-homogeneous Markov chain with a finite state-space, or for short, Markov chain. In this paper, a new and inverse problem is proposed firstly: given a Markov chain J, can we deploy a process N such that the 2-dimensional process X* = (N, J) is a BMAP? The process X* = (N, J) is said to be an adjoining BMAP for the Markov chain J. For a given Markov chain the adjoining processes exist and they are not unique. Two kinds of adjoining BMAPs have been constructed. One is the BMAPs with fixed constant batches, the other one is the BMAPs with independent and identically distributed (i.i.d) random batches. The method we used in this paper is not the usual matrix-analytic method of studying BMAP, it is a path-analytic method. We constructed directly sample paths of adjoining BMAPs. The expressions of characteristic (D _k , k = 0, 1, 2 · · ·) and transition probabilities of the adjoining BMAP are obtained by the density matrix Q of the given Markov chain J. Moreover, we obtained two frontal Theorems. We present these expressions in the first time.     

Operations policy for a supply chain system with fixed-interval delivery and linear demand

This research addresses a production-supply problem for a supply-chain system with fixed-interval delivery. A strategy that determines the optimal batch sizes, cycle times, numbers of orders of raw materials, and production start times is prescribed to minimize the total costs for a given finite planning horizon. The external demands are time-dependent following a life-cycle pattern and the shipment quantities follow the demand pattern. The shipment quantities to buyers follow various phases of the demand pattern in the planning horizon where demand is represented by piecewise linear model. The problem is formulated as an integer, non-linear programming problem. The model also incorporates the constraint of inventory capacity. The problem is represented using the network model where an optimal characteristic has been analysed. To obtain an optimal solution with N shipments in a planning horizon, an algorithm is proposed that runs with the complexity of Θ(N²) for problems with a single-phase demand and O(N³) for problems with multi-phase demand.     

Semialgebraic sets and the Łojasiewicz-Siciak condition

The paper contains a full geometric characterization of compact semialgebraic sets in C satisfying the ?ojasiewicz-Siciak condition. The ?ojasiewicz-Siciak condition is a certain estimate for the Siciak extremal function. In a previous paper, we gave a sufficient criterion for a compact, connected, and semialgebraic set in C to satisfy this condition. In the present paper, we remove completely the connectedness assumption and prove that the aforementioned sufficient condition is also necessary. Moreover, we obtain some new results concerning the ?ojasiewicz-Siciak condition in C^N. For example, we prove that if K₁,...,K_p are compact, nonpluripolar, and pairwise disjoint subsets of C^N, each satisfying the ?ojasiewicz-Siciak condition, and K:= K₁?· · ·?K_p is polynomially convex, then K satisfies this condition as well.     

Ramanujan-type congruences modulo powers of 5 and 7

Let b _? (n) denote the number of ?-regular partitions of n. In 2012, using the theory of modular forms, Furcy and Penniston presented several infinite families of congruences modulo 3 for some values of ?. In particular, they showed that for α, n ≥ 0, b ₂₅ (3^2α+3 n+2 · 3^2α+2-1) ≡ 0 (mod 3). Most recently, congruences modulo powers of 5 for c5(n) was proved by Wang, where c _N (n) counts the number of bipartitions (λ₁,λ₂) of n such that each part of λ₂ is divisible by N. In this paper, we prove some interesting Ramanujan-type congruences modulo powers of 5 for b25(n), B25(n), c25(n) and modulo powers of 7 for c49(n). For example, we prove that for j ≥ 1, \({c_{25}}\left( {{5^{2j}}n + \frac{{11 \cdot {5^{2j}} + 13}}{{12}}} \right) \equiv 0\) (mod 5 ^j+1), \({c_{49}}\left( {{7^{2j}}n + \frac{{11 \cdot {7^{_{2j}}} + 25}}{{12}}} \right) \equiv 0\) (mod 7 ^j+1) and b ₂₅ (3^2α+3 · n+2 · 3^2α+2-1) ≡ 0 (mod 3 · 5^2j-1).     

The product of octahedra is badly approximated in the <Emphasis Type="Italic">ℓ</Emphasis><Subscript>2,1</Subscript>-metric

We prove that the Cartesian product of octahedra B _1,∞ ^n,m = B ₁ ⁿ ×···× B ₁ ⁿ (m factors) is poorly approximated by spaces of half dimension in the mixed norm: d _N/2(B _1,∞ ^n,m , ? _2,1 ^n,m ) ≥ cm, N = mn. As a corollary, we find the order of linear widths of the Hölder–Nikol’skii classes H _p ^r (T ^d ) in the metric of L _q in certain domains of variation of the parameters (p, q).     

The Existence and Application of Strongly Idempotent Self-orthogonal Row Latin Magic Arrays

Let N = {0, 1, · · ·, n ? 1}. A strongly idempotent self-orthogonal row Latin magic array of order n (SISORLMA(n) for short) based on N is an n × n array M satisfying the following properties: (1) each row of M is a permutation of N, and at least one column is not a permutation of N; (2) the sums of the n numbers in every row and every column are the same; (3) M is orthogonal to its transpose; (4) the main diagonal and the back diagonal of M are 0, 1, · · ·, n ? 1 from left to right. In this paper, it is proved that an SISORLMA(n) exists if and only if n ? {2, 3}. As an application, it is proved that a nonelementary rational diagonally ordered magic square exists if and only if n ? {2, 3}, and a rational diagonally ordered magic square exists if and only if n ≠ 2.     

Equiconvergence of expansions in multiple Fourier series and in fourier integrals with “lacunary sequences of partial sums”

We investigate the equiconvergence on T^N = [?π, π)^N of expansions in multiple trigonometric Fourier series and in the Fourier integrals of functions f ∈ L_p(T^N) and g ∈ L_p(R^N), p > 1, N ≥ 3, g(x) = f(x) on T^N, in the case where the “partial sums” of these expansions, i.e., S_n(x; f) and J_α(x; g), respectively, have “numbers” n ∈ Z^N and α ∈ R^N (n_j = [α_j], j = 1,..., N, [t] is the integral part of t ∈ R¹) containing N ? 1 components which are elements of “lacunary sequences.”     

Tensor convolutions and Hankel tensors

Let A be an mth order n-dimensional tensor, where m, n are some positive integers and N:= m(n?1). Then A is called a Hankel tensor associated with a vector v ∈ ?^N+1 if A_σ = v _k for each k = 0, 1,...,N whenever σ = (i₁,..., i_m) satisfies i₁ +· · ·+i_m = m+k. We introduce the elementary Hankel tensors which are some special Hankel tensors, and present all the eigenvalues of the elementary Hankel tensors for k = 0, 1, 2. We also show that a convolution can be expressed as the product of some third-order elementary Hankel tensors, and a Hankel tensor can be decomposed as a convolution of two Vandermonde matrices following the definition of the convolution of tensors. Finally, we use the properties of the convolution to characterize Hankel tensors and (0,1) Hankel tensors.     

On the number of nonstationary bounded trajectories of a class of autonomous systems on the plane

We study the number of nonstationary bounded trajectories of autonomous systems of the form z′ = \(\overline {P_n (z)} \), z = x + iy ∈ C, where P _n (z) is a polynomial of degree n with complex coefficients that has k distinct roots, n, k > 1. We prove that the number N of nonstationary bounded trajectories of this system satisfies the following assertions (Theorem 1): (a) N = n + k ? N ₊, N ₊ = N _?, n + 1 ≤ N ₊ ≤ n + k, where N ₊ and N _? are the numbers of system trajectories unbounded as t → +∞ and t → ?∞, respectively; (b) if some r distinct roots \(c_{j_1 } \), ..., \(c_{j_r } \) of the polynomial P _n satisfy the relations V _n+1 (\(c_{j_1 } \)) = ··· = V _n+1 (\(c_{j_r } \)), where V _n+1 is the imaginary part of the indeterminate integral of P _n , then N ≥ \(m_{j_1 } \) + ··· + \(m_{j_r } \) + r ? n ? 1; (c) if k = 2, then the conditions N = 1 and V _n+1 (c ₁) = V _n+1 (c ₂) are equivalent. For n = k = 3, we derive a formula for the number of nonstationary bounded trajectories (Theorem 2).     

On the Ramsey number of the triangle and the cube

The Ramsey number r(K ₃,Q _n ) is the smallest integer N such that every red-blue colouring of the edges of the complete graph K _N contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erd?s conjectured that r(K ₃,Q _n )=2 ⁿ⁺¹?1 for every n∈?, but the first non-trivial upper bound was obtained only recently, by Conlon, Fox, Lee and Sudakov, who proved that r(K ₃,Q _n )?7000·2 ⁿ . Here we show that r(K ₃,Q _n )=(1+o(1))2 ⁿ⁺¹ as n→∞.     

Under-recurrence in the Khintchine recurrence theorem

The Khintchine recurrence theorem asserts that in a measure preserving system, for every set A and ε > 0, we have μ(A ∩ T^?nA) ≥ μ(A)² ? ε for infinitely many n ∈ N. We show that there are systems having underrecurrent sets A, in the sense that the inequality μ(A ∩ T^?nA) < μ(A)² holds for every n ∈ N. In particular, all ergodic systems of positive entropy have under-recurrent sets. On the other hand, answering a question of V. Bergelson, we show that not all mixing systems have under-recurrent sets. We also study variants of these problems where the previous strict inequality is reversed, and deduce that under-recurrence is a much more rare phenomenon than over-recurrence. Finally, we study related problems pertaining to multiple recurrence and derive some interesting combinatorial consequences.     

On the failure of concentration for the ℓ∞-ball

Let (X, d) be a compact metric space and µ a Borel probability on X. For each N ≥ 1 let d_∞^N be the ?_∞-product on X^N of copies of d, and consider 1-Lipschitz functions X^N → ? for d_∞^N.     

On using cubic spline for the solution of problems in calculus of variations

Two different approaches based on cubic B-spline are developed to approximate the solution of problems in calculus of variations. Both direct and indirect methods will be described. It is known that, when using cubic spline for interpolating a function g∈C⁴[a,b] on a uniform partition with the step size h, the optimal order of convergence derived is O(h⁴). In Zarebnia and Birjandi (J. Appl. Math. 1–10, 2012) a non-optimal O(h²) method based on cubic B-spline has been used to solve the problems in calculus of variations. In this paper at first we will obtain an optimal O(h⁴) indirect method using cubic B-spline to approximate the solution. The convergence analysis will be discussed in details. Also a locally superconvergent O(h⁶) indirect approximation will be describe. Finally the direct method based on cubic spline will be developed. Some test problems are given to demonstrate the efficiency and applicability of the numerical methods.     

Polar functions of multiparameter bifractional Brownian sheets

Let B^H,K ： （B^H,K（t）, t ∈R＋^N} be an （N,d）-bifractional Brownian sheet with Hurst indices H = （H1,..., HN） ∈ （0, 1）^N and K = （K1,..., KN）∈ （0, 1]^N. The characteristics of the polar functions for B^H,K are investigated. The relationship between the class of continuous functions satisfying the Lipschitz condition and the class of polar-functions of B^H,K is presented. The Hausdorff dimension of the fixed points and an inequality concerning the Kolmogorov＇s entropy index for B^H,K are obtained. A question proposed by LeGall about the existence of no-polar, continuous functions statisfying the Holder condition is also solved.     

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.     

Counting sets with small sumset and applications

We study the number of k-element sets A? {1,...,N} with |A+A| ≤ K|A| for some (fixed) K > 0. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a factor of 2 ^{o ( k )} N ^{o (1)} for most N and k. As a consequence of this and a further new result concerning the number of sets A??/N? with |A+A| ≤ c|A|², we deduce that the random Cayley graph on ?/N? with edge density ½ has no clique or independent set of size greater than (2+o(1)) log₂ N, asymptotically the same as for the Erd?s-Rényi random graph. This improves a result of the first author from 2003 in which a bound of 160log₂ N was obtained. As a second application, we show that if the elements of A ? ? are chosen at random, each with probability 1/2, then the probability that A+A misses exactly k elements of ? is equal to (2+O(1))^?k/2 as k → ∞.     

The space clcv(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>) with the Hausdorff-Bebutov metric and differential inclusions

The paper is devoted to studying the space of nonempty closed convex (but not necessarily compact) sets in ? ⁿ , a dynamical system of translations, and existence theorems for differential inclusions. We make this space complete by equipping it with the Hausdorff-Bebutov metric. The investigation of these issues is important for certain problems of optimal control of asymptotic characteristics of a control system. For example, the problem \(\dot x = A(t,u)x\), (u, x) ∈ ? ^m+n , λ _n (u(·))→ min, where λ _n (u(·)) is the largest Lyapunov exponent of the system {ie121-2} = A(t, u)x, leads to a differential inclusion with a noncompact right-hand side.     

Improved difference scheme of the solution decomposition method for a singularly perturbed reaction-diffusion equation

A Dirichlet problem is considered for a singularly perturbed ordinary differential reaction-diffusion equation. For this problem, a new approach is developed in order to construct difference schemes that converge uniformly with respect to the perturbation parameter ?, ? ∈ (0, 1]. The approach is based on the decomposition of a discrete solution into regular and singular components, which are solutions of discrete subproblems on uniform grids. Using the asymptotic construction technique, a difference scheme of the solution decomposition method is constructed that converges ?-uniformly in the maximum norm at the rate O (N ^?2 ln² N), where N + 1 is the number of nodes in the grid used; for fixed values of the parameter ?, the scheme converges at the rate O(N ^?2). Using the Richardson technique, an improved scheme of the solution decomposition method is constructed, which converges ?-uniformly in the maximum norm at the rate O(N ^?4 ln⁴ N).     

On the rate of convergence in the global central limit theorem for random sums of independent random variables

We present upper bounds of the integral \( {\int}_{-\infty}^{\infty }{\left|x\right|}^l\left|\mathbf{P}\left\{{Z}_N<x\right\}-\varPhi (x)\right|\mathrm{d}x \) for 0 ≤ l ≤ 1 + δ, where 0 < δ ≤ 1, Φ(x) is a standard normal distribution function, and Z _N = \( {S}_N/\sqrt{\mathbf{V}{S}_N} \) is the normalized random sum with variance V S _N > 0 (S _N = X ₁ + · · · + X _N ) of centered independent random variables X ₁ ,X ₂ , . . . . The number of summands N is a nonnegative integer-valued random variable independent of X ₁ ,X ₂ , . . . .     

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.