Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc

... s is the most general unifier of A n and A' (after suitable renaming of variables). Then the set of ground instances of lists in D n is the set of chain derivations of length n in the ... generate the same languages as the offline parsable grammars. Conclusion The offline parsable grammars apparently have enough formal power to describe natural lan...

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

... fingerprint database FVC2004 database. This database has four sub-databases: DB1, DB2, DB3, and DB4. Each sub-database consists of fingerprint impressions obtained from 100 non-habituated, cooperative ... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A framework of multi...

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

... class="bi x0 y2 w2 h 3" alt =""

Ngày tải lên: 05/08/2014, 09:46

... class="bi x1 y0 w3 h 1" alt =""

Ngày tải lên: 05/08/2014, 09:46

...

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

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

... class="bi x0 y0 w3 h 1" alt =""

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

... class="bi x0 y0 w3 h 1" alt =""

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

... motivated generalization of Gosper’s algorithm to indefinite bibasic hy- pergeometric summation is presented. In particular, it is shown how Paule’s concept of greatest factorial factorization of polynomials ... [P k,1 ···P k,l ] k p,q forms the bibasic factorial factor of P of maximal length k. Iterating this procedure one gets a factorization of P in terms of “greatest”...

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

... 10, 7). As discussed in the proof of Proposition 2, the equality of the diagram squares of rank at most m − 3 for π and σ =Φ m (π)meansthatσ i = π i for all i for which there exist at most m ... upper-right corner of the array, and travels along the boundary of the connected component of the diagram squares of rank zero. (It follows from the lower bound for the rank of...

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

... alternations either with blocks of the form π (k, + ) for  + >or of the form π (k, − ) for  − <, and horizontal alternations with blocks of the form π (k + ,) for k + >kor of the form π (k − ,) for ... than the nth Fibonacci number for some n .The definition of sub-2 n−1 is analogous. the electronic journal of combinatorics 13 (2006), #R54 9 Grid c...

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

... Bender’s theory of coefficient extraction in divergent series [3]. the electronic journal of combinatorics 13 (2006), #R103 25 A Hybrid of Darboux’s Method and Singularity Analysis in Combinatorial ... extraction in combinatorial generating functions, is presented, which combines Darboux’s method and singular- ity analysis theory. This hybrid method appl...

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

... have used the cyclic graphs of prime order to study the lower bounds for classical Ramsey numbers to the effect of improvements and generalizations of the method of Paley graphs. For example, in [7] ... constructed cyclic graphs by using higher residues of finite fields and obtained new lower bounds such like R(3, 3, 1 2)  182, R(3, 3, 13)  212, R(3, 28...

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

... (u) c(v) denote the sum of labels over the the electronic journal of combinatorics 17 (2010), #N32 4 set N(u) of all neighbors of u in G. The function c is called a lucky labeling of G if S(u) = S(w) ... take a product of monomials from factors of h resulting in the monomial M, the sign of M is the same (because G is bipartite and leading coefficients of f v are positive). S...

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

... F q –linear set L(S) of P = P G(V, F q 3 ) o f rank 6 having a unique point P of weight 2 (and hence a unique p l ane π of P of weight 5) and each other point of weight 1. Moreover, if one of the following ... mifield S of F 3 is of type (i, j), then the transpose semifield S t of S is of type (i, j) as well. Proof. It follows from previous arguments and from Proposition 2.3...

Ngày tải lên: 08/08/2014, 12:23