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.     

Universal Cycle Packings and Coverings for <Emphasis Type="Italic">k</Emphasis>-Subsets of an <Emphasis Type="Italic">n</Emphasis>-Set

A cyclic sequence of elements of [n] is an (n, k)-Ucycle packing (respectively, (n, k)-Ucycle covering) if every k-subset of [n] appears in this sequence at most once (resp. at least once) as a subsequence of consecutive terms. Let \(p_{n,k}\) be the length of a longest (n, k)-Ucycle packing and \(c_{n,k}\) the length of a shortest (n, k)-Ucycle covering. We show that, for a fixed \(k,p_{n,k}={n\atopwithdelims ()k}-O(n^{\lfloor k/2\rfloor })\). Moreover, when k is not fixed, we prove that if \(k=k(n)\le n^{\alpha }\), where \(0<\alpha <1/3\), then \(p_{n,k}={n\atopwithdelims ()k}-o({n\atopwithdelims ()k}^\beta )\) and \(c_{n,k}={n\atopwithdelims ()k}+o({n\atopwithdelims ()k}^\beta )\), for some \(\beta <1\). Finally, we show that if \(k=o(n)\), then \(p_{n,k}={n\atopwithdelims ()k}(1-o(1))\).     

A Rolle Type Theorem for Cyclicity of Zeros of Families of Analytic Functions

Let \({\{ {f_{\lambda ;j}}\} _{\lambda \in V;1 \leqslant j \leqslant k}}\) be families of holomorphic functions in the open unit disk \({\text{D}} \subset {\Bbb C}\) ? ? depending holomorphically on a parameter λ ∈ V ? ? ⁿ . We establish a Rolle type theorem for the generalized multiplicity (called cyclicity) of zeros of the family of univariate holomorphic functions \({\left\{ {\sum\nolimits_{j = 1}^k {{f_{\lambda ;j}}} } \right\}_{\lambda \in V}}\) at 0 ∈ D. As a corollary, we estimate the cyclicity of the family of generalized exponential polynomials, that is, the family of entire functions of the form \(\sum\nolimits_{k = 1}^m {{P_k}(z){e^{{Q_k}(z)}}} \), z ∈ ?, where P _k and Q _k are holomorphic polynomials of degrees p and q, respectively, parameterized by vectors of coefficients of P _k and Q _k .     

Vertex and Edge Orbits of Fibonacci and Lucas Cubes

The Fibonacci cube \({\Gamma_{n}}\) is obtained from the n-cube Q _n by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube \({\Lambda_{n}}\) is obtained. The number of vertex and edge orbits, the sets of the sizes of the orbits, and the number of orbits of each size, are determined for the Fibonacci cubes and the Lucas cubes under the action of the automorphism group. In particular, the set of vertex orbit sizes of \({\Lambda_{n}}\) is \({\{k \geq 1; k |n\} \cup \{k \geq 18; k |2n\}}\), the number of vertex orbits of \({\Lambda_{n}}\) of size k, where k is odd and divides n, is equal to \({\sum_{d | k} \mu (\frac{k}{d})F_{\lfloor{\frac{d}{2}}\rfloor+2}}\), and the number of edge orbits of \({\Lambda_{n}}\) is equal to the number of vertex orbits of \({\Gamma_{n-3}}\). Dihedral transformations of strings and primitive strings are essential tools to prove these results.     

The limit case of a domination property

The domination number γ(G) of a connected graph G of order n is bounded below by(n+2-e(G))/ 3 , where (G) denotes the maximum number of leaves in any spanning tree of G. We show that (n+2-e(G))/ 3 = γ(G) if and only if there exists a tree T ∈ T ( G) ∩ R such that n1(T ) = e(G), where n1(T ) denotes the number of leaves of T1, R denotes the family of all trees in which the distance between any two distinct leaves is congruent to 2 modulo 3, and T (G) denotes the set composed by the spanning trees of G. As a consequence of the study, we show that if (n+2-e(G))/ 3 = γ(G), then there exists a minimum dominating set in G whose induced subgraph is an independent set. Finally, we characterize all unicyclic graphs G for which equality (n+2-e(G))/ 3= γ(G) holds and we show that the length of the unique cycle of any unicyclic graph G with (n+2-e(G))/ 3= γ(G) belongs to {4} ∪ {3 , 6, 9, . . . }.     

Hrmander Type Theorem for Fourier Multipliers with Optimal Smoothness on Hardy Spaces of Arbitrary Number of Parameters

The main purpose of this paper is to establish the Hormander-Mihlin type theorem for Fourier multipliers with optimal smoothness on k-parameter Hardy spaces for k≥ 3 using the multiparameter Littlewood-Paley theory. For the sake of convenience and simplicity, we only consider the case k = 3, and the method works for all the cases k≥ 3:■where x =(x_1,x_2,x_3)∈R~(n_1)×R~(n_2)×R~(n_3) and ξ =(ξ_1,ξ_2,ξ_3)∈R~(n_1)×R~(n_2)×R~(n_3). One of our main results is the following:Assume that m(ξ) is a function on R~(n_1+n_2+n_3) satisfying ■ with s_i n_i(1/p-1/2) for 1≤i≤3. Then T_m is bounded from H~p(R~(n_1)×R~(n_2)×R~(n_3) to H~p(R~(n_1)×R~(n_2)×R~(n_3)for all 0 p≤1 and ■ Moreover, the smoothness assumption on s_i for 1≤i≤3 is optimal. Here we have used the notations m_(j,k,l)(ξ)=m(2~jξ_1,2~kξ_2,2~lξ_3)Ψ(ξ_1)Ψ(ξ_2)Ψ(ξ_3) and Ψ(ξ_i) is a suitable cut-off function on R~(n_i) for1≤i≤3, and W~(s_1,s_2,s_3) is a three-parameter Sobolev space on R~(n_1)×R~(n_2)× R~(n_3).Because the Fefferman criterion breaks down in three parameters or more, we consider the L~p boundedness of the Littlewood-Paley square function of T_mf to establish its boundedness on the multi-parameter Hardy spaces.     

Approximate results for rainbow labelings

A simple graph \(G=(V,\,E)\) is said to be antimagic if there exists a bijection \(f{\text {:}}\,E\rightarrow [1,\,|E|]\) such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance antimagic if there exists a bijection \(f{\text {:}}\,V\rightarrow [1,\, |V|],\) such that \(\forall x,\,y\in V,\)

$$\begin{aligned} \sum _{x_i\in N(x)}f\left( x_i\right) \ne \sum _{x_j\in N(y)}f\left( x_j\right) . \end{aligned}$$

Using the polynomial method of Alon we prove that there are antimagic injections of any graph G with n vertices and m edges in the interval \([1,\,2n+m-4]\) and, for trees with k inner vertices, in the interval \([1,\,m+k].\) In particular, a tree all of whose inner vertices are adjacent to a leaf is antimagic. This gives a partial positive answer to a conjecture by Hartsfield and Ringel. We also show that there are distance antimagic injections of a graph G with order n and maximum degree \(\Delta \) in the interval \([1,\,n+t(n-t)],\) where \( t=\min \{\Delta ,\,\lfloor n/2\rfloor \},\) and, for trees with k leaves, in the interval \([1,\, 3n-4k].\) In particular, all trees with \(n=2k\) vertices and no pairs of leaves sharing their neighbour are distance antimagic, a partial solution to a conjecture of Arumugam.

     

An extended class of stabilizable uncertain systems

The system of equations \(\frac{{dx}}{{dt}} = A\left( \cdot \right)x + B\left( \cdot \right)u\), where A(·) ∈ ?^{n × n}, B(·) ∈ ?^{n × m}, S(·) ∈ R^{n × m}, is considered. The elements of the matrices A(·), B(·), S(·) are uniformly bounded and are functionals of an arbitrary nature. It is assumed that there exist k elements \({\alpha _{{i_i}{j_l}}}\left( \cdot \right)\left( {l \in \overline {1,k} } \right)\) of fixed sign above the main diagonal of the matrix A(·), and each of them is the only significant element in its row and column. The other elements above the main diagonal are sufficiently small. It is assumed that m = n ?k, and the elements β_ij(·) of the matrix B(·) possess the property \(\left| {{\beta _{{i_s}s}}\left( \cdot \right)} \right| = {\beta _0} > 0\;at\;{i_s}\; \in \;\overline {1,n} \backslash \left\{ {{i_1}, \ldots ,{i_k}} \right\}\). The other elements of the matrix B(·) are zero. The positive definite matrix H = {h_ij} of the following form is constructed. The main diagonal is occupied by the positive numbers h_ii = h_i, \({h_{{i_l}}}_{{j_l}}\, = \,{h_{{j_l}{i_l}}}\, = \, - 0.5\sqrt {{h_{{i_l}}}_{{j_l}}} \,\operatorname{sgn} \,{\alpha _{{i_l}}}_{{j_l}}\left( \cdot \right)\). The other elements of the matrix H are zero. The analysis of the derivative of the Lyapunov function V(x) = x*H^–1x yields h_i\(\left( {i \in \overline {1,n} } \right)\) and λ_i ≤ 0 \(\left( {i \in \overline {1,n} } \right)\) such that for S(·) = H^?1ΛB(·), Λ = diag(λ₁, ..., λ_n), the system of the considered equations becomes globally exponentially stable. The control is robust with respect to the elements of the matrix A(·).     

Bounded Sequences,Orbits and Invariant Subspaces

Let {x _n } be a sequence of complex numbers and let \({\Delta^nx_j = \sum\nolimits_{k=0}^{n} (-1)^k\break\left(\begin{array}{l}n\\ k\\\end{array} \right)x_{n-k+j}}\) . In this paper, we will show that if \({ |x_n| = O(n^k)}\) , as n → ∞ for some positive integer k, and \({n|\Delta^n x_j|^{\frac{1}{n}} \to 0}\) as n→ ∞, then \({\Delta^{k+1} x_j = 0}\) . More importantly, applications to the orbits of operators and invariant subspace problem are also given; this helps to improve former results obtained by Gelfand–Hille, Mbekhta–Zemánek and others.     

Interlacing of zeros of Gegenbauer polynomials of non-consecutive degree from different sequences

A theorem due to Stieltjes’ states that if \({\{p_n\}_{n=0}^\infty}\) is any orthogonal sequence then, between any two consecutive zeros of p _k , there is at least one zero of p _n whenever k < n, a property called Stieltjes interlacing. We show that Stieltjes interlacing extends to the zeros of Gegenbauer polynomials \({C_{n+1}^{\lambda}}\) and \({C_{n-1}^{\lambda+t}}\), \({\lambda > -\frac 12}\), if 0 < t ≤ k + 1, and also to the zeros of \({C_{n+1}^{\lambda}}\) and \({C_{n-2}^{\lambda +k}}\) if \({k\in\{1,2,3\}}\). More generally, we prove that Stieltjes interlacing holds between the zeros of the kth derivative of \({C_{n}^{\lambda}}\) and the zeros of \({C_{n+1}^{\lambda}}\), \({k\in\{1,2,\dots,n-1\}}\) and we derive associated polynomials that play an analogous role to the de Boor–Saff polynomials in completing the interlacing process of the zeros.     

A Formula for the Partition Function That “Counts”

We derive a combinatorial multisum expression for the number D(n, k) of partitions of n with Durfee square of order k. An immediate corollary is therefore a combinatorial formula for p(n), the number of partitions of n. We then study D(n, k) as a quasipolynomial. We consider the natural polynomial approximation \({\tilde{D}(n, k)}\) to the quasipolynomial representation of D(n, k). Numerically, the sum \({\sum_{1\leq k \leq \sqrt{n}} \tilde{D}(n, k)}\) appears to be extremely close to the initial term of the Hardy-Ramanujan-Rademacher convergent series for p(n).     

The <Emphasis Type="Italic">p</Emphasis>-adic order of some fibonomial coefficients whose entries are powers of <Emphasis Type="Italic">p</Emphasis>

Let (F _n ) _n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as

$${\left[ {\begin{array}{*{20}{c}} m \\ k \end{array}} \right]_F} = \frac{{{F_{m - k + 1}} \cdots {F_{m - 1}}{F_m}}}{{{F_1} \cdots {F_k}}}$$

. In 2013, Marques, Sellers and Trojovský proved that if p is a prime number such that p ≡ ±2 (mod 5), then \(p{\left| {\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]} \right._F}\) for all integers a ≥ 1. In 2015, Marques and Trojovský worked on the p-adic order of \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all a ≥ 1 when p ≠ 5. In this paper, we shall provide the exact p-adic order of \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all integers a, b ≥ 1 and for all prime number p.

     

Goldbach’s conjecture in arithmetic progressions: number and size of exceptional prime moduli

Set \({T=N^{\frac{1}{3}-\epsilon}}\). It is proved that for all but \({\ll TL^{-H},\,H > 0}\), exceptional prime numbers \({k\leq T}\) and almost all integers b ₁, b ₂ co-prime to k, almost all integers \({n\sim N}\) satisfying \({n\equiv b_{1}+b_{2}(mod\,k)}\) can be written as the sum of two primes p ₁ and p ₂ satisfying \({p_{i}\equiv b_{i}(mod\,k),\,i=1,2}\). For prime numbers \({k\leq N^{\frac{5}{24}-\epsilon}}\), this result is even true for all but \({\ll (\log\,N)^{D}}\) primes k and all integers b ₁, b ₂ co-prime to k.     

Construction of a (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-visual cryptography scheme

In this paper we give an explicit construction of basis matrices for a (k, n)-visual cryptography scheme \((k,n){\hbox {-}}\mathrm{VCS}\) for integers k and n with \(2\le k \le n\). In balanced VCS every set of participants with equal cardinality has same relative contrast. The VCS constructed in this paper is a balanced \((k,n){\hbox {-}}\mathrm{VCS}\) for general k. Also we obtain a formula for pixel expansion and relative contrast. We also prove that our construction gives optimal contrast and minimum pixel expansion when \(k=n\) and \(n-1\).     

Newly appointed editors

Let k be a field and \(k(x_0,\ldots ,x_{p-1})\) be the rational function field of p variables over k where p is a prime number. Suppose that \(G=\langle \sigma \rangle \simeq C_p\) acts on \(k(x_0,\ldots ,x_{p-1})\) by k-automorphisms defined as \(\sigma :x_0\mapsto x_1\mapsto \cdots \mapsto x_{p-1}\mapsto x_0\). Denote by P the set of all prime numbers and define \(P_0=\{p\in P:\mathbb {Q}(\zeta _{p-1})\) is of class number one\(\}\) where \(\zeta _n\) a primitive n-th root of unity in \(\mathbb {C}\) for a positive integer n; \(P_0\) is a finite set by Masley and Montgomery (J Reine Angew Math 286/287:248–256, 1976). Theorem. Let k be an algebraic number field and \(P_k=\{p\in P: p\) is ramified in \(k\}\). Then \(k(x_0,\ldots ,x_{p-1})^G\) is not stably rational over k for all \(p\in P\backslash (P_0\cup P_k)\).     

Nordhaus–Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates

The induced path number \(\rho (G)\) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path. A product Nordhaus–Gaddum-type result is a bound on the product of a parameter of a graph and its complement. Hattingh et al. (Util Math 94:275–285, 2014) showed that if G is a graph of order n, then \(\lceil \frac{n}{4} \rceil \le \rho (G) \rho (\overline{G}) \le n \lceil \frac{n}{2} \rceil \), where these bounds are best possible. It was also noted that the upper bound is achieved when either G or \(\overline{G}\) is a graph consisting of n isolated vertices. In this paper, we determine best possible upper and lower bounds for \(\rho (G) \rho (\overline{G})\) when either both G and \(\overline{G}\) are connected or neither G nor \(\overline{G}\) has isolated vertices.     

Congruences for Andrews’ (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">i</Emphasis>)-singular overpartitions

Andrews recently defined new combinatorial objects which he called (k, i)-singular overpartitions and proved that they are enumerated by \(\overline{C}_{k,i}(n)\) which is the number of overpartitions of n in which no part is divisible by k and only the parts \(\equiv \pm i \pmod {k}\) may be overlined. Andrews further showed that \(\overline{C}_{3,1}(n)\) satisfies some Ramanujan-type congruences modulo 3. In this paper, we show that for any pair (k, i), \(\overline{C}_{k,i}(n)\) satisfies infinitely many Ramanujan-type congruences modulo any power of prime coprime to 6k. We also show that for an infinite family of k, the value \(\overline{C}_{3k,k}(n)\) is almost always even. Finally, we investigate the parity of \(\overline{C}_{4k,k}\).     

Several extremal approximation problems for the characteristic function of a spherical layer

We discuss three interrelated extremal problems on the set P _n,m of algebraic polynomials of a given degree n on the unit sphere \(\mathbb{S}^{m - 1}\) of the Euclidean space ? ^m of dimension m ≥ 2. (1) Find the norm of the functional \(F\left( \eta \right) = F_h P_n = \int_{\mathbb{G}\left( \eta \right)} {P_n (x)dx}\), which is the integral over the spherical layer \(\mathbb{G}\left( \eta \right) = \left\{ {x = \left( {x_1 , \ldots ,x_m } \right) \in \mathbb{S}^{m - 1} :h' \leqslant x_m \leqslant h''} \right\}\) defined by a pair of real numbers η = (h′, h″), ?1 ≤ h′ < h″ ≤ 1, on the set P _n,m with the norm of the space \(L\left( {\mathbb{S}^{m - 1} } \right)\) of functions summable on the sphere. (2) Find the best approximation in \(L_\infty \left( {\mathbb{S}^{m - 1} } \right)\) of the characteristic function χ _η of the layer \(\mathbb{G}\left( \eta \right)\) by the subspace P _n,m ^⊥ of functions from \(L_\infty \left( {\mathbb{S}^{m - 1} } \right)\) that are orthogonal to the space of polynomials P _n,m . (3) Find the best approximation in the space \(L\left( {\mathbb{S}^{m - 1} } \right)\) of the function χ _η by the space of polynomials P _n,m . We present a solution of all three problems for the values h′ and h″ that are neighboring roots of the polynomial in a single variable of degree n + 1 that deviates least from zero in the space L ₁ ^φ (?1, 1) of functions summable on the interval (?1, 1) with ultraspherical weight φ(t) = (1 ? t ²) ^α , α = (m ? 3)/2. We study the respective one-dimensional problems in the space of functions summable on (?1, 1) with an arbitrary not necessarily ultraspherical weight.     

Description of polygonal regions by polynomials of bounded degree

We show that every (possibly unbounded) convex polygon P in \({\mathbb{R}^2}\) with m edges can be represented by inequalities p ₁ ≥ 0, . . ., p _n ≥ 0, where the p _i ’s are products of at most k affine functions each vanishing on an edge of P and n = n(m, k) satisfies \({s(m, k) \leq n(m, k) \leq (1+\varepsilon_m) s(m, k)}\) with s(m,k) ? max {m/k, log₂ m} and \({\varepsilon_m \rightarrow 0}\) as \({m \rightarrow \infty}\). This choice of n is asymptotically best possible. An analogous result on representing the interior of P in the form p ₁ > 0, . . ., p _n >  0 is also given. For k ≤ m/log₂ m these statements remain valid for representations with arbitrary polynomials of degree not exceeding k.