The enumeration of bicolored plane trees (A054357) has been significantly generalized in [2]. We note that (scaled) Shabat polynomials =-=[1, 4]-=- are also counted by A054357. 2 � •s2 Bijection The bijection from NC polygon diagrams to bicolored binary trees is depicted in the ...
This paper is a short survey of the recent results on examples of periodic two-dimensional continued fractions (in Klein's model). In the last part of this... ON Karpenkov 被引量: 17发表: 2004年 Partitions with numbers in their gaps 1. Partitions with gaps. Bijections between various re...
Let , , ⋯, be k graphs, and let , , ⋯, , be k bijections. The k-composition networks G induced by , , ⋯, is the graph with and . Many interconnection networks such as n-dimensional torus networks, recursive circulant graphs and Cayley graphs on abelian groups generated by mi...
We use these bijections to relate the multiplicity of a simple functor S H , V in M to the multiplicity of V in a certain K Out ( H )-module related to M ( H ). We then use these general results to study the structure of one of the important biset and related functors, namely...
Finally, we consider a coloring problem equivalent to the characterization of such sequences for quasi-affine bijections. Niboucha, RazikaUSTHBSalinier, AlainUniv Limogesjournal de theorie des nombres de bordeaux
linear isometry T of a linear subspace A of L containing H onto such a subspace B, then T can be written as a weighted composition map, namely, Tf = ± (f o Sz) for all f A, where ± B, |±()| = 1 for all in the unit circle and S is an automorphism of L induced by ...
. ., f(k-1) : Vk-1 -> V-k, f(k) : V-k -> V-1 be k bijections. The k-composition networks G induced by G(1), G(2), . . ., G(k) is the graph with V (G) = U-k=1(k) V (G(t)) and E(G) = U-t=1(k) E(G(t)) boolean OR {(a(t), f(t)(a(r...
In the last part of the paper we study properties of the composition vector spaces related to linear operators. We define a family of linear operators associated with a composition vector space. If any operator of this family is a bijection, then the composition vector space is called ...
Let I be an open real interval, G a set of bijections I→I which forms a group under composition (we will call it an iteration group). The author calls G disjoint if the graphs of two distinct elements of G do not intersect, G dense if the union of graphs is dense in I 2 and...
We provide a bijection between two-columned tableaux and labeled binary trees. This bijection maps a quadruple of descent statistics for 2-columned tableaux to left and right ascent-descent statistics on labeled binary trees introduced by Gessel, and we use it to prove that the number of ...