696 search results - page 5 / 140 » A class of combinatorial identities |
97
Voted
ARSCOM
2007
14 years 11 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
99
Voted
DATESO
2010
14 years 9 months ago
2010
Non-associative quasigroups are well known combinatorial designs with many different applications. Many cryptographic algorithms based on quasigroups primitives have been published...
74
Voted
COMBINATORICS
2000
14 years 11 months ago
2000
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
99
Voted
MOR
2000
14 years 11 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
COMBINATORICS
2007
14 years 11 months ago
2007
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial iden...