Báo cáo toán học: "A Generalization of Gosper’s Algorithm to Bibasic" docx
... 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
Ngày tải lên: 05/08/2014, 15:20
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc
... the total number of returns in Dyck paths of length 2n is equal to 3 2n+1 2n+1 n−1 . Each tunnel of length 2 and positive height is just the connection line of a high peak.(Ahigh peak of a ... the rank of a square (i, j) which belongs to the diagram of a permutation in S n is at least i + j − n. the electronic journal of combinatorics 9(2) (2003), #R14 6 A generalizat...
Ngày tải lên: 07/08/2014, 07:21
Báo cáo toán học: "A generalization of generalized Paley graphs and new lower bounds for R(3, q)" pot
... relation gives rise to a partition of A i . In fact, an equivalence class is an orbit of A i under the action of H. Lemma 5 Let k be a special element of ord er s of the automorphis m cyclic graph ... = [A i ] + 1. This amounts to saying that we only need to compute t he clique number of G n [A i ] in order to find that of G n (A i ). To find [A i ] we introduce a total...
Ngày tải lên: 08/08/2014, 11:20
Báo cáo toán học: "A generalization of Combinatorial Nullstellensatz" pot
... like to thank Jarek Grytczuk for stimulating discussions on the polynomial method in Combinatorics. the electronic journal of combinatorics 17 (2010), #N32 5 A generalization of Combinatorial ... 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). So the copies...
Ngày tải lên: 08/08/2014, 11:20
Báo cáo toán học: "A generalization of some Huang–Johnson semifields" pot
... set S is an F q –vector subspace of V = End F q n (F q 2n ) of 1 End N l (S) denotes the vector space of the endomorphisms of S over N l the electronic journ al of combinatorics 18 (2011), #P29 ... 3.4. The semifield S III is, up to isotopy, the trans l ation dual of S II . Proof. Each S i , i ∈ {II, . . . , V III}, is an F 2 –vector subspace of the vector space M of all 2 ×...
Ngày tải lên: 08/08/2014, 12:23
Báo cáo toán học: "A variation of Lomonosov''''s theorem " doc
Ngày tải lên: 05/08/2014, 09:46
Báo cáo toán học: "A variation of Lomonosov''''s theorem" pot
Ngày tải lên: 05/08/2014, 10:20
Báo cáo toán học: "A Hybrid of Darboux’s Method and Singularity Analysis in Combinatorial Asymptotics" potx
... degree factorization of φ as defined above coincides with the complete factorization of φ if and only if φ has all its irreducible factors of different degrees. For the purpose of analysis of algorithms, ... asymptotic expansion of [z n ]f(z) to any predetermined degree of accuracy. The nature of the full expansion. Given the existence of factorizations of type (27) with a...
Ngày tải lên: 07/08/2014, 13:21