Add to ORKGOur comps began as a search for a “near-bijection ” (a mapping which works on all but a small number of elements) between two sets. The first set, call it Z(n), is the set of solutions to ±1 ± 2 ± 3 ±... ± n = 0. The second set, call it W (n), is the set of solutions to ±1 ± 2 ± 3 ±... ± n = 2. For small values of n, a computer search helped us find the following data
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of st...
A bijection is defined recursively between the set of natural numbers and the set of finite rooted t...
AbstractWe show how Dickson's lemma yields an algorithm for computing the general N-solution to a li...
We summarize the various research problems we explored and several of the theorems and proofs we stu...
AbstractCombinatorial proofs of the identities ∑w∈MqInv(w)=n1+n2+⋯+nkn1,n2,⋯,n1=∑w∈Mqz(w) are given ...
AbstractA bijection is defined between the set of all bushes with n+1 leaves and the set of all Schr...
AbstractIn accordance with the principle from other branches of mathematics that it is better to exh...
組合數學的主要目的之一就是要用簡單容易的方法來解決問題。在本篇論文中我們試著用組合的方法去證明以下的等式 ΣC2kkC2t-2kt-k=22t 以往有人用生成函數的方法證出此式，在此我們提出一...
Abstract. In this paper we analyze O’Hara’s partition bijection. We present three type of results. F...
Abstract. We present an extensive survey of bijective proofs of classical partitions identities. Whi...
Diagrams like that in Figure 1 are often presented as proof that N × N and N have the same cardinali...
Problem and proof proposed by authors. Another proof, using lattice paths, can be found in Robert A....
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
In many situations, we would like to check whether an algorithmically given mapping f:A --\u3e B is ...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of st...
A bijection is defined recursively between the set of natural numbers and the set of finite rooted t...
AbstractWe show how Dickson's lemma yields an algorithm for computing the general N-solution to a li...
We summarize the various research problems we explored and several of the theorems and proofs we stu...
AbstractCombinatorial proofs of the identities ∑w∈MqInv(w)=n1+n2+⋯+nkn1,n2,⋯,n1=∑w∈Mqz(w) are given ...
AbstractA bijection is defined between the set of all bushes with n+1 leaves and the set of all Schr...
AbstractIn accordance with the principle from other branches of mathematics that it is better to exh...
組合數學的主要目的之一就是要用簡單容易的方法來解決問題。在本篇論文中我們試著用組合的方法去證明以下的等式 ΣC2kkC2t-2kt-k=22t 以往有人用生成函數的方法證出此式，在此我們提出一...
Abstract. In this paper we analyze O’Hara’s partition bijection. We present three type of results. F...
Abstract. We present an extensive survey of bijective proofs of classical partitions identities. Whi...
Diagrams like that in Figure 1 are often presented as proof that N × N and N have the same cardinali...
Problem and proof proposed by authors. Another proof, using lattice paths, can be found in Robert A....
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
In many situations, we would like to check whether an algorithmically given mapping f:A --\u3e B is ...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of st...
A bijection is defined recursively between the set of natural numbers and the set of finite rooted t...
AbstractWe show how Dickson's lemma yields an algorithm for computing the general N-solution to a li...