Asymptotic behavior of the maximal zero of a polynomial orthogonal on a segment with a nonclassical weight

Let {p _n (t)} _n=0 ^t8 be a system of algebraic polynomials orthonormal on the segment [?1, 1] with a weight p(t); let {x _n,ν ^(p) } _ν=1 ⁿ be zeros of a polynomial p _n (t) (x _x,ν ^(p) = cosθ _n,ν ^(p) ; 0 < θ _n,1 ^(p) < θ _n,2 ^(p) < ... < θ _n,n ^(p) < π). It is known that, for a wide class of weights p(t) containing the Jacobi weight, the quantities θ _n,1 ^(p) and 1 ? x _n,1 ^(p) coincide in order with n ^?1 and n ^?2, respectively. In the present paper, we prove that, if the weight p(t) has the form p(t) = 4(1 ? t ²)^?1{ln²[(1 + t)/(1 ? t)] + π ²}^?1, then the following asymptotic formulas are valid as n → ∞:

$$\theta _{n,1}^{(p)} = \frac{{\sqrt 2 }}{{n\sqrt {\ln (n + 1)} }}\left[ {1 + {\rm O}\left( {\frac{1}{{\ln (n + 1)}}} \right)} \right],x_{n,1}^{(p)} = 1 - \left( {\frac{1}{{n^2 \ln (n + 1)}}} \right) + O\left( {\frac{1}{{n^2 \ln ^2 (n + 1)}}} \right).$$

     

Output stabilization for a class of uncertain systems

The system

$$\frac{{dx}}{{dt}} = A\left( \cdot \right)x + B\left( \cdot \right)u,{\kern 1pt} \frac{{dy}}{{dt}} = A\left( \cdot \right)y + B\left( \cdot \right)u + D\left( {C*y - v} \right)$$

where v = C*x is an output, u = S*y is a control, A(·) ∈ R ^{n × n} , B(·) ∈ R ^{n × (n–p)}, C ∈ R ^{n × (n–p)}, and D ∈ R ^{n × (n–p)}, is considered. The elements α_ij(·) and β_ij(·) of the matrices A(·) and B(·) are arbitrary functionals satisfying the conditions

$$\mathop {\sup }\limits_{\left( \cdot \right)} |{\alpha _{ij}}\left( \cdot \right)| < \infty \left( {i,j \in 1,n} \right),\mathop {\sup }\limits_{\left( \cdot \right)} |{\beta _{ij}}\left( \cdot \right)| < \infty \left( {i \in 1,n,j \in 1,n - p} \right).$$

It is assumed that A(·) ∈ Z ₁ ∪ Z ₃ and A*(·) ∈ Z ₁ ∪ Z ₃, where Z ₁ is the class of matrices in which the first p elements of the kth superdiagonal are sign-definite and the elements above them are sufficiently small. The class Z ₃ differs from Z _t1 in that the elements between this superdiagonal and the (k + 1)th row are sufficiently small. If k > p, then the elements of the p × p square in the upper left corner of the matrix are sufficiently small as well. By using special quadratic Lyapunov functions, a matrix D for which y(t)–x(t) → 0 exponentially as t → ∞ is first found, and then a matrix S for which the vectors x(t) and y(t) have the same property is constructed.

     

On the k-polygonal numbers and the mean value of Dedekind sums

For any positive integer k ≥ 3, it is easy to prove that the k-polygonal numbers are a_n(k) = (2n+n(n?1)(k?2))/2. The main purpose of this paper is, using the properties of Gauss sums and Dedekind sums, the mean square value theorem of Dirichlet L-functions and the analytic methods, to study the computational problem of one kind mean value of Dedekind sums S(a_n(k)ā_m(k), p) for k-polygonal numbers with 1 ≤ m, n ≤ p ? 1, and give an interesting computational formula for it.     

The <Emphasis Type="Italic">p</Emphasis>-Adic order of the <Emphasis Type="Italic">k</Emphasis>-Fibonacci and <Emphasis Type="Italic">k</Emphasis>-Lucas numbers

Let (F _k,n ) _n and (L _k,n )n be the k-Fibonacci and k-Lucas sequence, respectively, which satisfies the same recursive relation a _n+1 = ka _n + a _n?1 with initial values F _k,0 = 0, F _k,1 = 1, L _k,0 = 2 and L _k,1 = k. In this paper, we characterize the p-adic orders ν _p (F _k,n ) and ν _p (L _k,n ) for all primes p and all positive integers k.     

Harmonic analysis associated with a discrete Laplacian

It is well known that the fundamental solution of

$${u_t}\left( {n,t} \right) = u\left( {n + 1,t} \right) - 2u\left( {n,t} \right) + u\left( {n - 1,t} \right),n \in \mathbb{Z},$$

with u(n, 0) = δ _nm for every fixed m ∈ Z is given by u(n, t) = e ^?2t I _n?m (2t), where I _k (t) is the Bessel function of imaginary argument. In other words, the heat semigroup of the discrete Laplacian is described by the formal series W _t f(n) = Σ _m∈Z e ^?2t I _n?m (2t)f(m). This formula allows us to analyze some operators associated with the discrete Laplacian using semigroup theory. In particular, we obtain the maximum principle for the discrete fractional Laplacian, weighted ? ^p (Z)-boundedness of conjugate harmonic functions, Riesz transforms and square functions of Littlewood-Paley. We also show that the Riesz transforms essentially coincide with the so-called discrete Hilbert transform defined by D. Hilbert at the beginning of the twentieth century. We also see that these Riesz transforms are limits of the conjugate harmonic functions. The results rely on a careful use of several properties of Bessel functions.

     

Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs

A k-factor of a graph G is a k-regular spanning subgraph of G. A k-factorization is a partition of E(G) into k-factors. Let K(n, p) be the complete multipartite graph with p parts, each of size n. If \(V_{1},\ldots , V_{p}\) are the p parts of V(K(n, p)), then a holey k -factor of deficiency \(V_{i}\) of K(n, p) is a k-factor of \(K(n,p)-V_{i}\) for some i satisfying \(1\le i \le p\). Hence a holey k -factorization is a set of holey k-factors whose edges partition E(K(n, p)). Representing each (holey) k-factor as a color class in an edge-coloring, a (holey) k-factorization of K(n, p) is said to be fair if between each pair of parts the color classes have size within one of each other (so the edges are shared “evenly” among the permitted (holey) factors). In this paper the existence of fair 1-factorizations of K(n, p) is completely settled, as is the existence of fair holey 1-factorizations of K(n, p). The latter result can be used to provide a new construction for symmetric quasigroups of order np with holes of size n. Such quasigroups have the additional property that the permitted symbols are shared as evenly as possible among the cells in each \(n \times n\) “box”. These quasigroups are in some sense as far from frames produced by direct products as possible.     

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.

     

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.     

On a classical theorem on the diameter and minimum degree of a graph

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erd¨os, Pach, Pollack and Tuza.We use these bounds in order to study hyperbolic graphs(in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ_0) be the set of graphs G with n vertices and minimum degree δ_0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ_0) = min{δ(G) | G ∈ H(n, δ_0)}, b(n, δ_0) = max{δ(G) |G ∈ H(n, δ_0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ_0) and we compute the precise value of a(n, δ_0), α(n, Δ) andβ(n, Δ) for all values of n, δ_0 and Δ, respectively.     

Testing for change in the mean via convergence in distribution of sup-functionals of weighted tied-down partial sums processes

Let X ₁,..., X _n, n > 1, be nondegenerate independent chronologically ordered realvalued observables with finite means. Consider the “no-change in the mean” null hypothesis H ₀: X ₁,..., X _n is a randomsample on X with Var X <∞. We revisit the problem of nonparametric testing for H ₀ versus the “at most one change (AMOC) in the mean” alternative hypothesis H _A: there is an integer k*, 1 ≤ k* < n, such that EX ₁ = · · · = EX_k* ≠ EX_k*+1 = ··· = EX _n. A natural way of testing for H ₀ versus H _A is via comparing the sample mean of the first k observables to the sample mean of the last n - k observables, for all possible times k of AMOC in the mean, 1 ≤ k < n. In particular, a number of such tests in the literature are based on test statistics that are maximums in k of the appropriately individually normalized absolute deviations Δ_k = |S _k/k - (S _n - S _k)/(n - k)|, where S _k:= X ₁ + ··· + X _k. Asymptotic distributions of these test statistics under H ₀ as n → ∞ are obtained via establishing convergence in distribution of supfunctionals of respectively weighted |Z _n(t)|, where {Z _n(t), 0 ≤ t ≤ 1}_n≥1 are the tied-down partial sums processes such that

$${Z_n}\left( t \right): = \left( {{S_{\left\lceil {\left( {n + 1} \right)t} \right\rceil }} - \left[ {\left( {n + 1} \right)t} \right]{S_n}/n} \right)/\sqrt n $$

if 0 ≤ t < 1, and Z _n(t):= 0 if t = 1. In the present paper, we propose an alternative route to nonparametric testing for H ₀ versus H _A via sup-functionals of appropriately weighted |Z _n(t)|. Simply considering max_1?k<n Δk as a prototype test statistic leads us to establishing convergence in distribution of special sup-functionals of |Z _n(t)|/(t(1 - t)) under H ₀ and assuming also that E|X|^r < ∞ for some r > 2. We believe the weight function t(1 - t) for sup-functionals of |Z _n(t)| has not been considered before.

     

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.     

Lower bounds on the signed total k-domination number of graphs

Let G be a graph with vertex set V(G). For any integer k ≥ 1, a signed total k-dominating function is a function f: V(G) → {?1, 1} satisfying ∑_x∈N(v)f(x) ≥ k for every v ∈ V(G), where N(v) is the neighborhood of v. The minimum of the values ∑_v∈V(G)f(v), taken over all signed total k-dominating functions f, is called the signed total k-domination number. In this note we present some new sharp lower bounds on the signed total k-domination number of a graph. Some of our results improve known bounds.     

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.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

Superlarge deviations for sums of random variables with arithmetical super-exponential distributions

Local limit theorems are obtained for superlarge deviations of sums S(n) = ξ(1) + ... + ξ(n) of independent identically distributed random variables having an arithmetical distribution with the right-hand tail decreasing faster that that of a Gaussian law. The distribution of ξ has the form ?(ξ = k) = \(e^{ - k^\beta L(k)} \), where β > 2, k ∈ ? (? is the set of all integers), and L(t) is a slowly varying function as t → ∞ which satisfies some regularity conditions. These theorems describing an asymptotic behavior of the probabilities ?(S(n) = k) as k/n → ∞, complement the results on superlarge deviations in [4, 5].     

On Convex Geometric Graphs with no $$$$ Pairwise Disjoint Edges

A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on n vertices that does not contain \(k+1\) pairwise disjoint edges is kn (provided \(n>2k\)). For \(k=1\) and \(k=n/2-1\), the extremal examples are completely characterized. For all other values of k, the structure of the extremal examples is far from known: their total number is unknown, and only a few classes of examples were presented, that are almost symmetric, consisting roughly of the kn “longest possible” edges of CK(n), the complete CGG of order n. In order to understand further the structure of the extremal examples, we present a class of extremal examples that lie at the other end of the spectrum. Namely, we break the symmetry by requiring that, in addition, the graph admit an independent set that consists of q consecutive vertices on the boundary of the convex hull. We show that such graphs exist as long as \(q \le n-2k\) and that this value of q is optimal. We generalize our discussion to the following question: what is the maximal possible number f(n, k, q) of edges in a CGG on n vertices that does not contain \(k+1\) pairwise disjoint edges, and, in addition, admits an independent set that consists of q consecutive vertices on the boundary of the convex hull? We provide a complete answer to this question, determining f(n, k, q) for all relevant values of n, k and q.     

Distance domination of generalized de Bruijn and Kautz digraphs

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G _B (n, d) and generalized Kautz digraphs G _K (n, d) are good candidates for interconnection networks. Denote Δ _k := (∑ _j=0 ^k d ^j )^?1. F. Tian and J. Xu showed that ?nΔ _k ? γ _k (G _B (n, d)) ≤?n/d ^k? and ?nΔ _k ? ≤ γ _k (G _K (n, d)) ≤ ?n/d ^k ?. In this paper, we prove that every generalized de Bruijn digraph G _B (n, d) has the distance k-domination number ?nΔ _k ? or ?nΔ _k ?+1, and the distance k-domination number of every generalized Kautz digraph G _K (n, d) bounded above by ?n/(d ^k?1+d ^k )?. Additionally, we present various sufficient conditions for γ _k (G _B (n, d)) = ?nΔ _k ? and γ _k (G _K (n, d)) = ?nΔ _k ?.     

A tracing of the fractional temperature field

This paper is devoted to a study of L~q-tracing of the fractional temperature field u(t, x)—the weak solution of the fractional heat equation(?_t +(-?_x)~α)u(t, x) = g(t, x) in L~p(R_+~(1+n)) subject to the initial temperature u(0, x) = f(x) in L~p(R~n).     

Note on a conjecture for the sum of signless Laplacian eigenvalues

For a simple graph G on n vertices and an integer k with 1 ? k ? n, denote by \(\mathcal{S}^+_k\) (G) the sum of k largest signless Laplacian eigenvalues of G. It was conjectured that \(\mathcal{S}^+_k(G)\leqslant{e}(G)+(^{k+1}_{\;\;2})\) (G) ? e(G) + (k+1 2), where e(G) is the number of edges of G. This conjecture has been proved to be true for all graphs when k ∈ {1, 2, n ? 1, n}, and for trees, unicyclic graphs, bicyclic graphs and regular graphs (for all k). In this note, this conjecture is proved to be true for all graphs when k = n ? 2, and for some new classes of graphs.     

Semistability of Frobenius Direct Image of Representations of Cotangent Bundles

Let k be an algebraically closed field of characteristic p > 0, X a smooth projective variety over k with a fixed ample divisor H, F_X : X → X the absolute Frobenius morphism on X. Let E be a rational GL_n(k)-bundle on X, and ρ : GL_n(k) → GL_m(k) a rational GL_n(k)-representation of degree at most d such that ρ maps the radical RGL_n(k)) of GL_n(k) into the radical R(GL_m(k)) of GL_m(k). We show that if \(F_X^{N*}(E)\) is semistable for some integer \(N \ge {\max {_{0 < r < m}}}(_r^m) \cdot {\log _p}(dr)\), then the induced rational GL_m(k)-bundle E(GL_m(k)) is semistable. As an application, if dimX = n, we get a sufficient condition for the semistability of Frobenius direct image \(F_{X*}(\rho*(\Omega_X^1))\), where \(\rho*(\Omega_X^1)\) is the vector bundle obtained from \(\Omega_X^1\) via the rational representation ρ.