Results 91 to 100 of about 3,028 (216)
A bijection for partitions simultaneously s-regular and t-distinct [PDF]
, 2023 William J. Keith
openalex +1 more source
Bijections behind the Ramanujan Polynomials
Advances in Applied Mathematics, 2001 The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials.
Chen, William Y.C., Guo, Victor J.W.
openaire +3 more sources
Some new families of compositions based on big part restrictions [PDF]
Discrete Mathematics Letters, 2022 Augustine O. Munagi, Mark Shattuck
doaj +1 more source
Producing New Bijections from Old
Advances in Mathematics, 1995 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.
Feldman, D., Propp, J.
openaire +1 more source
Block circulant graphs and the graphs of critical pairs of crowns
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
Combinatorial Generation Algorithms for Directed Lattice Paths
MathematicsGraphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified ...
Yuriy Shablya +2 more
doaj +1 more source
Lenart's bijection via bumpless pipe dreams [PDF]
, 2022 Adam Gregory, Zachary Hamaker
openalex +1 more source
Bijective Recurrences concerning Schröder Paths [PDF]
The Electronic Journal of Combinatorics, 1998 Consider lattice paths in Z$^2$ with three step types: the up diagonal $(1,1)$, the down diagonal $(1,-1)$, and the double horizontal $(2,0)$. For $n \geq 1$, let $S_n$ denote the set of such paths running from $(0,0)$ to $(2n,0)$ and remaining strictly above the x-axis except initially and terminally.
openaire +2 more sources
A Bijection for Partitions with Initial Repetitions [PDF]
, 2010 William J. Keith
openalex +1 more source
A simple bijection between binary trees and colored ternary trees [PDF]
, 2008 Yidong Sun
openalex +1 more source