Some irreducibility and indecomposability results for truncated binomial polynomials of small degree

In this paper, we show that the truncated binomial polynomials defined by \(P_{n,k}(x)={\sum }_{j=0}^{k} {n \choose j} x^{j}\) are irreducible for each k≤6 and every n≥k+2. Under the same assumption n≥k+2, we also show that the polynomial P _n,k cannot be expressed as a composition P _n,k (x) = g(h(x)) with \(g \in \mathbb {Q}[x]\) of degree at least 2 and a quadratic polynomial \(h \in \mathbb {Q}[x]\). Finally, we show that for k≥2 and m,n≥k+1 the roots of the polynomial P _m,k cannot be obtained from the roots of P _n,k , where m≠n, by a linear map.     

On the nonexistence of solutions of some anisotropic elliptic and backward parabolic inequalities

We study the nonexistence of weak solutions of higher-order elliptic and parabolic inequalities of the following types: \(\sum {_{i = 1}^N\sum\nolimits_{{e_i} \leqslant {\alpha _i} \leqslant {m_i}} {D_{{x_i}}^{{\alpha _i}}\left( {{A_{{\alpha _i}}}\left( {x,u} \right)} \right)} \geqslant f\left( {x,u} \right),} x \in {\mathbb{R}^N}\), and \({u_t} + \sum {_{i = 1}^N\sum\nolimits_{{k_i} \leqslant {\beta _i} \leqslant {n_i}} {D_{{x_i}}^{{\beta _i}}\left( {{B_{{\beta _i}}}\left( {x,t,u} \right)} \right)} > g\left( {x,t,u} \right),\left( {x,t} \right)} \in {\mathbb{R}^N} \times {\mathbb{R}_ + }\), where l _i , m _i , k _i , n _i ∈ N satisfy the condition l _i , k _i > 1 for all i = 1,..., N, and A _αi (x, u), B _βi (x, t, u), f(x, u), and g(x, t, u) are some given Carathéodory functions. Under appropriate conditions on the functions A _αi , B _βi , f, and g, we prove theorems on the nonexistence of solutions of these inequalities.     

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).     

Divided differences for functions of two variables for irregularly spaced arguments

Divided differences forf (x, y) for completely irregular spacing of points (x _i ,y _i ) are developed here by a natural generalization of Newton's scheme. Existing bivariate schemes either iterate the one-dimensional scheme, thus constraining (x _i ,y _i ) to be at corners of rectangles, or give polynomials Σa _jk x ^j y ^k having more coefficients than interpolation conditions. Here the generalizedn ^th divided difference is defined by (1)\(\left[ {01... n} \right] = \sum\limits_{i = 0}^n {A_i f\left( {x_i , y_i } \right)} \) where (2)\(\sum\limits_{i = 0}^n {A_i x_i^j , y_i^k = 0} \), and 1 for the last or (n+1)^th equation, for every (j, k) wherej+k=0, 1, 2,... in the usual ascending order. The gen. div. diff. [01...n] is symmetric in (x _i ,y _i ), unchanged under translation, 0 forf (x, y) an, ascending binary polynomial as far asn terms, degree-lowering with respect to (X, Y) whenf(x, y) is any polynomialP(X+x, Y+y), and satisfies the 3-term recurrence relation (3) [01...n]=λ{[1...n]?[0...n?1]}, where (4) λ= |1...n|·|01...n?1|/|01...n|·|1...n?1|, the |...i...| denoting determinants inx _i ^j y _i ^k . The generalization of Newton's div. diff. formula is (5)

$$\begin{gathered} f\left( {x, y} \right) = f\left( {x_0 , y_0 } \right) - \frac{{\left| {\alpha 0} \right|}}{{\left| 0 \right|}}\left[ {01} \right] + \frac{{\left| {\alpha 01} \right|}}{{\left| {01} \right|}}\left[ {012} \right] - \frac{{\left| {\alpha 012} \right|}}{{\left| {012} \right|}}\left[ {0123} \right] + \cdots + \hfill \\ + \left( { - 1} \right)^n \frac{{\left| {\alpha 01 \ldots n - 1} \right|}}{{\left| {01 \ldots n - 1} \right|}}\left[ {01 \ldots n} \right] + \left( { - 1} \right)^{n + 1} \frac{{\left| {\alpha 01 \ldots n} \right|}}{{\left| {01 \ldots n} \right|}}\left[ {01 \ldots n} \right], \hfill \\ \end{gathered} $$     

Packing circles in the smallest circle: an adaptive hybrid algorithm

The circular packing problem (CPP) consists of packing n circles C _i of known radii r _i , i∈N={1,?…,?n}, into the smallest containing circle ?. The objective is to determine the coordinates (x _i ,?y _i ) of the centre of C _i , i∈N, as well as the radius r and centre (x,?y) of ?. CPP, which is a variant of the two-dimensional open-dimension problem, is NP hard. This paper presents an adaptive algorithm that incorporates nested partitioning within a tabu search and applies some diversification strategies to obtain a (near) global optimum. The tabu search is to identify the n circles’ ordering, whereas the nested partitioning is to determine the n circles’ positions that yield the smallest r. The computational results show the efficiency of the proposed algorithm.     

Asymptotic Analysis for Random Walks with Nonidentically Distributed Jumps Having Finite Variance

Let ξ₁,ξ₂,... be independent random variables with distributions F₁F₂,... in a triangular array scheme (F _i may depend on some parameter). Assume that Eξ _i = 0, Eξ _i ² < ∞, and put \(S_n = \sum {_{i = 1}^n \;} \xi _i ,\;\overline S _n = \max _{k \leqslant n} S_k\). Assuming further that some regularly varying functions majorize or minorize the “averaged” distribution \(F = \frac{1}{n}\sum {_{i = 1}^n F_i }\), we find upper and lower bounds for the probabilities P(S _n > x) and \(P(\bar S_n > x)\). We also study the asymptotics of these probabilities and of the probabilities that a trajectory {S _k } crosses the remote boundary {g(k)}; that is, the asymptotics of P(max_k≤n(S _k ? g(k)) > 0). The case n = ∞ is not excluded. We also estimate the distribution of the first crossing time.     

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.     

Estimates of sums of integrals of the Legendre Polynomial

Estimates of sums \({R_{nk}}\left( x \right) = \sum\limits_{m = n}^\infty {{P_{mk}}\left( x \right)} \) are established. Here, P_n0(x)= P_n(x), \({R_{nk}}\left( x \right) = \int\limits_.^x {{P_{n,k - 1}}\left( y \right)dy} \), P_n is the Legendre polynomial with standard normalization P_n(1) = 1. With k = 1 in the main interval [–1, 1] the sum decreases with increasing n as n^–1, and in the half-open interval [–1, 1), as n^–3/2. With k > 1 the point x = 1 does not need to be excluded. The sum decreases as n^-k–1/2. Moreover, a small increase in the multiplicative constant permits to obtain the estimate \(|{R_{nk}}\left( {\cos \theta } \right)| < \frac{{C{{\sin }^{k - 3/2}}\theta }}{{{n^{k + 1/2}}}}\), where C depends weakly on k (but not on n, θ). In passing, a Mehler–Dirichlet-type integral for R_nk(cos θ) is deduced.     

Hausdorff dimension of the maximal run-length in dyadic expansion

For any x ∈ [0, 1), let x = [? ₁, ? ₂, …,] be its dyadic expansion. Call r _n (x):= max{j ? 1: ? _i+1 = … = ? _i+j = 1, 0 ? i ? n ? j} the n-th maximal run-length function of x. P.Erdös and A.Rényi showed that \(\mathop {\lim }\limits_{n \to \infty } \) r _n (x)/log₂ n = 1 almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose runlength function assumes on other possible asymptotic behaviors than log₂ n, is quantified by their Hausdorff dimension.     

A unified approach to singular problems arising in the membrane theory

We consider the singular boundary value problem \(({t^n}u't))' + {t^n}f(t,u(t)) = 0,{\rm{ }}\mathop {\lim }\limits_{t \to 0 + } {t^n}u'(t) = 0,{\rm{ }}{a_0}u(1) + {a_1}u'(1 - ) = A,\) where f(t, x) is a given continuous function defined on the set (0, 1]×(0,∞) which can have a time singularity at t = 0 and a space singularity at x = 0. Moreover, n ∈ ?, n ? >2, and a ₀, a ₁, A are real constants such that a ₀ ∈ (0,1), whereas a ₁,A ∈ [0,∞). The main aim of this paper is to discuss the existence of solutions to the above problem and apply the general results to cover certain classes of singular problems arising in the theory of shallow membrane caps, where we are especially interested in characterizing positive solutions. We illustrate the analytical findings by numerical simulations based on polynomial collocation.     

A relation between the Laplacian and signless Laplacian eigenvalues of a graph

Let G be a graph of order n such that \(\sum_{i=0}^{n}(-1)^{i}a_{i}\lambda^{n-i}\) and \(\sum_{i=0}^{n}(-1)^{i}b_{i}\lambda^{n-i}\) are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that a _i ≥b _i for i=0,1,…,n. As a consequence, we prove that for any α, 0<α≤1, if q ₁,…,q _n and μ ₁,…,μ _n are the signless Laplacian and the Laplacian eigenvalues of G, respectively, then \(q_{1}^{\alpha}+\cdots+q_{n}^{\alpha}\geq\mu_{1}^{\alpha}+\cdots+\mu _{n}^{\alpha}\).     

On balanced colorings of the <Emphasis Type="Italic">n</Emphasis>-cube

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center. Let B _n,2k be the number of balanced 2-colorings of the n-cube with 2k vertices having weight 1. Palmer, Read, and Robinson conjectured that for n≥1, the sequence \(\{B_{n,2k}\}_{k=0,1,\ldots,2^{n-1}}\) is symmetric and unimodal. We give a proof of this conjecture. We also propose a conjecture on the log-concavity of B _n,2k for fixed k, and by probabilistic method we show that it holds when n is sufficiently large.     

On Generalized Markoff-Hurwitz-type Equations over Finite Fields

Let N _q denote the number of solutions of the generalized Markoff-Hurwitz-type equation

$a_1x_1^{m_1}+a_2x_2^{m_2}+\cdots+a_nx_n^{m_n}=b\,x_1^{k_1}x_2^{k_2}\cdots x_n^{k_n}$

over the finite field \(\mathbb{F}_{q}\), where m _i ,k _i are positive integers\(,a_{i},b\in \mathbb{F}_{q}^{*}\) for i=1,…,n and n≥2. By introducing and applying augmented degree matrix, we show that if \(\gcd(\sum_{i=1}^{n}k_{i}m/m_{i}-m,q-1)=1\) where m=m ₁ ??? m _n then N _q =q ^n?1+(?1)^n?1. This partially solves one of Carlitz’s problems and generalizes as well as simplifies some results of Baoulina about these type equations.

     

On a vectorized version of a generalized Richardson extrapolation process

Let {x _m } be a vector sequence that satisfies

$$\boldsymbol{x}_{m}\sim \boldsymbol{s}+\sum\limits^{\infty}_{i=1}\alpha_{i} \boldsymbol{g}_{i}(m)\quad\text{as \(m\to\infty\)}, $$

s being the limit or antilimit of {x _m } and \(\{\boldsymbol {g}_{i}(m)\}^{\infty }_{i=1}\) being an asymptotic scale as m → ∞, in the sense that

$$\lim\limits_{m\to\infty}\frac{\|\boldsymbol{g}_{i+1}(m)\|}{\|\boldsymbol{g}_{i}(m)\|}=0,\quad i=1,2,\ldots. $$

The vector sequences \(\{\boldsymbol {g}_{i}(m)\}^{\infty }_{m=0}\), i = 1, 2,…, are known, as well as {x _m }. In this work, we analyze the convergence and convergence acceleration properties of a vectorized version of the generalized Richardson extrapolation process that is defined via the equations

$$\sum\limits^{k}_{i=1}\langle\boldsymbol{y},{\Delta}\boldsymbol{g}_{i}(m)\rangle\widetilde{\alpha}_{i}=\langle\boldsymbol{y},{\Delta}\boldsymbol{x}_{m}\rangle,\quad n\leq m\leq n+k-1;\quad \boldsymbol{s}_{n,k}=\boldsymbol{x}_{n}+\sum\limits^{k}_{i=1}\widetilde{\alpha}_{i}\boldsymbol{g}_{i}(n), $$

s _{n, k} being the approximation to s. Here, y is some nonzero vector, 〈? ,?〉 is an inner product, such that \(\langle \alpha \boldsymbol {a},\beta \boldsymbol {b}\rangle =\overline {\alpha }\beta \langle \boldsymbol {a},\boldsymbol {b}\rangle \), and Δx _m = x _{m + 1}? x _m and Δg _i (m) = g _i (m + 1)?g _i (m). By imposing a minimal number of reasonable additional conditions on the g _i (m), we show that the error s _{n, k} ? s has a full asymptotic expansion as n→∞. We also show that actual convergence acceleration takes place, and we provide a complete classification of it.

     

Series by Haar system with monotone coefficients

Let χ = {χ _n } _n=0 ^∞ be the Haar system normalized in L ²(0, 1) and M = {M _s } _s=1 ^∞ be an arbitrary, increasing sequence of nonnegative integers. For any subsystem of χ of the form {φ _k } = χS = {χ _n } _n∈S , where S = S(M) = {n _k } _k=1 ^∞ = {n ∈ V[p]: p ∈ M}, V[0] = {1, 2} and V[p] = {2 ^p + 1, 2 ^p + 2, …, 2 ^p+1} for p = 1, 2, … a series of the form Σ _i=1 ^∞ a _i φ _i with a _i ↘ 0 is constructed, that is universal with respect to partial series in all classes L ^r (0, 1), r ∈ (0, 1), in the sense of a.e. convergence and in the metric ofL ^r (0, 1). The constructed series is universal in the class of all measurable, finite functions on [0, 1] in the sense of a.e. convergence. It is proved that there exists a series by Haar system with decreasing coefficients, which has the following property: for any ? > 0 there exists a measurable function µ(x), x ∈ [0, 1], such that 0 ≤ µ(x) ≤ 1 and |{x ∈ [0, 1], µ(x) ≠ = 1}| < ?, and the series is universal in the weighted space L _µ[0, 1] with respect to subseries, in the sense of convergence in the norm of L _µ[0, 1].     

Stabilization by output of continuous and pulse-modulated uncertain systems

The system ? _i = ? _i (?) + x _i+2, \(i \in \overline {1,n - 2} \), ? _n?1 = ? _n?1(?) + u ₁, ? _n = ? _n (?) + u ₂,where ? _i (·) are nonanticipating functionals of an arbitrary nature with the following properties—\(\left| {{\varphi _i}\left( \cdot \right)} \right| \leqslant c\sum\nolimits_{k = 1}^i {\left| {{x_k}\left( t \right)} \right|} \), \(i \in \overline {1,n} \), c = const—and u ₁ and u ₂ are the controls is considered. It is assumed that only the outputs x ₁ and x ₂ are measurable. The problem of synthesis of both continuous and impulsive controls u1 and u2, which make the system globally asymptotically stable, is solved. The solution of the problem is based on the construction of the observer-based equations, the quadratic Lyapunov function, and the averaging method.     

The communication complexity of addition

Suppose each of k≤n ^o(1) players holds an n-bit number x _i in its hand. The players wish to determine if ∑ _i≤k x _i =s. We give a public-coin protocol with error 1% and communication O(k logk). The communication bound is independent of n, and for k≥3 improves on the O(k logn) bound by Nisan (Bolyai Soc. Math. Studies; 1993).     

Two-Sided Estimates of Fourier Sums Lebesgue Functions with Respect to Polynomials Orthogonal on Nonuniform Grids

Let Ω = {t₀, t₁, …, t_N} and Ω_N = {x₀, x₁, …, x_N–1}, where x_j = (t_j + t_{j + 1})/2, j = 0, 1, …, N–1 be arbitrary systems of distinct points of the segment [–1, 1]. For each function f(x) continuous on the segment [–1, 1], we construct discrete Fourier sums S_{n, N}( f, x) with respect to the system of polynomials {p?_k,N(x)} _k=0 ^N–1 , forming an orthonormal system on nonuniform point systems Ω_N consisting of finite number N of points from the segment [–1, 1] with weight Δt_j = t_{j + 1}–t_j. We find the growth order for the Lebesgue function L_n,N (x) of the considered partial discrete Fourier sums S_n,N ( f, x) as n = O(δ _N ^?2/7 ), δ_N = max_{0≤ j≤N?1} Δt_j More exactly, we have a two-sided pointwise estimate for the Lebesgue function L_{n, N}(x), depending on n and the position of the point x from [–1, 1].     

Matrix polynomial generalizations of the sample variance-covariance matrix when <Emphasis Type="Italic">pn</Emphasis><Superscript>−1</Superscript> → <Emphasis Type="Italic">y</Emphasis> ∈ (0, ∞)

Let {Z _u = ((ε_{u, i, j}))_p×n} be random matrices where {ε_{u, i, j}} are independently distributed. Suppose {A _i }, {B _i } are non-random matrices of order p × p and n × n respectively. Consider all p × p random matrix polynomials \(P = \prod\nolimits_{i = 1}^{k_l } {\left( {n^{ - 1} A_{t_i } Z_{j_i } B_{s_i } Z_{j_i }^* } \right)A_{t_{k_l + 1} } }\). We show that under appropriate conditions on the above matrices, the elements of the non-commutative *-probability space Span {P} with state p^?1ETr converge. As a by-product, we also show that the limiting spectral distribution of any self-adjoint polynomial in Span{P} exists almost surely.     

The degree of biholomorphic mappings between special domains in ℂ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> preserving 0

Let G _i be a closed Lie subgroup of U(n), Ω _i be a bounded G _i -invariant domain in C ⁿ which contains 0, and \(O{\left( {{\mathbb{C}^n}} \right)^{{G_i}}} = \mathbb{C}\), for i = 1; 2. If f: Ω₁ → Ω₂ is a biholomorphism, and f(0) = 0, then f is a polynomial mapping (see Ning et al. (2017)). In this paper, we provide an upper bound for the degree of such polynomial mappings. It is a natural generalization of the well-known Cartan’s theorem.