The following pages link to Cayley permutations (Q792334):
Displaying 17 items.
- Efficiently measuring complexity on the basis of real-world data (Q280651) (← links)
- Non-abelian topological approach to non-locality of a hypergraph state (Q296331) (← links)
- Fourier series of sums of products of ordered Bell and poly-Bernoulli functions (Q524803) (← links)
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
- Omitting parentheses from the cyclic notation (Q892114) (← links)
- Updown categories: generating functions and universal covers (Q898157) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- Fourier series of functions involving higher-order ordered Bell polynomials (Q1643961) (← links)
- Some canonical sequences of integers (Q1899396) (← links)
- Transport of patterns by Burge transpose (Q2107496) (← links)
- Fourier series of higher-order ordered Bell functions (Q4631338) (← links)
- Sorting Cayley permutations with pattern-avoiding machines (Q5000313) (← links)
- Fishburn trees (Q6094855) (← links)
- A new class of generalized Fubini polynomials and their computational algorithms (Q6195508) (← links)
- Generalized ordinal patterns in discrete-valued time series: nonparametric testing for serial dependence (Q6611224) (← links)
- Caylerian polynomials (Q6611729) (← links)
- Modified ascent sequences and Bell numbers (Q6635186) (← links)
