Pub Date : 2025-01-16DOI: 10.1016/j.ejc.2024.104116
Meijie Lu , Xianchang Meng
In this paper, for any integer , we study the distribution of the visible lattice points in certain generalized Pólya walks on : perturbed Pólya walk and twisted Pólya walk. For the first case, we prove that the asymptotic proportion of visible points in a perturbed Pólya walk is almost surely , where denotes the Riemann zeta function. A trivial case of our result covers the standard Pólya walk. Moreover, we do numerical experiments for the second case, we conjecture that the proportion is also almost surely .
{"title":"Visible lattice points in Pólya’s walks","authors":"Meijie Lu , Xianchang Meng","doi":"10.1016/j.ejc.2024.104116","DOIUrl":"10.1016/j.ejc.2024.104116","url":null,"abstract":"<div><div>In this paper, for any integer <span><math><mrow><mi>k</mi><mo>≥</mo><mn>2</mn></mrow></math></span>, we study the distribution of the visible lattice points in certain generalized Pólya walks on <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mi>k</mi></mrow></msup></math></span>: perturbed Pólya walk and twisted Pólya walk. For the first case, we prove that the asymptotic proportion of visible points in a perturbed Pólya walk is almost surely <span><math><mrow><mn>1</mn><mo>/</mo><mi>ζ</mi><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mrow></math></span>, where <span><math><mrow><mi>ζ</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow></math></span> denotes the Riemann zeta function. A trivial case of our result covers the standard Pólya walk. Moreover, we do numerical experiments for the second case, we conjecture that the proportion is also almost surely <span><math><mrow><mn>1</mn><mo>/</mo><mi>ζ</mi><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mrow></math></span>.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"126 ","pages":"Article 104116"},"PeriodicalIF":1.0,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-13DOI: 10.1016/j.ejc.2024.104117
David Bevan , Gi-Sang Cheon , Sergey Kitaev
A partial order on [n] is naturally labelled (NL) if x y implies . We establish a bijection between {3, 2+2}-free NL posets and 12–34-avoiding permutations, determine functional equations satisfied by their generating function, and use series analysis to investigate their asymptotic growth, presenting evidence of stretched exponential behaviour. We also exhibit bijections between 3-free NL posets and various other objects, and determine their generating function. The connection between our results and a hierarchy of combinatorial objects related to interval orders is described.
{"title":"On naturally labelled posets and permutations avoiding 12–34","authors":"David Bevan , Gi-Sang Cheon , Sergey Kitaev","doi":"10.1016/j.ejc.2024.104117","DOIUrl":"10.1016/j.ejc.2024.104117","url":null,"abstract":"<div><div>A partial order <span><math><mo>≺</mo></math></span> on [<em>n</em>] is naturally labelled (NL) if x <span><math><mo>≺</mo></math></span> y implies <span><math><mrow><mi>x</mi><mo><</mo><mi>y</mi></mrow></math></span>. We establish a bijection between {<strong>3</strong>, <strong>2</strong>+<strong>2</strong>}-free NL posets and 12–34-avoiding permutations, determine functional equations satisfied by their generating function, and use series analysis to investigate their asymptotic growth, presenting evidence of stretched exponential behaviour. We also exhibit bijections between <strong>3</strong>-free NL posets and various other objects, and determine their generating function. The connection between our results and a hierarchy of combinatorial objects related to interval orders is described.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"126 ","pages":"Article 104117"},"PeriodicalIF":1.0,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-31DOI: 10.1016/j.ejc.2024.104106
Mikhail Isaev , Maksim Zhukovskii
We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph. The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic equivalence with the maximum component of a vector with independent marginal distributions. The other step is to prove that the distribution of the number of common neighbours for each pair of vertices can be approximated by the binomial distribution.
{"title":"On the maximum number of common neighbours in dense random regular graphs","authors":"Mikhail Isaev , Maksim Zhukovskii","doi":"10.1016/j.ejc.2024.104106","DOIUrl":"10.1016/j.ejc.2024.104106","url":null,"abstract":"<div><div>We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph. The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic equivalence with the maximum component of a vector with independent marginal distributions. The other step is to prove that the distribution of the number of common neighbours for each pair of vertices can be approximated by the binomial distribution.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"126 ","pages":"Article 104106"},"PeriodicalIF":1.0,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143176365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-26DOI: 10.1016/j.ejc.2024.104104
Alvaro Carbonero , Hidde Koerts , Benjamin Moore , Sophie Spirkl
We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs , a hero in is any digraph such that -free digraphs in have bounded dichromatic number. We show that if is an oriented star of degree at least five, the only heroes for the class of -free digraphs are transitive tournaments. For oriented stars of degree exactly four, we show the only heroes in -free digraphs are transitive tournaments, or possibly special joins of transitive tournaments. Aboulker et al. characterized the set of heroes of -free digraphs almost completely, and we show the same characterization for the class of -free digraphs. Lastly, we show that if we forbid two “valid” orientations of brooms, then every transitive tournament is a hero for this class of digraphs.
{"title":"On heroes in digraphs with forbidden induced forests","authors":"Alvaro Carbonero , Hidde Koerts , Benjamin Moore , Sophie Spirkl","doi":"10.1016/j.ejc.2024.104104","DOIUrl":"10.1016/j.ejc.2024.104104","url":null,"abstract":"<div><div>We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs <span><math><mi>C</mi></math></span>, a hero in <span><math><mi>C</mi></math></span> is any digraph <span><math><mi>H</mi></math></span> such that <span><math><mi>H</mi></math></span>-free digraphs in <span><math><mi>C</mi></math></span> have bounded dichromatic number. We show that if <span><math><mi>F</mi></math></span> is an oriented star of degree at least five, the only heroes for the class of <span><math><mi>F</mi></math></span>-free digraphs are transitive tournaments. For oriented stars <span><math><mi>F</mi></math></span> of degree exactly four, we show the only heroes in <span><math><mi>F</mi></math></span>-free digraphs are transitive tournaments, or possibly special joins of transitive tournaments. Aboulker et al. characterized the set of heroes of <span><math><mrow><mo>{</mo><mi>H</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mover><mrow><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow><mo>→</mo></mover><mo>}</mo></mrow></math></span>-free digraphs almost completely, and we show the same characterization for the class of <span><math><mrow><mo>{</mo><mi>H</mi><mo>,</mo><mi>r</mi><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mover><mrow><msub><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mo>→</mo></mover><mo>}</mo></mrow></math></span>-free digraphs. Lastly, we show that if we forbid two “valid” orientations of brooms, then every transitive tournament is a hero for this class of digraphs.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104104"},"PeriodicalIF":1.0,"publicationDate":"2024-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-20DOI: 10.1016/j.ejc.2024.104107
Shishuo Fu , Jie Yang
Let be the number of Dyck paths of semilength with occurrences of and occurrences of . We establish in two ways a new interpretation of the numbers in terms of plane trees and internal nodes. The first way builds on a new characterization of plane trees that involves cyclic compositions. The second proof utilizes a known interpretation of in terms of plane trees and leaves, and a recent involution on plane trees constructed by Li, Lin, and Zhao. Moreover, a group action on the set of cyclic compositions (or equivalently, 2-dominant compositions) is introduced, which amounts to give a combinatorial proof of the -positivity of the Narayana polynomial, as well as the -positivity of the polynomial previously obtained by Bóna et al, with apparently new combinatorial interpretations of their -coefficients.
{"title":"A group action on cyclic compositions and γ-positivity","authors":"Shishuo Fu , Jie Yang","doi":"10.1016/j.ejc.2024.104107","DOIUrl":"10.1016/j.ejc.2024.104107","url":null,"abstract":"<div><div>Let <span><math><msub><mrow><mi>w</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>m</mi></mrow></msub></math></span> be the number of Dyck paths of semilength <span><math><mi>n</mi></math></span> with <span><math><mi>k</mi></math></span> occurrences of <span><math><mrow><mi>U</mi><mi>D</mi></mrow></math></span> and <span><math><mi>m</mi></math></span> occurrences of <span><math><mrow><mi>U</mi><mi>U</mi><mi>D</mi></mrow></math></span>. We establish in two ways a new interpretation of the numbers <span><math><msub><mrow><mi>w</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>m</mi></mrow></msub></math></span> in terms of plane trees and internal nodes. The first way builds on a new characterization of plane trees that involves cyclic compositions. The second proof utilizes a known interpretation of <span><math><msub><mrow><mi>w</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>m</mi></mrow></msub></math></span> in terms of plane trees and leaves, and a recent involution on plane trees constructed by Li, Lin, and Zhao. Moreover, a group action on the set of cyclic compositions (or equivalently, 2-dominant compositions) is introduced, which amounts to give a combinatorial proof of the <span><math><mi>γ</mi></math></span>-positivity of the Narayana polynomial, as well as the <span><math><mi>γ</mi></math></span>-positivity of the polynomial <span><math><mrow><msub><mrow><mi>W</mi></mrow><mrow><mn>2</mn><mi>k</mi><mo>+</mo><mn>1</mn><mo>,</mo><mi>k</mi></mrow></msub><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>≔</mo><msub><mrow><mo>∑</mo></mrow><mrow><mn>1</mn><mo>≤</mo><mi>m</mi><mo>≤</mo><mi>k</mi></mrow></msub><msub><mrow><mi>w</mi></mrow><mrow><mn>2</mn><mi>k</mi><mo>+</mo><mn>1</mn><mo>,</mo><mi>k</mi><mo>,</mo><mi>m</mi></mrow></msub><msup><mrow><mi>t</mi></mrow><mrow><mi>m</mi></mrow></msup></mrow></math></span> previously obtained by Bóna et al, with apparently new combinatorial interpretations of their <span><math><mi>γ</mi></math></span>-coefficients.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104107"},"PeriodicalIF":1.0,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-19DOI: 10.1016/j.ejc.2024.104108
Ignacio García-Marco , Kolja Knauer
In 1978 Babai raised the question whether all minimal Cayley graphs have bounded chromatic number; in 1994 he conjectured a negative answer. In this paper we show that any minimal Cayley graph of a (finitely generated) generalized dihedral or nilpotent group has chromatic number at most 3, while 4 colors are sometimes necessary for soluble groups. On the other hand we address a related question proposed by Babai in 1978 by constructing graphs of unbounded chromatic number that admit a proper edge coloring such that each cycle has some color at least twice. The latter can be viewed as a step towards confirming Babai’s 1994 conjecture – a problem that remains open.
{"title":"Coloring minimal Cayley graphs","authors":"Ignacio García-Marco , Kolja Knauer","doi":"10.1016/j.ejc.2024.104108","DOIUrl":"10.1016/j.ejc.2024.104108","url":null,"abstract":"<div><div>In 1978 Babai raised the question whether all minimal Cayley graphs have bounded chromatic number; in 1994 he conjectured a negative answer. In this paper we show that any minimal Cayley graph of a (finitely generated) generalized dihedral or nilpotent group has chromatic number at most 3, while 4 colors are sometimes necessary for soluble groups. On the other hand we address a related question proposed by Babai in 1978 by constructing graphs of unbounded chromatic number that admit a proper edge coloring such that each cycle has some color at least twice. The latter can be viewed as a step towards confirming Babai’s 1994 conjecture – a problem that remains open.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104108"},"PeriodicalIF":1.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-13DOI: 10.1016/j.ejc.2024.104105
Jakob Führer , Géza Tóth
Conlon and Wu (2022) showed that there is a red/blue-coloring of that does not contain 3 red collinear points separated by unit distance and blue collinear points separated by unit distance. We prove that the statement holds with . We show similar results with different distances between the points.
{"title":"Progressions in Euclidean Ramsey theory","authors":"Jakob Führer , Géza Tóth","doi":"10.1016/j.ejc.2024.104105","DOIUrl":"10.1016/j.ejc.2024.104105","url":null,"abstract":"<div><div>Conlon and Wu (2022) showed that there is a red/blue-coloring of <span><math><msup><mrow><mi>E</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> that does not contain 3 red collinear points separated by unit distance and <span><math><mrow><mi>m</mi><mo>=</mo><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>50</mn></mrow></msup></mrow></math></span> blue collinear points separated by unit distance. We prove that the statement holds with <span><math><mrow><mi>m</mi><mo>=</mo><mn>1177</mn></mrow></math></span>. We show similar results with different distances between the points.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104105"},"PeriodicalIF":1.0,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-12DOI: 10.1016/j.ejc.2024.104095
Seunghwan Oh , John R. Schmitt , Xianzhi Wang
A 1976 question of Martin Gardner asks for the minimum size of a placement of queens on an chessboard that is maximal with respect to the property of ‘no-3-in-a-line’. The work of Cooper, Pikhurko, Schmitt and Warrington showed that this number is at least in the cases that , and at least in the case that . When is odd, Gardner conjectured the lower bound to be . We prove this conjecture in the case that . The proof relies heavily on a recent advancement to the Combinatorial Nullstellensatz for zero-sum grids due to Bogdan Nica.
{"title":"Repeatedly applying the Combinatorial Nullstellensatz for Zero-sum Grids to Martin Gardner’s minimum no-3-in-a-line problem","authors":"Seunghwan Oh , John R. Schmitt , Xianzhi Wang","doi":"10.1016/j.ejc.2024.104095","DOIUrl":"10.1016/j.ejc.2024.104095","url":null,"abstract":"<div><div>A 1976 question of Martin Gardner asks for the minimum size of a placement of queens on an <span><math><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></math></span> chessboard that is maximal with respect to the property of ‘no-3-in-a-line’. The work of Cooper, Pikhurko, Schmitt and Warrington showed that this number is at least <span><math><mi>n</mi></math></span> in the cases that <span><math><mrow><mi>n</mi><mo>⁄</mo><mo>≡</mo><mn>3</mn><mspace></mspace><mrow><mo>(</mo><mo>mod</mo><mspace></mspace><mn>4</mn><mo>)</mo></mrow></mrow></math></span>, and at least <span><math><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></math></span> in the case that <span><math><mrow><mi>n</mi><mo>≡</mo><mn>3</mn><mspace></mspace><mrow><mo>(</mo><mo>mod</mo><mspace></mspace><mn>4</mn><mo>)</mo></mrow></mrow></math></span>. When <span><math><mrow><mi>n</mi><mo>></mo><mn>1</mn></mrow></math></span> is odd, Gardner conjectured the lower bound to be <span><math><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></math></span>. We prove this conjecture in the case that <span><math><mrow><mi>n</mi><mo>≡</mo><mn>1</mn><mspace></mspace><mrow><mo>(</mo><mo>mod</mo><mspace></mspace><mn>4</mn><mo>)</mo></mrow></mrow></math></span>. The proof relies heavily on a recent advancement to the Combinatorial Nullstellensatz for zero-sum grids due to Bogdan Nica.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104095"},"PeriodicalIF":1.0,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-06DOI: 10.1016/j.ejc.2024.104093
Sofia Brenner, Irene Heinrich
We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes form disjoint unions of cliques. This generalizes work by Jenkinson et. al. (2012), Lockett and Truss (2014) as well as Rose (2011) on ultrahomogeneous -graphs. As the key aspect in such a classification, we identify a concept called piecewise ultrahomogeneity. We prove that there are two specific graphs whose occurrence essentially dictates whether a graph is piecewise ultrahomogeneous, and we exploit this fact to prove the classification.
{"title":"Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques","authors":"Sofia Brenner, Irene Heinrich","doi":"10.1016/j.ejc.2024.104093","DOIUrl":"10.1016/j.ejc.2024.104093","url":null,"abstract":"<div><div>We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes form disjoint unions of cliques. This generalizes work by Jenkinson et. al. (2012), Lockett and Truss (2014) as well as Rose (2011) on ultrahomogeneous <span><math><mi>n</mi></math></span>-graphs. As the key aspect in such a classification, we identify a concept called piecewise ultrahomogeneity. We prove that there are two specific graphs whose occurrence essentially dictates whether a graph is piecewise ultrahomogeneous, and we exploit this fact to prove the classification.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104093"},"PeriodicalIF":1.0,"publicationDate":"2024-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-06DOI: 10.1016/j.ejc.2024.104096
Susanna Fishel , Jessica Gatica , Luc Lapointe , María Elena Pinto
The fundamental quasisymmetric functions in superspace are a generalization of the fundamental quasisymmetric functions involving anticommuting variables. We obtain the action of the product, coproduct, and antipode on the fundamental quasisymmetric functions in superspace. We also extend to superspace the well known expansion of the Schur functions in terms of fundamental quasisymmetric functions.
{"title":"Fundamental quasisymmetric functions in superspace","authors":"Susanna Fishel , Jessica Gatica , Luc Lapointe , María Elena Pinto","doi":"10.1016/j.ejc.2024.104096","DOIUrl":"10.1016/j.ejc.2024.104096","url":null,"abstract":"<div><div>The fundamental quasisymmetric functions in superspace are a generalization of the fundamental quasisymmetric functions involving anticommuting variables. We obtain the action of the product, coproduct, and antipode on the fundamental quasisymmetric functions in superspace. We also extend to superspace the well known expansion of the Schur functions in terms of fundamental quasisymmetric functions.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"125 ","pages":"Article 104096"},"PeriodicalIF":1.0,"publicationDate":"2024-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号