Zobrazeno 1 - 10
of 815
pro vyhledávání: '"J Guttmann"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 2, Permutation..., Iss Permutation Patterns (2018)
We review and extend what is known about the generating functions for consecutive pattern-avoiding permutations of length 4, 5 and beyond, and their asymptotic behaviour. There are respectively, seven length-4 and twenty-five length-5 consecutive-Wil
Externí odkaz:
https://doaj.org/article/d99b467cc5014767879df34be271c3b6
Autor:
Anthony J. Guttmann, Iwan Jensen
Publikováno v:
Advances in Applied Mathematics. 148:102520
Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11 terms, bu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac8437a4a112c46553f405f9d60969b8
https://doi.org/10.1016/j.aam.2023.102520
https://doi.org/10.1016/j.aam.2023.102520
Autor:
Anthony J. Guttmann, John C. Dethridge
Publikováno v:
Entropy, Vol 10, Iss 3, Pp 309-318 (2008)
We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating
Externí odkaz:
https://doaj.org/article/5181c79f55584a44a3bb87aed5736706
Publikováno v:
International Journal of Algebra and Computation. 29:179-243
We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups [Formula: see text], the lamplighter group, [Formula: see text] and the Brin–Navas group [Formula: see text]. We have also given an improved algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27b01447dcda4e4a468738dcd4606c8c
https://doi.org/10.1142/s0218196718500686
https://doi.org/10.1142/s0218196718500686
Autor:
Anthony J. Guttmann, Phil Broadbridge
Publikováno v:
Entropy, Vol 11, Iss 1, Pp 59-61 (2009)
n/a
Externí odkaz:
https://doaj.org/article/aedc6f2bc3bd4b0ab37bd5212a84384d
Pattern-avoiding ascent sequences have recently been related to set-partition problems and stack-sorting problems. While the generating functions for several length-3 pattern-avoiding ascent sequences are known, those avoiding 000, 100, 110, 120 are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccb530b611427cd920657575ddc30d5e
We derive a simple functional equation with two catalytic variables characterising the generating function of 3-stack-sortable permutations. Using this functional equation, we extend the 174-term series to 1000 terms. From this series, we conjecture
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e057d0cfd85135fe421f756563741df9
http://arxiv.org/abs/2009.10439
http://arxiv.org/abs/2009.10439
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We study the enumeration of \emphcolumn-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations. We provide a direct recursive construction for the column-convex permutominoes of a given size, based on the application o
Externí odkaz:
https://doaj.org/article/72551fedfa4a40cb8f6c5c92a1a7bd2c
Publikováno v:
European Journal of Combinatorics. 59:71-95
Recently Albert and Bousquet-M\'elou \cite{AB15} obtained the solution to the long-standing problem of the number of permutations sortable by two stacks in parallel (tsip). Their solution was expressed in terms of functional equations. We show that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47c43f7b5d5b9a43c9ef5c57d62115b0
https://doi.org/10.1016/j.ejc.2016.08.002
https://doi.org/10.1016/j.ejc.2016.08.002
Autor:
Yao-Ban Chan, Anthony J. Guttmann
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AC,..., Iss Proceedings (2003)
Using a transfer matrix method, we present some results for directed lattice walkers in a horizontal strip of finite width. Some cases with two walkers in a small width are solved exactly, as are a couple of cases with vicious walkers in a small widt
Externí odkaz:
https://doaj.org/article/1c0bc7bc0156480c85406777a0eac2fe