
It is investigated when a bijection between finite sets \(A\), \(B\) can be constructed from a bijection between \(F(A)\) and \(F(B)\) for some \(F\). A very general category setting is exhibited and then applied to the cases of disjoint union, product, and power.
Mathematics(all), Relational systems, laws of composition, bijection, category, Categories of algebras, Combinatorial identities, bijective combinatorics, cancellation
Mathematics(all), Relational systems, laws of composition, bijection, category, Categories of algebras, Combinatorial identities, bijective combinatorics, cancellation
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
