共查询到20条相似文献,搜索用时 62 毫秒
1.
In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, then we define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix methods. Further, we give the generating function and combinatorial representations of these numbers. Also we present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves. 相似文献
2.
In this paper, we study the relations between the Bell matrix and the Fibonacci matrix, which provide a unified approach to some lower triangular matrices, such as the Stirling matrices of both kinds, the Lah matrix, and the generalized Pascal matrix. To make the results more general, the discussion is also extended to the generalized Fibonacci numbers and the corresponding matrix. Moreover, based on the matrix representations, various identities are derived. 相似文献
3.
In this paper, we define the generalized Bernoulli polynomial matrix B(α)(x) and the Bernoulli matrix B. Using some properties of Bernoulli polynomials and numbers, a product formula of B(α)(x) and the inverse of B were given. It is shown that not only B(x)=P[x]B, where P[x] is the generalized Pascal matrix, but also B(x)=FM(x)=N(x)F, where F is the Fibonacci matrix, M(x) and N(x) are the (n+1)×(n+1) lower triangular matrices whose (i,j)-entries are and , respectively. From these formulas, several interesting identities involving the Fibonacci numbers and the Bernoulli polynomials and numbers are obtained. The relationships are established about Bernoulli, Fibonacci and Vandermonde matrices. 相似文献
4.
In this short note, we give a factorization of the Pascal matrix. This result was apparently missed by Lee et al. [Some combinatorial identities via Fibonacci numbers, Discrete Appl. Math. 130 (2003) 527-534]. 相似文献
5.
We generalize the definition of a pattern from permutations to alternating sign matrices. The number of alternating sign matrices
avoiding 132 is proved to be counted by the large Schr?der numbers, 1, 2, 6, 22, 90, 394, .... We give a bijection between
132-avoiding alternating sign matrices and Schr?der paths, which gives a refined enumeration. We also show that the 132-,
123-avoiding alternating sign matrices are counted by every second Fibonacci number.
Received January 2, 2007 相似文献
6.
We give upper and lower bounds for the spectral radius of a nonnegative matrix using its row sums and characterize the equality cases if the matrix is irreducible. Then we apply these bounds to various matrices associated with a graph, including the adjacency matrix, the signless Laplacian matrix, the distance matrix, the distance signless Laplacian matrix, and the reciprocal distance matrix. Some known results in the literature are generalized and improved. 相似文献
7.
C.M. da Fonseca 《Discrete Mathematics》2008,308(7):1308-1318
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas that are combinations of Fibonacci numbers. These results are applied to determine, among other things, the number of vertices of any face of the polytope of tridiagonal doubly stochastic matrices. 相似文献
8.
A matrix trace inequality and its application 总被引:1,自引:0,他引:1
In this short paper, we give a complete and affirmative answer to a conjecture on matrix trace inequalities for the sum of positive semidefinite matrices. We also apply the obtained inequality to derive a kind of generalized Golden-Thompson inequality for positive semidefinite matrices. 相似文献
9.
This paper is devoted to a practical formula for computing e
tA, where A is anr×r matrix. Our main result is based on the combinatorial aspect of generalized Fibonacci sequences. Examples and applications
are given.
Date: June 9, 2003. 相似文献
10.
The permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving α-permanents: for arbitrary complex numbers α and β, we show that the α-permanent of any matrix can be expressed as a linear combination of β-permanents of related matrices. Some other identities for the α-permanent of sums and products of matrices are shown, as well as a relationship between the α-permanent and general immanants. We conclude with some discussion and a conjecture for the computational complexity of the α-permanent, and provide some numerical illustrations. 相似文献
11.
We introduce the notion of the generalized Catalan matrix as a kind of lower triangular Toeplitz matrix whose nonzero elements involve the generalized Catalan numbers. Inverse of the linear combination of the Pascal matrix with the identity matrix is computed in Aggarwala and Lamoureux (2002) [1]. In this paper, continuing this idea, we invert various linear combinations of the generalized Catalan matrix with the identity matrix. A simple and efficient approach to invert the Pascal matrix plus one in terms of the Hadamard product of the Pascal matrix and appropriate lower triangular Toeplitz matrices is considered in Yang and Liu (2006) [14]. We derive representations for inverses of linear combinations of the generalized Catalan matrix and the identity matrix, in terms of the Hadamard product which includes the Generalized Catalan matrix and appropriate lower triangular Toeplitz matrix. 相似文献
12.
S. Akbari 《Linear algebra and its applications》2007,421(1):3-15
We study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize certain subclasses of these graphs. Graphs whose adjacency matrices are totally unimodular are also characterized. For bipartite graphs having a unique perfect matching, we provide a formula for the inverse of the corresponding adjacency matrix, and address the problem of when that inverse is diagonally similar to a nonnegative matrix. Special attention is paid to the case that such a graph is unicyclic. 相似文献
13.
Assuming that Y has a singular matrix variate elliptically contoured distribution with respect to the Hausdorff measure, the distributions of several matrices associated to QR, modified QR, SV and polar decompositions of matrix Y are determined, for central and non-central, non-singular and singular cases, as well as their relationship to the Wishart and pseudo-Wishart generalized singular and non-singular distributions. Some of these results are also applied to two particular subfamilies of elliptical distributions, the singular matrix variate normal distribution and the singular matrix variate symmetric Pearson type VII distribution. 相似文献
14.
Todd Kapitula Elizabeth Hibma Hwa-Pyeong Kim Jonathan Timkovich 《Linear algebra and its applications》2013
There is a well-established instability index theory for linear and quadratic matrix polynomials for which the coefficient matrices are Hermitian and skew-Hermitian. This theory relates the number of negative directions for the matrix coefficients which are Hermitian to the total number of unstable eigenvalues for the polynomial. Herein we extend the theory to ?-even matrix polynomials of any finite degree. In particular, unlike previously known cases we show that the instability index depends upon the size of the matrices when the degree of the polynomial is greater than two. We also consider Hermitian matrix polynomials, and derive an index which counts the number of eigenvalues with nonpositive imaginary part. The results are refined if we consider the Hermitian matrix polynomial to be a perturbation of a ?-even polynomials; however, this refinement requires additional assumptions on the matrix coefficients. 相似文献
15.
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographically-least de Bruijn sequence at natural breakpoints of the binary string. We show that the skew and length of these suffixes are enumerated by sequences generalizing the Fibonacci and Lucas numbers, respectively. 相似文献
16.
For an undirected simple graph G, the minimum rank among all positive semidefinite matrices with graph G is called the minimum semidefinite rank (msr) of G. In this paper, we show that the msr of a given graph may be determined from the msr of a related bipartite graph. Finding the msr of a given bipartite graph is then shown to be equivalent to determining which digraphs encode the zero/nonzero pattern of a unitary matrix. We provide an algorithm to construct unitary matrices with a certain pattern, and use previous results to give a lower bound for the msr of certain bipartite graphs. 相似文献
17.
Yongzhi Yang 《Linear algebra and its applications》2009,430(1):511-630
In this paper, we introduce the generalized Leibniz functional matrices and study some algebraic properties of such matrices. To demonstrate applications of these properties, we derive several novel factorization forms of some well-known matrices, such as the complete symmetric polynomial matrix and the elementary symmetric polynomial matrix. In addition, by applying factorizations of the generalized Leibniz functional matrices, we redevelop the known results of factorizations of Stirling matrices of the first and second kind and the generalized Pascal matrix. 相似文献
18.
Yongdo Lim 《Archiv der Mathematik》2005,84(3):268-275
In this paper we consider the convex cone of positive definite matrices as algebraic system equipped with geometric mean and B-loop from the standard matrix polar decomposition. Some algebraic structures of these quasigroups are investigated in the context of matrix theory. In particular, their autotopism groups are completely determined: they are isomorphic to the group of positive real numbers.Received: 28 April 2004 相似文献
19.
Roy S. Wikramaratna 《Linear algebra and its applications》2011,434(1):144-151
This paper defines a new type of matrix (which will be called a centro-invertible matrix) with the property that the inverse can be found by simply rotating all the elements of the matrix through 180 degrees about the mid-point of the matrix. Centro-invertible matrices have been demonstrated in a previous paper to arise in the analysis of a particular algorithm used for the generation of uniformly-distributed pseudo-random numbers.An involutory matrix is one for which the square of the matrix is equal to the identity. It is shown that there is a one-to-one correspondence between the centro-invertible matrices and the involutory matrices. When working in modular arithmetic this result allows all possible k by k centro-invertible matrices with integer entries modulo M to be enumerated by drawing on existing theoretical results for involutory matrices.Consider the k by k matrices over the integers modulo M. If M takes any specified finite integer value greater than or equal to two then there are only a finite number of such matrices and it is valid to consider the likelihood of such a matrix arising by chance. It is possible to derive both exact expressions and order-of-magnitude estimates for the number of k by k centro-invertible matrices that exist over the integers modulo M. It is shown that order (√N) of the N=M(k2) different k by k matrices modulo M are centro-invertible, so that the proportion of these matrices that are centro-invertible is order (1/√N). 相似文献
20.
Maria Bras-Amorós 《Journal of Pure and Applied Algebra》2009,213(6):997-1001
Lower and upper bounds are given for the number ng of numerical semigroups of genus g. The lower bound is the first known lower bound while the upper bound significantly improves the only known bound given by the Catalan numbers. In a previous work the sequence ng is conjectured to behave asymptotically as the Fibonacci numbers. The lower bound proved in this work is related to the Fibonacci numbers and so the result seems to be in the direction to prove the conjecture. The method used is based on an accurate analysis of the tree of numerical semigroups and of the number of descendants of the descendants of each node depending on the number of descendants of the node itself. 相似文献