Francesca Dalla Volta, Fabio Mastrogiacomo, Pablo Spiga
{"title":"On the cardinality of irredundant and minimal bases of finite permutation groups","authors":"Francesca Dalla Volta, Fabio Mastrogiacomo, Pablo Spiga","doi":"10.1007/s10801-024-01343-w","DOIUrl":"https://doi.org/10.1007/s10801-024-01343-w","url":null,"abstract":"<p>Given a finite permutation group <i>G</i> with domain <span>(Omega )</span>, we associate two subsets of natural numbers to <i>G</i>, namely <span>({mathcal {I}}(G,Omega ))</span> and <span>({mathcal {M}}(G,Omega ))</span>, which are the sets of cardinalities of all the irredundant and minimal bases of <i>G</i>, respectively. We prove that <span>({mathcal {I}}(G,Omega ))</span> is an interval of natural numbers, whereas <span>({mathcal {M}}(G,Omega ))</span> may not necessarily form an interval. Moreover, for a given subset of natural numbers <span>(X subseteq {mathbb {N}})</span>, we provide some conditions on <i>X</i> that ensure the existence of both intransitive and transitive groups <i>G</i> such that <span>({mathcal {I}}(G,Omega ) = X)</span> and <span>({mathcal {M}}(G,Omega ) = X)</span>.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"35 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141550302","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}
{"title":"Transitive generalized toggle groups containing a cycle","authors":"Jonathan S. Bloom, Dan Saracino","doi":"10.1007/s10801-024-01348-5","DOIUrl":"https://doi.org/10.1007/s10801-024-01348-5","url":null,"abstract":"<p>In (Striker in Discret Math Theor Comput Sci 20, 2018), Striker generalized Cameron and Fon-Der-Flaass’s notion of a toggle group. In this paper, we begin the study of transitive generalized toggle groups that contain a cycle. We first show that if such a group has degree <i>n</i> and contains a transposition or a 3-cycle, then the group contains <span>(A_n)</span>. Using the result about transpositions, we then prove that a transitive generalized toggle group that contains a short cycle must be primitive. Employing a result of Jones (Bull Aust Math Soc 89(1):159-165, 2014), which relies on the classification of the finite simple groups, we conclude that any transitive generalized toggle group of degree <i>n</i> that contains a cycle with at least 3 fixed points must also contain <span>(A_n)</span>. Finally, we look at imprimitive generalized toggle groups containing a long cycle and show that they decompose into a direct product of primitive generalized toggle groups each containing a long cycle.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"19 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141567650","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}
{"title":"The sequentially Cohen–Macaulay property of edge ideals of edge-weighted graphs","authors":"Ly Thi Kieu Diem, Nguyên Công Minh, Thanh Vu","doi":"10.1007/s10801-024-01344-9","DOIUrl":"https://doi.org/10.1007/s10801-024-01344-9","url":null,"abstract":"<p>Let <span>(I(G,textbf{w}))</span> be the edge ideal of an edge-weighted graph <span>((G,textbf{w}))</span>. We prove that <span>(I(G,textbf{w}))</span> is sequentially Cohen–Macaulay for all weight functions <span>(textbf{w})</span> if and only if <i>G</i> is a Woodroofe graph.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"10 2 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141513884","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}
{"title":"Generalization of the $$epsilon $$ -BBS and the Schensted insertion algorithm","authors":"Katsuki Kobayashi, Satoshi Tsujimoto","doi":"10.1007/s10801-024-01338-7","DOIUrl":"https://doi.org/10.1007/s10801-024-01338-7","url":null,"abstract":"<p>The <span>(epsilon )</span>-BBS is the family of solitonic cellular automata obtained via the ultradiscretization of the elementary Toda orbits, which is a parametrized family of integrable systems unifying the Toda equation and the relativistic Toda equation. In this paper, we derive the <span>(epsilon )</span>-BBS with many kinds of balls and give its conserved quantities by the Schensted insertion algorithm which is introduced in combinatorics. To prove this, we extend birational transformations of the continuous elementary Toda orbits to the discrete hungry elementary Toda orbits.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"20 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141529706","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}
{"title":"Cohomology-developed matrices: constructing families of weighing matrices and automorphism actions","authors":"Assaf Goldberger, Giora Dula","doi":"10.1007/s10801-024-01346-7","DOIUrl":"https://doi.org/10.1007/s10801-024-01346-7","url":null,"abstract":"<p>The aim of this work is to construct families of weighing matrices via their automorphism group action. The matrices can be reconstructed from the 0, 1, 2-cohomology groups of the underlying automorphism group. We use this mechanism to (re)construct the matrices out of abstract group datum. As a consequence, some old and new families of weighing matrices are constructed. These include the Paley conference, the projective space, the Grassmannian, and the flag variety weighing matrices. We develop a general theory relying on low-dimensional group cohomology for constructing automorphism group actions and in turn obtain structured matrices that we call <i>cohomology-developed matrices</i>. This ‘cohomology development’ generalizes the cocyclic and group developments. The algebraic structure of modules of cohomology-developed matrices is discussed, and an orthogonality result is deduced. We also use this algebraic structure to define the notion of <i>quasiproducts</i>, which is a generalization of the Kronecker product.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"11 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141508705","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}
{"title":"A local approach to stability groups","authors":"Martin L. Newell, Marco Trombetti","doi":"10.1007/s10801-024-01345-8","DOIUrl":"https://doi.org/10.1007/s10801-024-01345-8","url":null,"abstract":"<p>In this short note we prove a local version of Philip Hall’s theorem on the nilpotency of the stability group of a chain of subgroups by only using elementary commutator calculus (Hall’s theorem is a direct consequence of our result). This provides a new way of dealing with stability groups.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"115 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141508702","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}
{"title":"The number of spanning trees in $$K_n$$ -complement of a bipartite graph","authors":"Helin Gong, Yu Gong, Jun Ge","doi":"10.1007/s10801-024-01341-y","DOIUrl":"https://doi.org/10.1007/s10801-024-01341-y","url":null,"abstract":"<p>For a subgraph <i>G</i> of a complete graph <span>(K_n)</span>, the <span>(K_n)</span>-complement of <i>G</i>, denoted by <span>(K_n-G)</span>, is the graph obtained from <span>(K_n-G)</span> by removing all the edges of <i>G</i>. In this paper, we express the number of spanning trees of the <span>(K_n)</span>-complement <span>(K_n-G)</span> of a bipartite graph <i>G</i> in terms of the determinant of the biadjcency matrices of all induced balanced bipartite subgraphs of <i>G</i>, which are nonsingular, and we derive formulas of the number of spanning trees of <span>(K_n-G)</span> for various important classes of bipartite graphs <i>G</i>, some of which generalize some previous results.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"12 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141195355","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}
{"title":"Growth of bilinear maps II: bounds and orders","authors":"Vuong Bui","doi":"10.1007/s10801-024-01336-9","DOIUrl":"https://doi.org/10.1007/s10801-024-01336-9","url":null,"abstract":"<p>A good range of problems on trees can be described by the following general setting: Given a bilinear map <span>(*:mathbb {R}^dtimes mathbb {R}^drightarrow mathbb {R}^d)</span> and a vector <span>(sin mathbb {R}^d)</span>, we need to estimate the largest possible absolute value <i>g</i>(<i>n</i>) of an entry over all vectors obtained from applying <span>(n-1)</span> applications of <span>(*)</span> to <i>n</i> instances of <i>s</i>. When the coefficients of <span>(*)</span> are nonnegative and the entries of <i>s</i> are positive, the value <i>g</i>(<i>n</i>) is known to follow a growth rate <span>(lambda =lim _{nrightarrow infty } root n of {g(n)})</span>. In this article, we prove that for such <span>(*)</span> and <i>s</i> there exist nonnegative numbers <span>(r,r')</span> and positive numbers <span>(a,a')</span> so that for every <i>n</i>, </p><span>$$begin{aligned} a n^{-r}lambda ^nle g(n)le a' n^{r'}lambda ^n. end{aligned}$$</span><p>While proving the upper bound, we actually also provide another approach in proving the limit <span>(lambda )</span> itself. The lower bound is proved by showing a certain form of submultiplicativity for <i>g</i>(<i>n</i>). Corollaries include a lower bound and an upper bound for <span>(lambda )</span>, which are followed by a good estimation of <span>(lambda )</span> when we have the value of <i>g</i>(<i>n</i>) for an <i>n</i> large enough.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"17 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141146499","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}
{"title":"The weak Lefschetz property and mixed multiplicities of monomial ideals","authors":"Thiago Holleben","doi":"10.1007/s10801-024-01337-8","DOIUrl":"https://doi.org/10.1007/s10801-024-01337-8","url":null,"abstract":"<p>Recently, H. Dao and R. Nair gave a combinatorial description of simplicial complexes <span>(Delta )</span> such that the squarefree reduction of the Stanley–Reisner ideal of <span>(Delta )</span> has the WLP in degree 1 and characteristic zero. In this paper, we apply the connections between analytic spread of equigenerated monomial ideals, mixed multiplicities and birational monomial maps to give a sufficient and necessary condition for the squarefree reduction <span>(A(Delta ))</span> to satisfy the WLP in degree <i>i</i> and characteristic zero in terms of mixed multiplicities of monomial ideals that contain combinatorial information of <span>(Delta )</span>, we call them incidence ideals. As a consequence, we give an upper bound to the possible failures of the WLP of <span>(A(Delta ))</span> in degree <i>i</i> in positive characteristics in terms of mixed multiplicities. Moreover, we extend Dao and Nair’s criterion to arbitrary monomial ideals in positive odd characteristics.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"4280 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141146431","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}
Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy
{"title":"Higher Bruhat orders of types B and C","authors":"Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy","doi":"10.1007/s10801-024-01334-x","DOIUrl":"https://doi.org/10.1007/s10801-024-01334-x","url":null,"abstract":"<p>We propose versions of higher Bruhat orders for types <i>B</i> and <i>C</i>. This is based on a theory of higher Bruhat orders of type A and their geometric interpretations (due to Manin–Shekhtman, Voevodskii–Kapranov, and Ziegler), and on our study of the so-called symmetric cubillages of cyclic zonotopes.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"67 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141061763","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}