The generating function of a family of the sequences in terms of the continuant

Let a₀, a₁, … , a_r−1 be positive numbers and define a sequence {q_m}, with initial conditions q₀ = 0 and q₁ = 1, and for all m ? 2, q_m = a_tq_m−1 + q_m−2 where m ≡ t(mod r). For r = 2, the author called the sequence {q_m} as the generalized Fibonacci sequences and studied it in [1]. But, it remains open to find a closed form of the generating function for general {q_m}. In this paper, we solve this open problem, that is, we find a closed form of the generating function for {q_m}in terms of the continuant.     

Construction of a Jacobi matrix from spectral data

A proof is given for the existence and uniqueness of a correspondence between two pairs of sequences {a},{b} and {ω},{μ}, satisfying b_i>0 for i=1,…,n?1 and ω₁<μ₁<?<μ_n?1<ω_n, under which the symmetric Jacobi matrices J(n,a,b) and J(n?1,a,b) have eigenvalues {ω} and {μ} respectively. Here J(m,a,b) is symmetric and tridiagonal with diagonal elements a_i (i=1,…,m) and off diagonal elements b_i (i=1,…,m?1). A new concise proof is given for the known uniqueness result. The existence result is new.     

Extensions of band matrices with band inverses

Let R_ij be a given set of μ_i× μ_j matrices for i, j=1,…, n and |i?j| ?m, where 0?m?n?1. Necessary and sufficient conditions are established for the existence and uniqueness of an invertible block matrix =[F_ij], i,j=1,…, n, such that F_ij=R_ij for |i?j|?m, F admits either a left or right block triangular factorization, and (F^?1)_ij=0 for |i?j|>m. The well-known conditions for an invertible block matrix to admit a block triangular factorization emerge for the particular choice m=n?1. The special case in which the given R_ij are positive definite (in an appropriate sense) is explored in detail, and an inequality which corresponds to Burg's maximal entropy inequality in the theory of covariance extension is deduced. The block Toeplitz case is also studied.     

Existence results of a m-point boundary value problem at resonance

Let ξ_i∈(0,1), a_i∈(0,∞), i=1,…,m−2, be given constants satisfying ∑^m−2_i=1a_i=1 and 0<ξ₁<ξ₂<?<ξ_m−2<1. We show the existence of solutions for the m-point boundary value problem

x″=f(t,x,x′),t∈(0,1),     

Splitting multidimensional necklaces

The well-known “splitting necklace theorem” of Alon [N. Alon, Splitting necklaces, Adv. Math. 63 (1987) 247-253] says that each necklace with k⋅ai beads of color i=1,…,n, can be fairly divided between k thieves by at most n(k−1) cuts. Alon deduced this result from the fact that such a division is possible also in the case of a continuous necklace [0,1] where beads of given color are interpreted as measurable sets Ai⊂[0,1] (or more generally as continuous measures μi). We demonstrate that Alon's result is a special case of a multidimensional consensus division theorem about n continuous probability measures μ₁,…,μn on a d-cube d[0,1]. The dissection is performed by m₁+?+md=n(k−1) hyperplanes parallel to the sides of d[0,1] dividing the cube into m₁⋅?⋅md elementary cuboids (parallelepipeds) where the integers mi are prescribed in advance.     

Partitions of a set satisfying certain set of conditions

In this paper we present a new combinatorial class enumerated by Catalan numbers. More precisely, we establish a bijection between the set of partitions π₁π₂?π_n of [n] such that π_i+1−π_i≤1 for all i=,1,2…,n−1, and the set of Dyck paths of semilength n. Moreover, we find an explicit formula for the generating function for the number of partitions π₁π₂?π_n of [n] such that either π_i+?−π_i≤1 for all i=1,2,…,n−?, or π_i+1−π_i≤m for all i=1,2,…,n−1.     

Palindromic prefixes and episturmian words

Let w be an infinite word on an alphabet A. We denote by (ni)_i?1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1?2ni+1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an application, we study the values taken by the quantity lim supni+1/ni, and prove that it is minimal (among all nonperiodic words) for the Fibonacci word.     

The inverse M-matrix problem

One aspect of the inverse M-matrix problem can be posed as follows. Given a positive n × n matrix A=(a_ij) which has been scaled to have unit diagonal elements and off-diagonal elements which satisfy 0 < y ? a_ij ? x < 1, what additional element conditions will guarantee that the inverse of A exists and is an M-matrix? That is, if A^?1=B=(b_ij), then b_ii> 0 and b_ij ? 0 for i≠_j. If n=2 or x=y no further conditions are needed, but if n ? 3 and y < x, then the following is a tight sufficient condition. Define an interpolation parameter s via x²=sy+(1?s)y²; then B is an M-matrix if s^?1 ? n?2. Moreover, if all off-diagonal elements of A have the value y except for a_ij=a_jj=x when i=n?1, n and 1 ? _j ? n?2, then the condition on both necessary and sufficient for B to be an M-matrix.     

Regular Steinhaus graphs of odd degree

A Steinhaus matrix is a binary square matrix of size n which is symmetric, with a diagonal of zeros, and whose upper-triangular coefficients satisfy a_i,j=a_i−1,j−1+a_i−1,j for all 2?i<j?n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states that even Steinhaus graphs, i.e. those with all vertex degrees even, have doubly-symmetric Steinhaus matrices. In 1979 Dymacek conjectured that the complete graph on two vertices K₂ is the only regular Steinhaus graph of odd degree. Using Dymacek’s theorem, we prove that if (a_i,j)_1?i,j?n is a Steinhaus matrix associated with a regular Steinhaus graph of odd degree then its sub-matrix (a_i,j)_2?i,j?n−1 is a multi-symmetric matrix, that is a doubly-symmetric matrix where each row of its upper-triangular part is a symmetric sequence. We prove that the multi-symmetric Steinhaus matrices of size n whose Steinhaus graphs are regular modulo 4, i.e. where all vertex degrees are equal modulo 4, only depend on parameters for all even numbers n, and on parameters in the odd case. This result permits us to verify Dymacek’s conjecture up to 1500 vertices in the odd case.     

On the determinants and inverses of circulant matrices with Fibonacci and Lucas numbers

Let A_n=Circ(F₁,F₂,…,F_n) and B_n=Circ(L₁,L₂,…,L_n) be circulant matrices, where F_n is the Fibonacci number and L_n is the Lucas number. We prove that A_n is invertible for n > 2, and B_n is invertible for any positive integer n. Afterwards, the values of the determinants of matrices A_n and B_n can be expressed by utilizing only the Fibonacci and Lucas numbers. In addition, the inverses of matrices A_n and B_n are derived.     

Collinear subsets of lattice point sequences—An analog of Szemerédi's theorem

Szemerédi's theorem states that given any positive number B and natural number k, there is a number n(k, B) such that if n ? n(k, B) and 0 < a₁ < … < a_n is a sequence of integers with a_n ? Bn, then some k of the a_i form an arithmetic progression. We prove that given any B and k, there is a number m(k, B) such that if m ? m(k, B) and u₀, u₁, …, u_m is a sequence of plane lattice points with ∑_i=1^m…u_i ? u_i?1… ? Bm, then some k of the u_i are collinear. Our result, while similar to Szemerédi's theorem, does not appear to imply it, nor does Szemerédi's theorem appear to imply our result.     

Langford sequences: perfect and hooked

A sequence {d, d+1,…, d+m?1} of m consecutive positive integers is said to be perfect if the integers {1, 2,…, 2m} can be arranged in disjoint pairs {(a_i, b_i): 1?i?m} so that {b_i?a_i: 1?i?m}={d,d+1,…,d+m?1}. A sequence is hooked if the set {1, 2,…, 2m?1 2m+1} can be arranged in pairs to satisfy the same condition. Well known necessary conditions for perfect sequences are herein shown to be sufficient. Similar necessary and sufficient conditions for hooked sequences are given.     

The diagnonal multivariate natural exponential families and their classification

A natural exponential family (NEF)F in ? ⁿ ,n>1, is said to be diagonal if there existn functions,a ₁,...,a _n , on some intervals of ?, such that the covariance matrixV _F (m) ofF has diagonal (a ₁(m ₁),...,a _n (m _n )), for allm=(m ₁,...,m _n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? ^k and ? ^n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? ⁿ , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? ⁿ , under what conditions is its projectionp(F) in ? ^k , underp(x ₁,...,x _n )∶=(x ₁,...,x _k ),k=1,...,n?1, still an NEF in ? ^k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV _F (m ₁,...,m _n ) does not depend on (m _k+1,...,m _n ).     

“Dart calculus” of induced subsets

The paper contains some basic results from “dart calculus” of induced subsets. We obtain as their consequence a negative answer to Hajnal's hypothesis: (m, +1∑i=0n?1(^m_i))→(m?1, 1+∑i?0n?1(^m?1_i)).     

On polynomial-like functions

A polynomial-like function (PLF) of degree n is a smooth function F whose nth derivative never vanishes. A PLF has ?n real zeros; in case of equality it is called hyperbolic; F(i) has ?n−i real zeros. We consider the arrangements of the n(n+1)/2 distinct real numbers , i=0,…,n−1, k=1,…,n−i, which satisfy the conditions . We ask the question whether all such arrangements are realizable by the roots of a hyperbolic PLF and its derivatives. We show that for n?5 the answer is negative.     

Some explicit formulae in simultaneous padé approximation

Using old results on the explicit calculation of determinants, formulae are given for the coefficients of P₀(z) and P₀(z)f_i(z) ? P_i(z), where P_i(z) are polynomials of degree σ ? ρ_i (i=0,1,…,n), P₀(z)f_i(z) ? P_i(z) are power series in which the terms with z^k, 0?k?σ, vanish (i=1,2,…,n), (ρ₀,ρ₁,…,ρ_n) is an (n+1)-tuple of nonnegative integers, σ=ρ₀+ρ₁+?+ρ_n, and {f_i}ⁿ_i=1 is the set of hypergeometric functions {₁F₁(1;c_i;z)}ⁿ_i=1$\text{(c}{}_{\mathrm{i}}\text{?}\text{Z}\text{z.drule;}\text{N}\text{, c}{}_{\mathrm{i}}\text{? c}{}_{\mathrm{j}}\text{?}\text{Z}\text{)}$ or {₂F₀(a_i,1;z)}ⁿ_i=1$\text{(a}{}_{\mathrm{i}}\text{?}\text{Z}\text{?}\text{N}\text{, a}{}_{\mathrm{i}}\text{? a}{}_{\mathrm{j}}\text{?}\text{Z}\text{)}$ under the condition ρ₀?ρ_i ? 1 (i=1,2,…,n).     

Nonhomogeneous spectra of numbers

A simple characterization is given of those sequences of integersM_n={a_i}ⁿ_i=1for which there exist real numbers αandβ such thata_i=?iα+β?(1?i?n). In addition, for givenM_n, an open intervalI_nis computed such that α?I_nif and only ifa_i=?iα+β?(1?i?n)for suitableβ=β(α).     

On the spacings between C-nomial coefficients

Let (Cn)_n?0 be the Lucas sequence Cn+2=aCn+1+bCn for all n?0, where C₀=0 and C₁=1. For 1?k?m−1 let

     

Pelikán's conjecture and cyclotomic cosets

The following conjecture was recently made by J. Pelikán. Let a₀ ,…, a_n be an (n + 1)-tuple of 0's and 1's; let A_k = ?_i=0^n?ka_ia_i+k for k = 0,…, n. Then if n ? 4 some A_k is even.This paper shows that Pelikán's conjecture is false for infinitely many values of n. On the other hand it is also shown that the conjecture is true for most values of n, and a characterization is given of those values of n for which it fails.