{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913383,"version":"3.41.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12061030"],"award-info":[{"award-number":["12061030"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hainan Province","doi-asserted-by":"publisher","award":["122RC652"],"award-info":[{"award-number":["122RC652"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-024-02881-7","type":"journal-article","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T09:18:06Z","timestamp":1735636686000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Permutations that Strongly Avoid the Pattern 312 or 231"],"prefix":"10.1007","volume":"41","author":[{"given":"Junyao","family":"Pan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5712-3122","authenticated-orcid":false,"given":"Pengfei","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"issue":"1","key":"2881_CR1","first-page":"1","volume":"5","author":"K Archer","year":"2014","unstructured":"Archer, K., Elizalde, S.: Cyclic permutations realized by signed shifts. J. Comb. 5(1), 1\u201330 (2014)","journal-title":"J. Comb."},{"issue":"9","key":"2881_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114040","volume":"347","author":"K Archer","year":"2024","unstructured":"Archer, K., Geary, A.: Powers of permutations that avoid chains of patterns. Discret. Math. 347(9), Paper No. 114040 (2024)","journal-title":"Discret. Math."},{"key":"2881_CR3","volume-title":"Combinatorics of Permutations","author":"M B\u00f3na","year":"2012","unstructured":"B\u00f3na, M.: Combinatorics of Permutations, 2nd edn. CRC Press, Boca Raton (2012)","edition":"2"},{"issue":"2","key":"2881_CR4","first-page":"Paper No. 8, 15","volume":"21","author":"M B\u00f3na","year":"2019","unstructured":"B\u00f3na, M., Cory, M.: Cyclic permutations avoiding pairs of patterns of length three. Discret. Math. Theor. Comput. Sci. 21(2), Paper No. 8, 15pp (2019)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"11","key":"2881_CR5","doi-asserted-by":"publisher","first-page":"3194","DOI":"10.1016\/j.disc.2019.06.029","volume":"342","author":"M B\u00f3na","year":"2019","unstructured":"B\u00f3na, M., Smith, R.: Pattern avoidance in permutations and their squares. Discret. Math. 342(11), 3194\u20133200 (2019)","journal-title":"Discret. Math."},{"key":"2881_CR6","doi-asserted-by":"crossref","unstructured":"Burcroff, A., Defant, C.: Pattern-avoiding permutation powers. Discret. Math. 343(11), Paper No. 112017 (2020)","DOI":"10.1016\/j.disc.2020.112017"},{"issue":"6","key":"2881_CR7","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1016\/j.disc.2019.02.011","volume":"342","author":"B Huang","year":"2019","unstructured":"Huang, B.: An upper bound on the number of $$(132, 213)$$-avoiding cyclic permutations. Discret. Math. 342(6), 1762\u20131771 (2019)","journal-title":"Discret. Math."},{"key":"2881_CR8","volume-title":"The Art of Computer Programming","author":"D Knuth","year":"1968","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 1. Addison-Wesley, Boston (1968)"},{"key":"2881_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-022-02602-y","author":"JY Pan","year":"2023","unstructured":"Pan, J.Y.: On a conjecture about strong pattern avoidance. Graphs Combin. (2023). https:\/\/doi.org\/10.1007\/s00373-022-02602-y","journal-title":"Graphs Combin."},{"issue":"4","key":"2881_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","volume":"6","author":"R Simion","year":"1985","unstructured":"Simion, R., Schmidt, F.W.: Restricted permutations. Eur. J. Combin. 6(4), 383\u2013406 (1985)","journal-title":"Eur. J. Combin."},{"key":"2881_CR11","volume-title":"Handbook of Enumerative Combinatorics","author":"V Vatter","year":"2015","unstructured":"Vatter, V.: Permutation classes. In: B\u00f3na, M. (ed.) Handbook of Enumerative Combinatorics. CRC Press, Boca Raton (2015)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02881-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02881-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02881-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:40Z","timestamp":1748319760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02881-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2881"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02881-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"26 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors state no conflict of interest. In this paper, there is no experimental or computer calculated data, and there is only logical proof.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"17"}}