Given a group G and a subgroup (H le G), a set (mathcal {F}subset G) is called H-intersecting if for any (g,g' in mathcal {F}), there exists (xH in G/H) such that (gxH=g'xH). The intersection density of the action of G on G/H by (left) multiplication is the rational number (rho (G,H)), equal to the maximum ratio (frac{|mathcal {F}|}{|H|}), where (mathcal {F} subset G) runs through all H-intersecting sets of G. The intersection spectrum of the group G is then defined to be the set
It was shown by Bardestani and Mallahi-Karai (J Algebraic Combin, 42(1):111–128, 2015) that if (sigma (G) = {1}), then G is necessarily solvable. The natural question that arises is, therefore, which rational numbers larger than 1 belong to (sigma (G)), whenever G is non-solvable. In this paper, we study the intersection spectrum of the linear group ({text {PSL}}_2(q)). It is shown that (2 in sigma left( {text {PSL}}_2(q)right) ), for any prime power (qequiv 3 pmod 4). Moreover, when (qequiv 1 pmod 4), it is proved that (rho ({text {PSL}}_2(q),H)=1), for any odd index subgroup H (containing ({mathbb {F}}_q)) of the Borel subgroup (isomorphic to ({mathbb {F}}_qrtimes {mathbb {Z}}_{frac{q-1}{2}})) consisting of all upper triangular matrices.
{"title":"On the intersection spectrum of $${text {PSL}}_2(q)$$","authors":"Angelot Behajaina, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra","doi":"10.1007/s10801-024-01356-5","DOIUrl":"https://doi.org/10.1007/s10801-024-01356-5","url":null,"abstract":"<p>Given a group <i>G</i> and a subgroup <span>(H le G)</span>, a set <span>(mathcal {F}subset G)</span> is called <i>H</i><i>-intersecting</i> if for any <span>(g,g' in mathcal {F})</span>, there exists <span>(xH in G/H)</span> such that <span>(gxH=g'xH)</span>. The <i>intersection density</i> of the action of <i>G</i> on <i>G</i>/<i>H</i> by (left) multiplication is the rational number <span>(rho (G,H))</span>, equal to the maximum ratio <span>(frac{|mathcal {F}|}{|H|})</span>, where <span>(mathcal {F} subset G)</span> runs through all <i>H</i>-intersecting sets of <i>G</i>. The <i>intersection spectrum</i> of the group <i>G</i> is then defined to be the set </p><span>$$begin{aligned} sigma (G) := left{ rho (G,H) : Hle G right} . end{aligned}$$</span><p>It was shown by Bardestani and Mallahi-Karai (J Algebraic Combin, 42(1):111–128, 2015) that if <span>(sigma (G) = {1})</span>, then <i>G</i> is necessarily solvable. The natural question that arises is, therefore, which rational numbers larger than 1 belong to <span>(sigma (G))</span>, whenever <i>G</i> is non-solvable. In this paper, we study the intersection spectrum of the linear group <span>({text {PSL}}_2(q))</span>. It is shown that <span>(2 in sigma left( {text {PSL}}_2(q)right) )</span>, for any prime power <span>(qequiv 3 pmod 4)</span>. Moreover, when <span>(qequiv 1 pmod 4)</span>, it is proved that <span>(rho ({text {PSL}}_2(q),H)=1)</span>, for any odd index subgroup <i>H</i> (containing <span>({mathbb {F}}_q)</span>) of the Borel subgroup (isomorphic to <span>({mathbb {F}}_qrtimes {mathbb {Z}}_{frac{q-1}{2}})</span>) consisting of all upper triangular matrices.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142264049","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-09-09DOI: 10.1007/s10801-024-01358-3
Wei Jin, Li Tan
Praeger and the first author in Jin and Praeger (J Combin Theory Ser A 178:105349, 2021) asked the following problem: classify s-geodesic-transitive graphs of girth (2s-1) or (2s-2), where (s=4,5,6,7,8). In this paper, we study the (s=4) case, that is, study the family of finite (G, 4)-geodesic-transitive graphs of girth 6 or 7 for some group G of automorphisms. A reduction result on this family of graphs is first given. Let N be a normal subgroup of G which has at least 3 orbits on the vertex set. We show that such a graph (Gamma ) is a cover of its quotient (Gamma _N) modulo the N-orbits and either (Gamma _N) is (G/N, s)-geodesic-transitive where (s=min {4,textrm{diam}(Gamma _N)}ge 3), or (Gamma _N) is a (G/N, 2)-arc-transitive strongly regular graph. Next, using the classification of 2-arc-transitive strongly regular graphs, we determine all the (G, 4)-geodesic-transitive covers (Gamma ) when (Gamma _N) is strongly regular.
Praeger 和第一作者在 Jin and Praeger (J Combin Theory Ser A 178:105349, 2021) 中提出了以下问题:分类周长为 (2s-1) 或 (2s-2) 的 s 节点变换图,其中 (s=4,5,6,7,8).在本文中,我们研究的是(s=4)的情况,也就是研究对于某个自动形群 G 而言周长为 6 或 7 的有限(G,4)-大地遍历图形族。首先给出这个图形族的还原结果。让 N 是顶点集上至少有 3 个轨道的 G 的正则子群。我们证明这样的图(Gamma )是它的商(Gamma _N)的覆盖,并且(Gamma _N)是(G/N、s=min {4,textrm{diam}(Gamma _N)}ge 3), 或者 (Gamma _N) 是一个(G/N, 2)弧遍历强规则图。接下来,利用2-弧-传递强正则图的分类,我们确定了当(Gamma _N)是强正则图时所有的(G,4)-大地-传递盖(Gamma )。
{"title":"Finite 4-geodesic-transitive graphs with bounded girth","authors":"Wei Jin, Li Tan","doi":"10.1007/s10801-024-01358-3","DOIUrl":"https://doi.org/10.1007/s10801-024-01358-3","url":null,"abstract":"<p>Praeger and the first author in Jin and Praeger (J Combin Theory Ser A 178:105349, 2021) asked the following problem: classify <i>s</i>-geodesic-transitive graphs of girth <span>(2s-1)</span> or <span>(2s-2)</span>, where <span>(s=4,5,6,7,8)</span>. In this paper, we study the <span>(s=4)</span> case, that is, study the family of finite (<i>G</i>, 4)-geodesic-transitive graphs of girth 6 or 7 for some group <i>G</i> of automorphisms. A reduction result on this family of graphs is first given. Let <i>N</i> be a normal subgroup of <i>G</i> which has at least 3 orbits on the vertex set. We show that such a graph <span>(Gamma )</span> is a cover of its quotient <span>(Gamma _N)</span> modulo the <i>N</i>-orbits and either <span>(Gamma _N)</span> is (<i>G</i>/<i>N</i>, <i>s</i>)-geodesic-transitive where <span>(s=min {4,textrm{diam}(Gamma _N)}ge 3)</span>, or <span>(Gamma _N)</span> is a (<i>G</i>/<i>N</i>, 2)-arc-transitive strongly regular graph. Next, using the classification of 2-arc-transitive strongly regular graphs, we determine all the (<i>G</i>, 4)-geodesic-transitive covers <span>(Gamma )</span> when <span>(Gamma _N)</span> is strongly regular.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203133","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-09-02DOI: 10.1007/s10801-024-01354-7
Giancarlo Rinaldo, Francesco Romeo, Rajib Sarkar
We classify path polyominoes which are level and pseudo-Gorenstein. Moreover, we compute all level and pseudo-Gorenstein simple thin polyominoes with rank less than or equal to 10. We also compute the regularity of the pseudo-Gorenstein simple thin polyominoes in relation to their rank.
{"title":"Level and pseudo-Gorenstein path polyominoes","authors":"Giancarlo Rinaldo, Francesco Romeo, Rajib Sarkar","doi":"10.1007/s10801-024-01354-7","DOIUrl":"https://doi.org/10.1007/s10801-024-01354-7","url":null,"abstract":"<p>We classify path polyominoes which are level and pseudo-Gorenstein. Moreover, we compute all level and pseudo-Gorenstein simple thin polyominoes with rank less than or equal to 10. We also compute the regularity of the pseudo-Gorenstein simple thin polyominoes in relation to their rank.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203136","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-08-22DOI: 10.1007/s10801-024-01351-w
Li Li
Bipartite determinantal ideals are introduced in Illian and Li (Gröbner basis for the double determinantal ideals, http://arxiv.org/abs/2305.01724) as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory, and combinatorics. We introduce a combinatorial model called concurrent vertex maps to describe the Stanley–Reisner complex of the initial ideal of any bipartite determinantal ideal, and study properties and applications of this model including vertex decomposability, shelling orders, formulas of the Hilbert series, and h-polynomials.
二方行列式理想在 Illian 和 Li (Gröbner basis for the double determinantal ideals, http://arxiv.org/abs/2305.01724) 中被引入,作为在交换代数、代数几何、表示论和组合学中深入研究的经典行列式理想的广义概括。我们引入了一种称为并发顶点映射的组合模型来描述任何双行列式理想的初始理想的 Stanley-Reisner 复数,并研究了这一模型的性质和应用,包括顶点可分解性、脱壳阶、希尔伯特数列公式和 h 多项式。
{"title":"Bipartite determinantal ideals and concurrent vertex maps","authors":"Li Li","doi":"10.1007/s10801-024-01351-w","DOIUrl":"https://doi.org/10.1007/s10801-024-01351-w","url":null,"abstract":"<p>Bipartite determinantal ideals are introduced in Illian and Li (Gröbner basis for the double determinantal ideals, http://arxiv.org/abs/2305.01724) as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory, and combinatorics. We introduce a combinatorial model called concurrent vertex maps to describe the Stanley–Reisner complex of the initial ideal of any bipartite determinantal ideal, and study properties and applications of this model including vertex decomposability, shelling orders, formulas of the Hilbert series, and <i>h</i>-polynomials.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203135","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-08-22DOI: 10.1007/s10801-024-01352-9
Gregory Lupton, Oleg Musin, Nicholas A. Scoville, P. Christopher Staecker, Jonathan Treviño-Marroquín
We define a second (higher) homotopy group for digital images. Namely, we construct a functor from digital images to abelian groups, which closely resembles the ordinary second homotopy group from algebraic topology. We illustrate that our approach can be effective by computing this (digital) second homotopy group for a digital 2-sphere.
{"title":"A second homotopy group for digital images","authors":"Gregory Lupton, Oleg Musin, Nicholas A. Scoville, P. Christopher Staecker, Jonathan Treviño-Marroquín","doi":"10.1007/s10801-024-01352-9","DOIUrl":"https://doi.org/10.1007/s10801-024-01352-9","url":null,"abstract":"<p>We define a second (higher) homotopy group for digital images. Namely, we construct a functor from digital images to abelian groups, which closely resembles the ordinary second homotopy group from algebraic topology. We illustrate that our approach can be effective by computing this (digital) second homotopy group for a digital 2-sphere.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142203134","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-08-16DOI: 10.1007/s10801-024-01353-8
Xiaofeng Gu, Muhuo Liu
<p>Let <span>(beta >0)</span>. Motivated by the notion of jumbled graphs introduced by Thomason, the expander mixing lemma and Haemers’s vertex separation inequality, we say that a graph <i>G</i> with <i>n</i> vertices is a weakly <span>((n,beta ))</span>-graph if <span>(frac{|X| |Y|}{(n-|X|)(n-|Y|)} le beta ^2)</span> holds for every pair of disjoint proper subsets <i>X</i>, <i>Y</i> of <i>V</i>(<i>G</i>) with no edge between <i>X</i> and <i>Y</i>. It is an <span>((n,beta ))</span>-graph if in addition <i>X</i> and <i>Y</i> are not necessarily disjoint. Using graph eigenvalues, we show that every graph can be an <span>((n,beta ))</span>-graph and/or a weakly <span>((n,beta ))</span>-graph for some specific value <span>(beta )</span>. For instances, the expander mixing lemma implies that a <i>d</i>-regular graph on <i>n</i> vertices with the second largest absolute eigenvalue at most <span>(lambda )</span> is an <span>((n,lambda /d))</span>-graph, and Haemers’s vertex separation inequality implies that every graph is a weakly <span>((n,beta ))</span>-graph with <span>(beta ge frac{mu _n - mu _2}{mu _n + mu _2})</span>, where <span>(mu _i)</span> denotes the <i>i</i>-th smallest Laplacian eigenvalue. This motivates us to study <span>((n,beta ))</span>-graph and weakly <span>((n,beta ))</span>-graph in general. Our main results include the following. (i) For any weakly <span>((n,beta ))</span>-graph <i>G</i>, the matching number <span>(alpha '(G)ge min left{ frac{1-beta }{1+beta },, frac{1}{2}right} cdot (n-1))</span>. If in addition <i>G</i> is a (<i>U</i>, <i>W</i>)-bipartite graph with <span>(|W|ge t|U|)</span> where <span>(tge 1)</span>, then <span>(alpha '(G)ge min {t(1-2beta ^2),1}cdot |U|)</span>. (ii) For any <span>((n,beta ))</span>-graph <i>G</i>, <span>(alpha '(G)ge min left{ frac{2-beta }{2(1+beta )},, frac{1}{2}right} cdot (n-1).)</span> If in addition <i>G</i> is a (<i>U</i>, <i>W</i>)-bipartite graph with <span>(|W|ge |U|)</span> and no isolated vertices, then <span>(alpha '(G)ge min {1/beta ^{2},1}cdot |U|)</span>. (iii) If <i>G</i> is a weakly <span>((n,beta ))</span>-graph for <span>(0<beta le 1/3)</span> or an <span>((n,beta ))</span>-graph for <span>(0<beta le 1/2)</span>, then <i>G</i> has a fractional perfect matching. In addition, <i>G</i> has a perfect matching when <i>n</i> is even and <i>G</i> is factor-critical when <i>n</i> is odd. (iv) For any connected <span>((n,beta ))</span>-graph <i>G</i>, the toughness <span>(t(G)ge frac{1-beta }{beta })</span>. For any connected weakly <span>((n,beta ))</span>-graph <i>G</i>, <span>(t(G)> frac{5(1-beta )}{11beta })</span> and if <i>n</i> is large enough, then <span>(t(G)>left( frac{1}{2}-varepsilon right) frac{1-beta }{beta })</span> for any <span>(varepsilon >0)</span>. The results imply many old and new results in spectral graph theory, including several new lower bounds on matching number, fractional matching number and toughness from eigenvalues. In particula
让 beta >0).受托马森(Thomason)引入的杂乱图概念、扩展混合lemma和海默斯(Haemers)顶点分离不等式的启发,我们说,如果 (frac{|X||Y|}{(n-|X、如果对于 V(G) 的每一对互不相交的适当子集 X、Y,且 X 和 Y 之间没有边,那么 (frac{|X||Y|}{(n-|X|)(n-|Y|)} le beta ^2) 成立。如果 X 和 Y 不一定相交,那么它就是一个 ((n,beta )) -图。利用图的特征值,我们证明了每个图都可以是一个((n,beta))图和/或一个弱((n,beta))图,对于某些特定的值((beta))。举例来说,扩展混合lemma意味着n个顶点上的d规则图,其第二大绝对特征值最多为(),是一个((n,lambda /d))图、哈默斯顶点分离不等式意味着每个图都是一个弱的((n,beta))图,其中 (beta ge frac{mu _n - mu _2}{mu _n + mu _2}) 表示第 i 个最小的拉普拉奇特征值。这促使我们研究一般的((n,beta))图和弱((n,beta))图。我们的主要结果包括以下几点。(i) 对于任何弱((n,beta))-图 G,匹配数 (alpha '(G)ge min left{ frac{1-beta }{1+beta },,frac{1}{2}right}。cdot (n-1)).如果 G 是一个(U, W)二边图,其中有 (|W|ge t|U|) where (tge 1), 那么 (alpha '(G)ge min {t(1-2beta ^2),1}cdot |U|/)。(ii) 对于任何图 G,(alpha '(G)ge min left{ frac{2-beta }{2(1+beta )},, frac{1}{2}right}.cdot (n-1).)如果 G 是一个(U, W)双瓣图,具有 (|W|ge|U|)并且没有孤立顶点,那么 (alpha '(G)ge min {1/beta ^{2},1}cdot |U||)。(iii) 如果 G 是一个弱的((n,beta))图,对于(0<betale 1/3) 或者对于(0<betale 1/2) 是一个((n,beta))图,那么 G 有一个分数完美匹配。此外,当 n 为偶数时,G 有一个完美匹配,当 n 为奇数时,G 是因子临界的。 (iv) 对于任何连通的((n,beta))-图 G,韧性(t(G)ge frac{1-beta }{beta } )。对于任何连通的弱图((n,beta))-图G,韧度(t(G)> frac{5(1-beta )}{11beta }) 并且如果n足够大,那么(t(G)>;leave( frac{1}{2}-varepsilon right) frac{1-beta }{beta }) for any (varepsilon >0).这些结果意味着谱图理论中的许多新旧结果,包括匹配数、分数匹配数和来自特征值的韧性的几个新下界。特别是,我们通过归一化拉普拉奇特征值得到了韧性的新下界,它将布鲁瓦(Brouwer)最初从规则图猜想的定理扩展到了一般图。
{"title":"A unified combinatorial view beyond some spectral properties","authors":"Xiaofeng Gu, Muhuo Liu","doi":"10.1007/s10801-024-01353-8","DOIUrl":"https://doi.org/10.1007/s10801-024-01353-8","url":null,"abstract":"<p>Let <span>(beta >0)</span>. Motivated by the notion of jumbled graphs introduced by Thomason, the expander mixing lemma and Haemers’s vertex separation inequality, we say that a graph <i>G</i> with <i>n</i> vertices is a weakly <span>((n,beta ))</span>-graph if <span>(frac{|X| |Y|}{(n-|X|)(n-|Y|)} le beta ^2)</span> holds for every pair of disjoint proper subsets <i>X</i>, <i>Y</i> of <i>V</i>(<i>G</i>) with no edge between <i>X</i> and <i>Y</i>. It is an <span>((n,beta ))</span>-graph if in addition <i>X</i> and <i>Y</i> are not necessarily disjoint. Using graph eigenvalues, we show that every graph can be an <span>((n,beta ))</span>-graph and/or a weakly <span>((n,beta ))</span>-graph for some specific value <span>(beta )</span>. For instances, the expander mixing lemma implies that a <i>d</i>-regular graph on <i>n</i> vertices with the second largest absolute eigenvalue at most <span>(lambda )</span> is an <span>((n,lambda /d))</span>-graph, and Haemers’s vertex separation inequality implies that every graph is a weakly <span>((n,beta ))</span>-graph with <span>(beta ge frac{mu _n - mu _2}{mu _n + mu _2})</span>, where <span>(mu _i)</span> denotes the <i>i</i>-th smallest Laplacian eigenvalue. This motivates us to study <span>((n,beta ))</span>-graph and weakly <span>((n,beta ))</span>-graph in general. Our main results include the following. (i) For any weakly <span>((n,beta ))</span>-graph <i>G</i>, the matching number <span>(alpha '(G)ge min left{ frac{1-beta }{1+beta },, frac{1}{2}right} cdot (n-1))</span>. If in addition <i>G</i> is a (<i>U</i>, <i>W</i>)-bipartite graph with <span>(|W|ge t|U|)</span> where <span>(tge 1)</span>, then <span>(alpha '(G)ge min {t(1-2beta ^2),1}cdot |U|)</span>. (ii) For any <span>((n,beta ))</span>-graph <i>G</i>, <span>(alpha '(G)ge min left{ frac{2-beta }{2(1+beta )},, frac{1}{2}right} cdot (n-1).)</span> If in addition <i>G</i> is a (<i>U</i>, <i>W</i>)-bipartite graph with <span>(|W|ge |U|)</span> and no isolated vertices, then <span>(alpha '(G)ge min {1/beta ^{2},1}cdot |U|)</span>. (iii) If <i>G</i> is a weakly <span>((n,beta ))</span>-graph for <span>(0<beta le 1/3)</span> or an <span>((n,beta ))</span>-graph for <span>(0<beta le 1/2)</span>, then <i>G</i> has a fractional perfect matching. In addition, <i>G</i> has a perfect matching when <i>n</i> is even and <i>G</i> is factor-critical when <i>n</i> is odd. (iv) For any connected <span>((n,beta ))</span>-graph <i>G</i>, the toughness <span>(t(G)ge frac{1-beta }{beta })</span>. For any connected weakly <span>((n,beta ))</span>-graph <i>G</i>, <span>(t(G)> frac{5(1-beta )}{11beta })</span> and if <i>n</i> is large enough, then <span>(t(G)>left( frac{1}{2}-varepsilon right) frac{1-beta }{beta })</span> for any <span>(varepsilon >0)</span>. The results imply many old and new results in spectral graph theory, including several new lower bounds on matching number, fractional matching number and toughness from eigenvalues. In particula","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226115","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-07-09DOI: 10.1007/s10801-024-01349-4
Dimitra Kosta, Apostolos Thoma, Marius Vladoiu
To every simple toric ideal (I_T) one can associate the strongly robust simplicial complex (Delta _T), which determines the strongly robust property for all ideals that have (I_T) as their bouquet ideal. We show that for the simple toric ideals of monomial curves in (mathbb {A}^{s}), the strongly robust simplicial complex (Delta _T) is either ({emptyset }) or contains exactly one 0-dimensional face. In the case of monomial curves in (mathbb {A}^{3}), the strongly robust simplicial complex (Delta _T) contains one 0-dimensional face if and only if the toric ideal (I_T) is a complete intersection ideal with exactly two Betti degrees. Finally, we provide a construction to produce infinitely many strongly robust ideals with bouquet ideal the ideal of a monomial curve and show that they are all produced this way.
{"title":"The strongly robust simplicial complex of monomial curves","authors":"Dimitra Kosta, Apostolos Thoma, Marius Vladoiu","doi":"10.1007/s10801-024-01349-4","DOIUrl":"https://doi.org/10.1007/s10801-024-01349-4","url":null,"abstract":"<p>To every simple toric ideal <span>(I_T)</span> one can associate the strongly robust simplicial complex <span>(Delta _T)</span>, which determines the strongly robust property for all ideals that have <span>(I_T)</span> as their bouquet ideal. We show that for the simple toric ideals of monomial curves in <span>(mathbb {A}^{s})</span>, the strongly robust simplicial complex <span>(Delta _T)</span> is either <span>({emptyset })</span> or contains exactly one 0-dimensional face. In the case of monomial curves in <span>(mathbb {A}^{3})</span>, the strongly robust simplicial complex <span>(Delta _T)</span> contains one 0-dimensional face if and only if the toric ideal <span>(I_T)</span> is a complete intersection ideal with exactly two Betti degrees. Finally, we provide a construction to produce infinitely many strongly robust ideals with bouquet ideal the ideal of a monomial curve and show that they are all produced this way.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141567649","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-07-08DOI: 10.1007/s10801-024-01339-6
Drew Damien Duffield
Symmetric special multiserial algebras are algebras that correspond to decorated hypergraphs with orientation, called Brauer configurations. In this paper, we use the combinatorics of Brauer configurations to understand the module category of symmetric special multiserial algebras via their Auslander–Reiten quiver. In particular, we provide methods for determining the existence and ranks of tubes in the stable Auslander–Reiten quiver of symmetric special multiserial algebras using only the information from the underlying Brauer configuration. Firstly, we define a combinatorial walk around the Brauer configuration, called a Green ‘hyperwalk’, which generalises the existing notion of a Green walk around a Brauer graph. Periodic Green hyperwalks are then shown to correspond to periodic projective resolutions of certain classes of string modules over the corresponding symmetric special multiserial algebra. Periodic Green hyperwalks thus determine certain classes of tubes in the stable Auslander–Reiten quiver, with the ranks of the tubes determined by the periods of the walks. Finally, we provide a description of additional rank two tubes in symmetric special multiserial algebras that do not arise from Green hyperwalks, but which nevertheless contain string modules at the mouth. This includes an explicit description of the space of extensions between string modules at the mouth of tubes of rank two.
{"title":"Tubes containing string modules in symmetric special multiserial algebras","authors":"Drew Damien Duffield","doi":"10.1007/s10801-024-01339-6","DOIUrl":"https://doi.org/10.1007/s10801-024-01339-6","url":null,"abstract":"<p>Symmetric special multiserial algebras are algebras that correspond to decorated hypergraphs with orientation, called Brauer configurations. In this paper, we use the combinatorics of Brauer configurations to understand the module category of symmetric special multiserial algebras via their Auslander–Reiten quiver. In particular, we provide methods for determining the existence and ranks of tubes in the stable Auslander–Reiten quiver of symmetric special multiserial algebras using only the information from the underlying Brauer configuration. Firstly, we define a combinatorial walk around the Brauer configuration, called a Green ‘hyperwalk’, which generalises the existing notion of a Green walk around a Brauer graph. Periodic Green hyperwalks are then shown to correspond to periodic projective resolutions of certain classes of string modules over the corresponding symmetric special multiserial algebra. Periodic Green hyperwalks thus determine certain classes of tubes in the stable Auslander–Reiten quiver, with the ranks of the tubes determined by the periods of the walks. Finally, we provide a description of additional rank two tubes in symmetric special multiserial algebras that do not arise from Green hyperwalks, but which nevertheless contain string modules at the mouth. This includes an explicit description of the space of extensions between string modules at the mouth of tubes of rank two.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141567648","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-07-06DOI: 10.1007/s10801-024-01350-x
Anca Măcinic, Piotr Pokora
In the recent paper A. Dimca proves that when one adds to or deletes a line from a free curve, the resulting curve is either free or plus-one generated. We prove the converse statements, we give an additional insight into the original deletion result, and we derive a characterization of free curves in terms of behavior to addition/deletion of lines. Incidentally we generalize a result on conic-line arrangements by H. Schenck and Ş. Tohăneanu that describes when the addition or the deletion of a projective line from a free curve results in a free curve. We catalogue the possible splitting types of the bundle of logarithmic vector fields associated to a plus-one generated curve.
迪姆卡(A. Dimca)在最近的论文中证明,当在自由曲线上添加或删除一条直线时,得到的曲线要么是自由的,要么是加一生成的。我们证明了相反的陈述,对最初的删除结果提出了更多的见解,并从加线/删除线的行为方面推导出自由曲线的特征。顺便提一下,我们概括了 H. Schenck 和 Ş.Tohăneanu 提出的关于圆锥曲线排列的结果,该结果描述了在自由曲线上添加或删除一条投影线时,会产生一条自由曲线。我们列出了与加一生成曲线相关的对数向量场束的可能分裂类型。
{"title":"Addition–deletion results for plus-one generated curves","authors":"Anca Măcinic, Piotr Pokora","doi":"10.1007/s10801-024-01350-x","DOIUrl":"https://doi.org/10.1007/s10801-024-01350-x","url":null,"abstract":"<p>In the recent paper A. Dimca proves that when one adds to or deletes a line from a free curve, the resulting curve is either free or plus-one generated. We prove the converse statements, we give an additional insight into the original deletion result, and we derive a characterization of free curves in terms of behavior to addition/deletion of lines. Incidentally we generalize a result on conic-line arrangements by H. Schenck and Ş. Tohăneanu that describes when the addition or the deletion of a projective line from a free curve results in a free curve. We catalogue the possible splitting types of the bundle of logarithmic vector fields associated to a plus-one generated curve.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141567477","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-07-05DOI: 10.1007/s10801-024-01342-x
M. A. Moreno-Frías, J. C. Rosales
Denote by ({mathrm m}(S)) the multiplicity of a numerical semigroup S. A covariety is a nonempty family (mathscr {C}) of numerical semigroups that fulfils the following conditions: there is the minimum of (mathscr {C},) the intersection of two elements of (mathscr {C}) is again an element of (mathscr {C}) and (Sbackslash {{mathrm m}(S)}in mathscr {C}) for all (Sin mathscr {C}) such that (Sne min (mathscr {C}).) In this work we describe an algorithmic procedure to compute all the elements of (mathscr {C}.) We prove that there exists the smallest element of (mathscr {C}) containing a set of positive integers. We show that (mathscr {A}(F)={Smid S hbox { is a numerical semigroup with Frobenius number }F}) is a covariety, and we particularize the previous results in this covariety. Finally, we will see that there is the smallest covariety containing a finite set of numerical semigroups.
用 ({mathrm m}(S))表示数字半群 S 的多重性。共变是满足以下条件的数字半群的非空族 ((mathscr {C}) numerical semigroups):有最小的 ( ( (mathscr {C}、(Sbackslash {{mathrm}(S)}in mathscr {C}) for all (Sin mathscr {C}) such that (Sne min (mathscr {C}).)在这项工作中,我们描述了一种计算 (mathscr {C}.) 的所有元素的算法过程,我们证明了存在包含一组正整数的 (mathscr {C}) 的最小元素。我们证明 (mathscr {A}(F)={Smid S hbox { is a numerical semigroup with Frobenius number }F}) 是一个协方差,并且我们在这个协方差中具体化了前面的结果。最后,我们将看到存在包含有限数字半群集的最小协方差。
{"title":"The covariety of numerical semigroups with fixed Frobenius number","authors":"M. A. Moreno-Frías, J. C. Rosales","doi":"10.1007/s10801-024-01342-x","DOIUrl":"https://doi.org/10.1007/s10801-024-01342-x","url":null,"abstract":"<p>Denote by <span>({mathrm m}(S))</span> the multiplicity of a numerical semigroup <i>S</i>. A <i>covariety</i> is a nonempty family <span>(mathscr {C})</span> of numerical semigroups that fulfils the following conditions: there is the minimum of <span>(mathscr {C},)</span> the intersection of two elements of <span>(mathscr {C})</span> is again an element of <span>(mathscr {C})</span> and <span>(Sbackslash {{mathrm m}(S)}in mathscr {C})</span> for all <span>(Sin mathscr {C})</span> such that <span>(Sne min (mathscr {C}).)</span> In this work we describe an algorithmic procedure to compute all the elements of <span>(mathscr {C}.)</span> We prove that there exists the smallest element of <span>(mathscr {C})</span> containing a set of positive integers. We show that <span>(mathscr {A}(F)={Smid S hbox { is a numerical semigroup with Frobenius number }F})</span> is a covariety, and we particularize the previous results in this covariety. Finally, we will see that there is the smallest covariety containing a finite set of numerical semigroups.\u0000</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141567476","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}