Results 191 to 200 of about 117,839 (222)
Some of the next articles are maybe not open access.
Constructing sequential bijections
1997We state a simple condition on a rational subset X of a free monoid B* for the existence of a sequential function that is a one-to-one mapping of some free monoid A* onto X. As a by-product we obtain new sequential bijections of a free monoid onto another.
Christophe Prieur 0002 +2 more
openaire +1 more source
A Bijective Proof of a Theorem of Knuth
Combinatorics, Probability and Computing, 2010The line graph G of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix Tree Theorem to prove a formula for the number of spanning trees of G, and he asked for a bijective proof [6]. In this paper, we give a bijective proof of Knuth's formula. As a result of this proof, we find
Hoda Bidkhori, Shaunak Kishore
openaire +2 more sources
2009
Nous montrons que toute bijection de Pn(K), pour K un corps fini de caractéristique impaire, est induite par une transformation birationnelle sans point d'indétermination ...
openaire +2 more sources
Nous montrons que toute bijection de Pn(K), pour K un corps fini de caractéristique impaire, est induite par une transformation birationnelle sans point d'indétermination ...
openaire +2 more sources
The q-Variations of Sylvester’s Bijection Between Odd and Strict Partitions
Ramanujan Journal, 2005Jiang Zeng
exaly
On a functional equation involving iterates of a bijection on the unit interval
Nonlinear Analysis: Theory, Methods & Applications, 1983Arunava Mukherjea
exaly