共查询到20条相似文献,搜索用时 15 毫秒
1.
Marshall W. Buck Raymond A. Coley David P. Robbins 《Journal of Algebraic Combinatorics》1992,1(2):105-109
We prove two determinantal identities that generalize the Vandermondedeterminant identity
. In the first of our identities the set {0, ..., m} indexing the rows and columns of thedeterminant is replaced by an arbitrary finite order ideal in the set ofsequences of nonnegative integers which are 0 except for a finite numberof components. In the second the index set is replaced by an arbitraryfinite order ideal in the set of all partitions. 相似文献
2.
Let w
0 be the element of maximal length in thesymmetric group S
n
, and let Red(w
0) bethe set of all reduced words for w
0. We prove the identity
which generalizes Stanley's [20] formula forthe cardinality of Red(w
0), and Macdonald's [11] formula
.Our approach uses anobservation, based on a result by Wachs [21], that evaluation of certainspecializations of Schubert polynomials is essentially equivalent toenumeration of plane partitions whose parts are bounded from above. Thus,enumerative results for reduced words can be obtained from the correspondingstatements about plane partitions, and vice versa. In particular, identity(*) follows from Proctor's [14] formula for the number of planepartitions of a staircase shape, with bounded largest part.Similar results are obtained for other permutations and shapes;q-analogues are also given. 相似文献
3.
A. A. Žensykbaev 《Analysis Mathematica》1981,7(4):303-318
Найдены методы восст ановления интеграла по информации $$I\left( f \right) = \left\{ {f^{(j)} \left( {x_i } \right)\left( {j = 0, ..., \gamma _i - 1; i = 1, ..., n; 1 \leqq \gamma _i \leqq r; \gamma _i + ... + \gamma _n \leqq N} \right.} \right\},$$ оптимальные на класс ахW p r ,r=1,2,...; 1≦p≦∞. Это позволило, в частност и, получить наилучшие для классаW p r квадратурные форму лы вида $$\mathop \smallint \limits_0^1 f\left( x \right)dx = \mathop \Sigma \limits_{i = 1}^n \mathop \Sigma \limits_{j = 1}^{\gamma _i - 1} a_{ij} f^{(j)} \left( {x_i } \right) + \mathop \Sigma \limits_{j = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} b_j f^{(2j - 1)} \left( 0 \right) + \mathop \Sigma \limits_{k = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} c_k f^{(2k - 1)} \left( 1 \right) + R\left( f \right)$$ И $$\mathop \smallint \limits_0^1 f\left( x \right)dx = af\left( 0 \right) + \mathop \Sigma \limits_{i = 1}^n \mathop \Sigma \limits_{j = 0}^{\gamma _i - 1} a_{ij} f^{(j)} \left( {x_i } \right) + bf\left( 1 \right) + \mathop \Sigma \limits_{j = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} b_j f^{(2j - 1)} \left( 0 \right) + \mathop \Sigma \limits_{k = 1}^{[{r \mathord{\left/ {\vphantom {r 2}} \right. \kern-\nulldelimiterspace} 2}]} c_k f^{(2k - 1)} \left( 1 \right) + R\left( f \right).$$ 相似文献
4.
A set of codewords isfix-free if it is both prefix-free and suffix-free: no codeword in the set is a prefix or a suffix of any other. A set of codewords {x
1,x
2,...,x
n
} over at-letter alphabet is said to becomplete if it satisfies the Kraft inequality with equality, so that
相似文献
5.
Horst Alzer 《Acta Appl Math》1995,38(3):305-354
In this survey paper, we present refinements, extensions, and variants of the inequality
|