CombinatoricsLet (w_n)0 < n be the sequence known as Integer Sequence A047749 In this paper, we show that the integer w_n enumerates various kinds of symmetric structures of order two. We first consider ternary trees having a reflexive symmetry and we relate all symmetric combinatorial objects by means of bijection. We then generalize the symmetric structures and correspondences to an infinite family of symmetric objects
A preferential arrangement on [ [ n ] ] = { 1 , 2 , … , n } is a ranking of the ele...
AbstractA given structure is said to be asymmetric if its automorphism group reduces to the identity...
The weak and strong Bruhat orders are classical and rich combinatorial objects, with connections to ...
Let (ω n) 0 < n be the sequence known as Integer Sequence A047749 http://www.research.att.co...
Let (ωn)0<n be the sequence known as Integer Sequence A047749 In this paper, we show that the int...
Abstract. In this paper we present a systematic approach to enumeration of differ-ent classes of tre...
AbstractIn a recent paper, Brenti shows that enumerating a conjugacy class of Sn with respect to exc...
This monograph provides a self-contained introduction to symmetric functions and their use in enumer...
A combinatorial bijection is given between pairs of permutations in Sn the product of which is a giv...
Let [n] = {0, 1,...,n}. A subset S of [n] is symmetric if S = g − S for a natural number g. We show ...
AbstractWe establish a combinatorial interpretation for various operations on symmetric functions, s...
AbstractWe present the first nontrivial results on t-stack sortable permutations by constructively p...
A combinatorial bijection is given between pairs of permutations in S, the product of which is a giv...
To appear in Volume 19 of DMTCS.Recent research on the combinatorics of finite sets has explored the...
We give recurrence relations for the enumeration of symmetric elements within four classes of arc di...
A preferential arrangement on [ [ n ] ] = { 1 , 2 , … , n } is a ranking of the ele...
AbstractA given structure is said to be asymmetric if its automorphism group reduces to the identity...
The weak and strong Bruhat orders are classical and rich combinatorial objects, with connections to ...
Let (ω n) 0 < n be the sequence known as Integer Sequence A047749 http://www.research.att.co...
Let (ωn)0<n be the sequence known as Integer Sequence A047749 In this paper, we show that the int...
Abstract. In this paper we present a systematic approach to enumeration of differ-ent classes of tre...
AbstractIn a recent paper, Brenti shows that enumerating a conjugacy class of Sn with respect to exc...
This monograph provides a self-contained introduction to symmetric functions and their use in enumer...
A combinatorial bijection is given between pairs of permutations in Sn the product of which is a giv...
Let [n] = {0, 1,...,n}. A subset S of [n] is symmetric if S = g − S for a natural number g. We show ...
AbstractWe establish a combinatorial interpretation for various operations on symmetric functions, s...
AbstractWe present the first nontrivial results on t-stack sortable permutations by constructively p...
A combinatorial bijection is given between pairs of permutations in S, the product of which is a giv...
To appear in Volume 19 of DMTCS.Recent research on the combinatorics of finite sets has explored the...
We give recurrence relations for the enumeration of symmetric elements within four classes of arc di...
A preferential arrangement on [ [ n ] ] = { 1 , 2 , … , n } is a ranking of the ele...
AbstractA given structure is said to be asymmetric if its automorphism group reduces to the identity...
The weak and strong Bruhat orders are classical and rich combinatorial objects, with connections to ...
DOI
Add to ORKG