2000 character limit reached
On the symbolic $F$-splitness of binomial edge ideals (2404.14640v1)
Published 23 Apr 2024 in math.AC and math.CO
Abstract: We study the symbolic $F$-splitness of families of binomial edge ideals. We also study the strong $F$-regularity of the symbolic blowup algebras of families of binomial edge ideals. We make use of Fedder-like criteria and combinatorial properties of the graphs associated to the binomial edge ideals in order to approach the aforementioned scenarios.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
