Some inverse results for Hill's equation

We consider Hill's equation y″+(λ−q)y=0 where q∈L¹[0,π]. We show that if l_n—the length of the n-th instability interval—is of order O(n^−(k+2)) then the real Fourier coefficients a_n^k,b_n^k of q^(k)—k-th derivative of q—are of order O(n⁻²), which implies that q^(k) is absolutely continuous almost everywhere for k=0,1,2,….     

Generalized balancing numbers

The positive integer x is a (k, l) -balancing number for y(x ≤ y — 2) if 1^k + 2^k + … + (x — 1)^k = (x + 1)^l + … + (y — 1)^l for fixed positive integers k and l. In this paper, we prove some effective and ineffective finiteness statements for the balancing numbers, using certain Baker-type Diophantine results and Bilu—Tichy theorem, respectively.     

A Komlós Theorem for abstract Banach lattices of measurable functions

Consider a Banach function space X(μ) of (classes of) locally integrable functions over a σ-finite measure space (Ω,Σ,μ) with the weak σ-Fatou property. Day and Lennard (2010) [9] proved that the theorem of Komlós on convergence of Cesàro sums in L¹[0,1] holds also in these spaces; i.e. for every bounded sequence n(fn) in X(μ), there exists a subsequence k(fnk) and a function f∈X(μ) such that for any further subsequence j(hj) of k(fnk), the series converges μ-a.e. to f. In this paper we generalize this result to a more general class of Banach spaces of classes of measurable functions — spaces L¹(ν) of integrable functions with respect to a vector measure ν on a δ-ring — and explore to which point the Fatou property and the Komlós property are equivalent. In particular we prove that this always holds for ideals of spaces L¹(ν) with the weak σ-Fatou property, and provide an example of a Banach lattice of measurable functions that is Fatou but do not satisfy the Komlós Theorem.     

Zero-free regions of derivatives of Riemann zeta function

Zero-free regions of thekth derivative of the Riemann zeta function ζ^(k)(s) are investigated. It is proved that fork≥3, ζ^(k)(s) has no zero in the region Res≥(1·1358826...)k+2. This result is an improvement upon the hitherto known zero-free region Res≥(7/4)k+2 on the right of the imaginary axis. The known zero-free region on the left of the imaginary axis is also improved by proving that ζ ^k)(s) may have at the most a finite number of non-real zeros on the left of the imaginary axis which are confined to a semicircle of finite radiusr _k centred at the origin.     

Some properties and characterizations for generalized multivariate Pareto distributions

In this paper, several distributional properties and characterization theorems of the generalized multivariate Pareto distributions are studied. It is found that the multivariate Pareto distributions have many mixture properties. They are mixed either by geometric, Weibull, or exponential variables. The multivariate Pareto, MP^(k)(I), MP^(k)(II), and MP^(k)(IV) families have closure property under finite sample minima. The MP^(k)(III) family is closed under both geometric minima and geometric maxima. Through the geometric minima procedure, one characterization theorem for MP^(k)(III) distribution is developed. Moreover, the MP^(k)(III) distribution is proved as the limit multivariate distribution under repeated geometric minimization. Also, a characterization theorem for the homogeneous MP^(k)(IV) distribution via the weighted minima among the ordered coordinates is developed. Finally, the MP^(k)(II) family is shown to have the truncation invariant property.     

On the completeness of the system of root vectors of the Sturm-Liouville operator with general boundary conditions

We study general boundary value problems with nondegenerate characteristic determinant Δ(λ) for the Sturm-Liouville equation on the interval [0, 1]. Necessary and sufficient conditions for the completeness of root vectors are obtained in terms of the potential. In particular, it is shown that if Δ(λ) ≠ const, q(·) ∈ C ^k [0, 1] for some k ? 0, and q ^(k)(0) ≠ (?1) ^k q ^(k)(1), then the system of root vectors is complete and minimal in L ^p [0, 1] for p ∈ [1,∞).     

ON possible Turán densities

The Turán density π(F) of a family F of k-graphs is the limit as n → ∞ of the maximum edge density of an F-free k-graph on n vertices. Let Π _∞ ^(k) consist of all possible Turán densities and let Π _fin ^(k) ? Π _∞ ^(k) be the set of Turán densities of finite k-graph families. Here we prove that Π _fin ^(k) contains every density obtained from an arbitrary finite construction by optimally blowing it up and using recursion inside the specified set of parts. As an application, we show that Π _fin ^(k) contains an irrational number for each k ≥ 3. Also, we show that Π _∞ ^(k) has cardinality of the continuum. In particular, Π _∞ ^(k) ≠ Π _fin ^(k) .     

Sklar’s theorem obtained via regularization techniques

Sklar’s theorem establishes the connection between a joint d-dimensional distribution function and its univariate marginals. Its proof is straightforward when all the marginals are continuous. The hard part is the extension to the case where at least one of the marginals has a discrete component. We present a new proof of this extension based on some analytical regularization techniques (i.e., mollifiers) and on the compactness (with respect to the L^∞ norm) of the class of copulas.     

Finding large cycles in Hamiltonian graphs

We show how to find in Hamiltonian graphs a cycle of length n^{Ω(1/loglogn)}=exp(Ω(logn/loglogn)). This is a consequence of a more general result in which we show that if G has a maximum degree d and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then we can find in O(n³) time a cycle in G of length k^Ω(1/logd). From this we infer that if G has a cycle of length k, then one can find in O(n³) time a cycle of length k^{Ω(1/(log(n/k)+loglogn))}, which implies the result for Hamiltonian graphs. Our results improve, for some values of k and d, a recent result of Gabow (2004) [11] showing that if G has a cycle of length k, then one can find in polynomial time a cycle in G of length . We finally show that if G has fixed Euler genus g and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then we can find in polynomial time a cycle in G of length f(g)k^Ω(1), running in time O(n²) for planar graphs.     

The dynamics of the line and path graph operators

For any integerk e 1 thek- path graph P_k (G) of a graph G has all length-k subpaths ofG as vertices, and two such vertices are adjacent whenever their union (as subgraphs ofG) forms a path or cycle withk + 1 edges. Fork = 1 we get the well-known line graphP ₁ (G) =L(G). Iteratedk-path graphs P^t _k(G) are defined as usual by P^t _k (G) := P_k(P ^t?1 _k(G)) ift < 1, and by P¹ _k(G): = P_k(G). A graph G isP _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -periodic. A graph has infiniteP _k -depth if for any positive integert there is a graphH such that P^t _k(H) ?G. In this paperP _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -periodic graphs,P _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -convergent graphs, and graphs with infiniteP _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -depth are characterized inside some subclasses of the class of locally finite graphs fork = 1, 2.     

Characterizations of locally testable events

Let Σ be a finite alphabet, Σ^* the free monoid generated by Σ and χ the length of χ ∈ Σ^*. For any integer k0, f_k(χ) (t_k(χ)) is χ if χ < k + 1, and it is the prefix (suffix) of χ of length k, othewise. Also let m_k+1(χ) = {νχ = uνw and ν = k+1}. For χ, y ε Σ^* define χ ～ _k+1y iff f_k(χ) = f_k(y), t_k(χ) = t_k(y) and m_k+1(χ) = m_k+1(y). The relation ～_k+1 is a congruence of finite index over Σ^*. An event E ? Σ^* is (k+1)-testable iff it is a union of congruence classes of ～_k+1. E is locally testable (LT) if it is k+1-testable for some k. (This definition differs from that of [6] but is equivalent.)We show that the family of LT events is a proper sub-family of star-free events of dot-depth 1. LT events and k-testable events are characterized in terms of (a) restricted star-free expressions based on finite and cofinite events; (b) finite automata accepting these events; (c) semigroups; and (d) structural decomposition of such automata. Algorithms are given for deciding whether a regular event is (a) LT and (b) k+1-testable. Generalized definite events are also characterized.     

On the maximum number of permutations with given maximal or minimal distance

Let us denote by R(k, ? λ)[R(k, ? λ)] the maximal number $\text{M}$ such that there exist $\text{M}$ different permutations of the set {1,…, k} such that any two of them have at least λ (at most λ, respectively) common positions. We prove the inequalities R(k, ? λ) ? kR(k ? 1, ? λ ? 1), R(k, ? λ) ? R(k, ? λ ? 1) ? k!, R(k, ? λ) ? kR(k ? 1, ? λ ? 1). We show: R(k, ? k ? 2) = 2, R(k, ? 1) = (k ? 1)!, R(p^m, ? 2) = (p^m ? 2)!, R(p^m + 1, ? 3) = (p^m ? 2)!, $\text{R(k, ? k ? 3) =}\text{k!}\text{2}$, R(k, ? 0) = k, R(p^m, ? 1) = p^m(p^m ? 1), R(p^m + 1, ? 2) = (p^m + 1)p^m(p^m ? 1). The exact value of R(k, ? λ) is determined whenever k ? k₀(k ? λ); we conjecture that R(k, ? λ) = (k ? λ)! for k ? k₀(λ). Bounds for the general case are given and are used to determine that the minimum of |R(k, ? λ) ? R(k, ? λ)| is attained for $\text{λ = (}\text{k}\text{2}\text{) + O(}\text{k}\text{log}\text{k}\text{)}$.     

Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k)

The graphs of the Johnson schemes G(3k, k) and G(3k + 1, k) are characterized by their parameters. In particular this finishes the characterization of the tetrahedral graphs G(n, 3).     

The transcendental meromorphic solutions of a certain type of nonlinear differential equations

In this paper, we study the differential equations of the following form w²+R(z)²(w(k))=Q(z), where R(z), Q(z) are nonzero rational functions. We proved the following three conclusions: (1) If either P(z) or Q(z) is a nonconstant polynomial or k is an even integer, then the differential equation w²+P²(z)²(w(k))=Q(z) has no transcendental meromorphic solution; if P(z), Q(z) are constants and k is an odd integer, then the differential equation has only transcendental meromorphic solutions of the form f(z)=acos(bz+c). (2) If either P(z) or Q(z) is a nonconstant polynomial or k>1, then the differential equation w²+(z−z₀)P²(z)²(w(k))=Q(z) has no transcendental meromorphic solution, furthermore the differential equation w²+A(z−z₀)²(w^′)=B, where A, B are nonzero constants, has only transcendental meromorphic solutions of the form , where a, b are constants such that Ab²=1, a²=B. (3) If the differential equation , where P is a nonconstant polynomial and Q is a nonzero rational function, has a transcendental meromorphic solution, then k is an odd integer and Q is a polynomial. Furthermore, if k=1, then Q(z)≡C (constant) and the solution is of the form f(z)=Bcosq(z), where B is a constant such that B²=C and q^′(z)=±P(z).     

Existence and Regularity of Solutions to Model for Liquid Mixture of He-He

Existence and regularity of solutions to model for liquid mixture of ³He-⁴He is considered in this paper. First, it is proved that this system possesses a unique global weak solution in H¹(ω,C×R) by using Galerkin method. Secondly, by using an iteration procedure, regularity estimates for the linear semigroups, it is proved that the model for liquid mixture of ³He-⁴He has a unique solution in H^k(ω,C×R) for all k ≥ 1.     

Powers of a matrix and a formula for the moduli of its eigenvalues

The spectral radius of a complex square matrix A is given by ρ(A) = lim sup_{k → ∞} (TrA^k)^1/k. A more general result is proved which gives information about the moduli of all eigenvalues of A.     

Strong Sperner property of the subgroup lattice of an Abelianp-group

Letn andk be arbitrary positive integers,p a prime number and L_(k ⁿ)(p) the subgroup lattice of the Abelianp-group (Z/p ^k ) ⁿ . Then there is a positive integerN(n,k) such that whenp N(n,k),L _(k ^N )(p) has the strong Sperner property.     

Queue layouts of iterated line directed graphs

In this paper, we study queue layouts of iterated line directed graphs. A k-queue layout of a directed graph consists of a linear ordering of the vertices and an assignment of each arc to exactly one of the k queues so that any two arcs assigned to the same queue do not nest. The queuenumber of a directed graph is the minimum number of queues required for a queue layout of the directed graph.We present upper and lower bounds on the queuenumber of an iterated line directed graph L^k(G) of a directed graph G. Our upper bound depends only on G and is independent of the number of iterations k. Queue layouts can be applied to three-dimensional drawings. From the results on the queuenumber of L^k(G), it is shown that for any fixed directed graph G, L^k(G) has a three-dimensional drawing with O(n) volume, where n is the number of vertices in L^k(G). These results are also applied to specific families of iterated line directed graphs such as de Bruijn, Kautz, butterfly, and wrapped butterfly directed graphs. In particular, the queuenumber of k-ary butterfly directed graphs is determined if k is odd.     

Results on the Grundy chromatic number of graphs

Given a graph G, by a Grundy k-coloring of G we mean any proper k-vertex coloring of G such that for each two colors i and j, i<j, every vertex of G colored by j has a neighbor with color i. The maximum k for which there exists a Grundy k-coloring is denoted by Γ(G) and called Grundy (chromatic) number of G. We first discuss the fixed-parameter complexity of determining Γ(G)?k, for any fixed integer k and show that it is a polynomial time problem. But in general, Grundy number is an NP-complete problem. We show that it is NP-complete even for the complement of bipartite graphs and describe the Grundy number of these graphs in terms of the minimum edge dominating number of their complements. Next we obtain some additive Nordhaus-Gaddum-type inequalities concerning Γ(G) and Γ(G^c), for a few family of graphs. We introduce well-colored graphs, which are graphs G for which applying every greedy coloring results in a coloring of G with χ(G) colors. Equivalently G is well colored if Γ(G)=χ(G). We prove that the recognition problem of well-colored graphs is a coNP-complete problem.     

The least degree of identities in the subspace M 1 (m,k) (F) of the matrix superalgebra M (m,k)(F)

We determine the least degree of identities in the subspace M ₁ ^(m,k) (F) of the matrix superalgebra M ^(m,k)(F) over a field F for arbitrary m and k. For the subspace M ₁ ^(m,k) (F) (k > 1) we obtain concrete minimal identities and generalize some results by Chang and Domokos.