The following pages link to Vicentiu Vajnovszki (Q1388062):
Displaying 50 items.
- (Q293423) (redirect page) (← links)
- On the loopless generation of binary tree sequences (Q293424) (← links)
- Generalized Schröder permutations (Q391425) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- A permutation code preserving a double Eulerian bistatistic (Q526811) (← links)
- A new Euler-Mahonian constructive bijection (Q642970) (← links)
- Descent distribution on Catalan words avoiding a pattern of length at most three (Q724887) (← links)
- Mahonian STAT on words (Q894465) (← links)
- Gray coding cubic planar maps (Q906395) (← links)
- (Q924131) (redirect page) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- More restrictive Gray codes for necklaces and Lyndon words (Q963341) (← links)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- Restricted 123-avoiding Baxter permutations and the Padovan numbers (Q997068) (← links)
- The coding of binary trees (Q1388063) (← links)
- Gray visiting Motzkins (Q1403332) (← links)
- The equidistribution of some length-three vincular patterns on \(S_n(132)\) (Q1679910) (← links)
- On shortening \(u\)-cycles and \(u\)-words for permutations (Q1741513) (← links)
- Gray code for derangements (Q1827847) (← links)
- Generating a Gray code for P-sequences (Q1868262) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Lehmer code transforms and Mahonian statistics on permutations (Q1939572) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Catalan and Schröder permutations sortable by two restricted stacks (Q2032179) (← links)
- Gray codes for Fibonacci \(q\)-decreasing words (Q2163389) (← links)
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns (Q2274076) (← links)
- Popularity of patterns over \(d\)-equivalence classes of words and permutations (Q2304570) (← links)
- Mahonian STAT on rearrangement class of words (Q2334048) (← links)
- More restricted growth functions: Gray codes and exhaustive generation (Q2364420) (← links)
- Patterns in treeshelves (Q2404385) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- An efficient Gray code algorithm for generating all permutations with a given major index (Q2447540) (← links)
- Minimal change list for Lucas strings and some graph theoretic consequences (Q2581343) (← links)
- The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three (Q2666581) (← links)
- (Q2752160) (← links)
- (Q3077264) (← links)
- Combinatorial isomorphism between Fibonacci classes (Q3520618) (← links)
- (Q3575473) (← links)
- (Q4436373) (← links)
- (Q4453451) (← links)
- On the reconstruction of a Motzkin Tree from its code (Q4469167) (← links)
- Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations (Q4628503) (← links)
- Asymptotic bit frequency in Fibonacci words (Q5046912) (← links)
- Catalan words avoiding pairs of length three patterns (Q5074768) (← links)
- On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order (Q5217321) (← links)
- (Q5387717) (← links)
- (Q5881841) (← links)
- Grand Dyck paths with air pockets (Q6087087) (← links)
- Greedy Gray codes for Dyck words and ballot sequences (Q6591618) (← links)
