There is an increasingly extensive literature on the problem of describing the connection (monodromy) groups and automorphism groups of families of polytopes and maniplexes that are not regular or reflexible. Many such polytopes and maniplexes arise as the result of constructions such as truncations and products. Here we show that for a wide variety of these constructions, the connection group of the output can be described in a nice way in terms of the connection group of the input. We call such operations stratified . Moreover, we show that, if F is a maniplex operation in one of two broad subclasses of stratified operations, and if R is the smallest reflexible cover of some maniplex M , then the connection group of F ( R ) is equal to the connection group of F ( M ). In particular, we show that this is true for truncations and medials of maps, for products of polytopes (including pyramids and prisms over polytopes), and for the mix of maniplexes. As an application, we determine the smallest reflexible covers of the pyramids over the equivelar toroidal maps.
{"title":"Stratified operations on maniplexes","authors":"Gabe Cunningham, D. Pellicer, Gordon Williams","doi":"10.5802/alco.208","DOIUrl":"https://doi.org/10.5802/alco.208","url":null,"abstract":"There is an increasingly extensive literature on the problem of describing the connection (monodromy) groups and automorphism groups of families of polytopes and maniplexes that are not regular or reflexible. Many such polytopes and maniplexes arise as the result of constructions such as truncations and products. Here we show that for a wide variety of these constructions, the connection group of the output can be described in a nice way in terms of the connection group of the input. We call such operations stratified . Moreover, we show that, if F is a maniplex operation in one of two broad subclasses of stratified operations, and if R is the smallest reflexible cover of some maniplex M , then the connection group of F ( R ) is equal to the connection group of F ( M ). In particular, we show that this is true for truncations and medials of maps, for products of polytopes (including pyramids and prisms over polytopes), and for the mix of maniplexes. As an application, we determine the smallest reflexible covers of the pyramids over the equivelar toroidal maps.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46077900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Let $mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $mathbb{C}$. Let $X$ be a subset of the Euclidean space $mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in $X$. In this paper, we prove that if $D(X)subset mathcal{O}_K$ and there exist $s$ values $a_1,ldots, a_s in mathcal{O}_K$ distinct modulo a prime ideal $mathfrak{p}$ of $mathcal{O}_K$ such that each $a_i$ is not zero modulo $mathfrak{p}$ and each element of $D(X)$ is congruent to some $a_i$, then $|X| leq binom{d+s}{s}+binom{d+s-1}{s-1}$.
{"title":"Bounds for sets with few distances distinct modulo a prime ideal","authors":"Hiroshi Nozaki","doi":"10.5802/alco.272","DOIUrl":"https://doi.org/10.5802/alco.272","url":null,"abstract":"Let $mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $mathbb{C}$. Let $X$ be a subset of the Euclidean space $mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in $X$. In this paper, we prove that if $D(X)subset mathcal{O}_K$ and there exist $s$ values $a_1,ldots, a_s in mathcal{O}_K$ distinct modulo a prime ideal $mathfrak{p}$ of $mathcal{O}_K$ such that each $a_i$ is not zero modulo $mathfrak{p}$ and each element of $D(X)$ is congruent to some $a_i$, then $|X| leq binom{d+s}{s}+binom{d+s-1}{s-1}$.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42450478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Orbits on k-subsets of 2-transitive Simple Lie-type Groups","authors":"P. Bradley, P. Rowley","doi":"10.5802/alco.195","DOIUrl":"https://doi.org/10.5802/alco.195","url":null,"abstract":"","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47875310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Chromatic symmetric functions via the group algebra of S n ","authors":"Brendan Pawlowski","doi":"10.5802/alco.134","DOIUrl":"https://doi.org/10.5802/alco.134","url":null,"abstract":"","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43518300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Residually thin and nilpotent table algebras, which are abstractions of fusion rings and adjacency algebras of association schemes, are defined and investigated. A formula for the degrees of basis elements in residually thin table algebras is established, which yields an integrality result of Gelaki and Nikshych as an immediate corollary; and it is shown that this formula holds only for such algebras. These theorems for table algebras specialize to new results for association schemes. Bi-anchored thin-central (BTC) chains of closed subsets are used to define nilpotence, in the manner of Hanaki for association schemes. Lower BTC-chains are defined as an abstraction of the lower central series of a finite group. A partial characterization is proved; and a family of examples illustrates that unlike the case for finite groups, there is not necessarily a unique lower BTC-chain for a nilpotent table algebra or association scheme.
{"title":"On residually thin and nilpotent table algebras, fusion rings, and association schemes","authors":"H. I. Blau","doi":"10.5802/alco.194","DOIUrl":"https://doi.org/10.5802/alco.194","url":null,"abstract":"Residually thin and nilpotent table algebras, which are abstractions of fusion rings and adjacency algebras of association schemes, are defined and investigated. A formula for the degrees of basis elements in residually thin table algebras is established, which yields an integrality result of Gelaki and Nikshych as an immediate corollary; and it is shown that this formula holds only for such algebras. These theorems for table algebras specialize to new results for association schemes. Bi-anchored thin-central (BTC) chains of closed subsets are used to define nilpotence, in the manner of Hanaki for association schemes. Lower BTC-chains are defined as an abstraction of the lower central series of a finite group. A partial characterization is proved; and a family of examples illustrates that unlike the case for finite groups, there is not necessarily a unique lower BTC-chain for a nilpotent table algebra or association scheme.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42555692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map of Kratthenthaler and reduces to the hard Lefschetz theorem.
{"title":"Equivariant log-concavity of graph matchings","authors":"Shi-jie Li","doi":"10.5802/alco.284","DOIUrl":"https://doi.org/10.5802/alco.284","url":null,"abstract":"For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map of Kratthenthaler and reduces to the hard Lefschetz theorem.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42054058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Trevor K. Karn, George D. Nasr, N. Proudfoot, Lorenzo Vecchi
We study the way in which equivariant Kazhdan-Lusztig polynomials, equivariant inverse Kazhdan-Lusztig polynomials, and equivariant Z-polynomials of matroids change under the operation of relaxation of a collection of stressed hyperplanes. This allows us to compute these polynomials for arbitrary paving matroids, which we do in a number of examples, including various matroids associated with Steiner systems that admit actions of Mathieu groups.
{"title":"Equivariant Kazhdan–Lusztig theory of paving matroids","authors":"Trevor K. Karn, George D. Nasr, N. Proudfoot, Lorenzo Vecchi","doi":"10.5802/alco.281","DOIUrl":"https://doi.org/10.5802/alco.281","url":null,"abstract":"We study the way in which equivariant Kazhdan-Lusztig polynomials, equivariant inverse Kazhdan-Lusztig polynomials, and equivariant Z-polynomials of matroids change under the operation of relaxation of a collection of stressed hyperplanes. This allows us to compute these polynomials for arbitrary paving matroids, which we do in a number of examples, including various matroids associated with Steiner systems that admit actions of Mathieu groups.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47125911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes directed trees. This latter conjecture would be implied by an affirmative answer to a question of Hasebe and Tsujie about the $P$-partition enumerator distinguishing posets whose Hasse diagrams are trees. They proved the case of rooted trees and our results include a generalization of their result.
{"title":"Quasisymmetric functions distinguishing trees","authors":"J. Aval, Karimatou Djenabou, Peter R. W. McNamara","doi":"10.5802/alco.273","DOIUrl":"https://doi.org/10.5802/alco.273","url":null,"abstract":"A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes directed trees. This latter conjecture would be implied by an affirmative answer to a question of Hasebe and Tsujie about the $P$-partition enumerator distinguishing posets whose Hasse diagrams are trees. They proved the case of rooted trees and our results include a generalization of their result.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42031669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ada Chan, Whitney A. Drazen, Or Eisenberg, Mark Kempton, Gábor Lippner
We initiate the study of pretty good quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of pretty good fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give complete characterizations of when pretty good fractional revival can occur in paths and in cycles.
{"title":"Pretty good quantum fractional revival in paths and cycles","authors":"Ada Chan, Whitney A. Drazen, Or Eisenberg, Mark Kempton, Gábor Lippner","doi":"10.5802/alco.189","DOIUrl":"https://doi.org/10.5802/alco.189","url":null,"abstract":"We initiate the study of pretty good quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of pretty good fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give complete characterizations of when pretty good fractional revival can occur in paths and in cycles.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46379068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The classical Kostka matrix counts semistandard tableaux and expands Schur symmetric functions in terms of monomial symmetric functions. The entries in the inverse Kostka matrix can be computed by various algebraic and combinatorial formulas involving determinants, special rim hook tableaux, raising operators, and tournaments. Our goal here is to develop an analogous combinatorial theory for the inverse of the immaculate Kostka matrix. The immaculate Kostka matrix enumerates dual immaculate tableaux and gives a combinatorial definition of the dual immaculate quasisymmetric functions Sα. We develop several formulas for the entries in the inverse of this matrix based on suitably generalized raising operators, tournaments, and special rim-hook tableaux. Our analysis reveals how the combinatorial conditions defining dual immaculate tableaux arise naturally from algebraic properties of raising operators. We also obtain an elementary combinatorial proof that the definition of Sα via dual immaculate tableaux is equivalent to the definition of the immaculate noncommutative symmetric functions Sα via noncommutative Jacobi–Trudi determinants. A factorization of raising operators leads to bases of NSym interpolating between the S-basis and the h-basis, and bases of QSym interpolating between the S∗-basis and the M -basis. We also give t-analogues for most of these results using combinatorial statistics defined on dual immaculate tableaux and tournaments.
{"title":"Combinatorics of the immaculate inverse Kostka matrix","authors":"N. Loehr, Elizabeth M. Niese","doi":"10.5802/alco.193","DOIUrl":"https://doi.org/10.5802/alco.193","url":null,"abstract":"The classical Kostka matrix counts semistandard tableaux and expands Schur symmetric functions in terms of monomial symmetric functions. The entries in the inverse Kostka matrix can be computed by various algebraic and combinatorial formulas involving determinants, special rim hook tableaux, raising operators, and tournaments. Our goal here is to develop an analogous combinatorial theory for the inverse of the immaculate Kostka matrix. The immaculate Kostka matrix enumerates dual immaculate tableaux and gives a combinatorial definition of the dual immaculate quasisymmetric functions Sα. We develop several formulas for the entries in the inverse of this matrix based on suitably generalized raising operators, tournaments, and special rim-hook tableaux. Our analysis reveals how the combinatorial conditions defining dual immaculate tableaux arise naturally from algebraic properties of raising operators. We also obtain an elementary combinatorial proof that the definition of Sα via dual immaculate tableaux is equivalent to the definition of the immaculate noncommutative symmetric functions Sα via noncommutative Jacobi–Trudi determinants. A factorization of raising operators leads to bases of NSym interpolating between the S-basis and the h-basis, and bases of QSym interpolating between the S∗-basis and the M -basis. We also give t-analogues for most of these results using combinatorial statistics defined on dual immaculate tableaux and tournaments.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48238728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：