首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 109 毫秒
1.
2.
We define a new combinatorial statistic, maximal-inversion, on a permutation. We remark that the number M(n,k) of permutations in Sn with k maximal-inversions is the signless Stirling number c(n,nk) of the first kind. A permutation π in Sn is uniquely determined by its maximal-inversion set . We prove it by making an algorithm for retrieving the permutation from its maximal-inversion set. Also, we remark on how the algorithm can be used directly to determine whether a given set is the maximal-inversion set of a permutation. As an application of the algorithm, we characterize the maximal-inversion set for pattern-avoiding permutations. Then we give some enumerative results concerning permutations with forbidden patterns.  相似文献   

3.
We present a new approach to evaluating combinatorial sums by using finite differences. Let and be sequences with the property that Δbk=ak for k?0. Let , and let . We derive expressions for gn in terms of hn and for hn in terms of gn. We then extend our approach to handle binomial sums of the form , , and , as well as sums involving unsigned and signed Stirling numbers of the first kind, and . For each type of sum we illustrate our methods by deriving an expression for the power sum, with ak=km, and the harmonic number sum, with ak=Hk=1+1/2+?+1/k. Then we generalize our approach to a class of numbers satisfying a particular type of recurrence relation. This class includes the binomial coefficients and the unsigned Stirling numbers of the first kind.  相似文献   

4.
Let n and k be natural numbers and let S(n,k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum
  相似文献   

5.
In this paper we give a criterion for the adjacency matrix of a Cayley digraph to be normal in terms of the Cayley subset S. It is shown with the use of this result that the adjacency matrix of every Cayley digraph on a finite group G is normal iff G is either abelian or has the form for some non-negative integer n, where Q8 is the quaternion group and is the abelian group of order 2n and exponent 2.  相似文献   

6.
7.
From a delta series f(t) and its compositional inverse g(t), Hsu defined the generalized Stirling number pair . In this paper, we further define from f(t) and g(t) the generalized higher order Bernoulli number pair . Making use of the Bell polynomials, the potential polynomials as well as the Lagrange inversion formula, we give some explicit expressions and recurrences of the generalized higher order Bernoulli numbers, present the relations between the generalized higher order Bernoulli numbers of both kinds and the corresponding generalized Stirling numbers of both kinds, and study the relations between any two generalized higher order Bernoulli numbers. Moreover, we apply the general results to some special number pairs and obtain series of combinatorial identities. It can be found that the introduction of generalized Bernoulli number pair and generalized Stirling number pair provides a unified approach to lots of sequences in mathematics, and as a consequence, many known results are special cases of ours.  相似文献   

8.
A non-linear structure preserving matrix method for the computation of a structured low rank approximation of the Sylvester resultant matrix S(f,g) of two inexact polynomials f=f(y) and g=g(y) is considered in this paper. It is shown that considerably improved results are obtained when f(y) and g(y) are processed prior to the computation of , and that these preprocessing operations introduce two parameters. These parameters can either be held constant during the computation of , which leads to a linear structure preserving matrix method, or they can be incremented during the computation of , which leads to a non-linear structure preserving matrix method. It is shown that the non-linear method yields a better structured low rank approximation of S(f,g) and that the assignment of f(y) and g(y) is important because may be a good structured low rank approximation of S(f,g), but may be a poor structured low rank approximation of S(g,f) because its numerical rank is not defined. Examples that illustrate the differences between the linear and non-linear structure preserving matrix methods, and the importance of the assignment of f(y) and g(y), are shown.  相似文献   

9.
In this paper, we study the following extremal problem and its relevance to the sum of the so-called superoptimal singular values of a matrix function: Given an m×n matrix function Φ, when is there a matrix function Ψ in the set such that
  相似文献   

10.
Let , B and Aj () be real nonsingular n×n matrices, λk () be real numbers. In this paper we present a sufficient condition for the system to be a frame for . This sufficient condition also shows the stability of the system with respect to the perturbation of matrix dilation parameters and the perturbation of translation parameters .  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号