Báo cáo toán học: "A note on palindromic δ-vectors for certain rational polytopes" pdf

... 3 A note on palindromic δ-vectors for certain rational polytopes Matthew H. J. Fiset and Alexander M. Kasprzyk ∗ Department of Mathematics and Statistics University of New Brunswick Fredericton, ... function for L P can be written as a rational function: Ehr P (t) :=  m≥0 L P (m)t m = δ 0 + δ 1 t + . . . + δ k(n+1)−1 t k(n+1)−1 (1 − t k ) n+1 , whose coefficients δ i are non-...

Ngày tải lên: 07/08/2014, 15:22

... 4. Therefore the sequence (a t+1 , . . . , a k ) complies with the assumptions of the lemma (and is not a forbidden one), hence we again obtain a contradiction by induction. the electronic journal ... not forbidden and complies with the assumptions of the lemma, hence, by induction, there is an element a j = 0 such that a j−1 + a j+1  3, a contradiction. Therefore, we may assume every second...

Ngày tải lên: 07/08/2014, 15:22

... ≤ (k−2)r 2 , then by the induction hypothesis d(a, x) ≤ k − 1, which is a contradiction. Therefore (k − 2)r 2 + 1 ≤ |Supp(x) ∩ Supp(a)| ≤ kr 2 , which is the form required for x. Conversely, given x which ... 1 a great variety of behaviour concerning both connectedness and possible diameters. The information in Table 1 on connectedness and diameters for n ≤ 16 was obtained with the assi...

Ngày tải lên: 07/08/2014, 21:21

... the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A note on the almost sure limit theorem for self-normalized partial sums ... to Sponsor Teams for Innovation in the Construction of Talent Highlands in Guangxi Institutions of Higher Learning ([2011]47), and the support program of Key Laboratory of Spatial Infor...

Ngày tải lên: 20/06/2014, 21:20

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:21

... question for all k ≥ 4 and to the second question for all k ≥ 5. We would like to note that there is an interesting discussion about the Burkard–Hammer condition in [9]. Concerning the hamiltonian ... a necessary condition for a split graph G = S(I ∪K, E)with|I| < |K| to be hamiltonian [2] (see Sec. 2 for more detail). We will call this condition the Burkard–Hammer condition. Als...

Ngày tải lên: 06/08/2014, 05:20

... denoted by |w|. Thus |banana| = 6, for example. The language consisting of all words over Σ is denoted by Σ ∗ . If x, y ∈ Σ ∗ , the concatenation of x and y, written xy, is simply the string consisting ... encounter m j since m j is longer than m i . Suppose, for the sake of a contradiction, that m j encounters m i . Say that m j = αf(m i )β where f is a non-erasing substitution. If α =...

Ngày tải lên: 07/08/2014, 06:20

... Bounds on D(n) Our basic strategy for computing upper bounds for dim F n is to write all of the generating functions f λ (q) as rational functions over a common denominator; then the dimension of ... of nonnegative integer solutions to the equation λ 1 x 1 + ···+ λ k x k = N.Consequently, one easily verifies that f λ (q) is the generating function for the entries of the column corres...

Ngày tải lên: 07/08/2014, 06:20