Results 1 to 10 of about 15,858 (200)
Some of the next articles are maybe not open access.
Random Fibonacci Words via Clone Schur Functions
Forum of Mathematics, SigmaWe investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj +2 more sources
Factoring Pattern-Free Permutations into Separable ones [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2023 We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations.
Édouard Bonnet +3 more
semanticscholar +1 more source
Word-representability of split graphs generated by morphisms [PDF]
Discrete Applied Mathematics, 2021 A graph G = (V,E) is word-representable if and only if there exists a word w over the alphabet V such that letters x and y, x 6= y, alternate in w if and only if xy ∈ E.
Kittitat Iamthong
semanticscholar +1 more source
Permutations Without Long Decreasing Subsequences and Random Matrices [PDF]
Electronic Journal of Combinatorics, 2006 We study the shape of the Young diagram $\lambda$ associated via the Robinson–Schensted–Knuth algorithm to a random permutation in $S_n$ such that the length of the longest decreasing subsequence is not bigger than a fixed number $d$; in other words we ...
Piotr Śniady
semanticscholar +1 more source
Promotion permutations for tableaux [PDF]
Combinatorial Theory, 2023 In our companion paper, we develop a new $SL_4$-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. A guiding principle behind our construction is that
Christian Gaetz +4 more
semanticscholar +1 more source
On the distributions of the lengths of the longest monotone subsequences in random words [PDF]
, 1999 . We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. (In the limit as k→∞ these become the corresponding distributions for permutations on
C. Tracy, H. Widom
semanticscholar +1 more source
Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences [PDF]
Computer/law journal, 2013 We consider two order relations: that induced by the m-ary reflected Gray code and a suffix partitioned variation of it. We show that both of them when applied to some sets of restricted growth sequences still yield Gray codes.
A. Sabri, V. Vajnovszki
semanticscholar +1 more source
Monotone Triangles and 312 Pattern Avoidance [PDF]
Electronic Journal of Combinatorics, 2011 We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric self-complementary plane ...
Arvind Ayyer +2 more
semanticscholar +1 more source
Stack words and a bound for 3-stack sortable permutations [PDF]
Discrete Applied Mathematics, 2019 We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.
M. Bóna
semanticscholar +1 more source