English
Related papers

Related papers: W-graph ideals and biideals

200 papers

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

Group Theory · Mathematics 2020-07-23 Sandeep Dalal , Jitender Kumar

A graph $X$ is defined inductively to be $(a_0,\dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,\dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be…

Group Theory · Mathematics 2020-09-21 Marston Conder , Alexander Lubotzky , Jeroen Schillewaert , François Thilmany

The principal objects studied in this note are Coxeter groups $W$ that are neither finite nor affine. A well known result of de la Harpe asserts that such groups have exponential growth. We consider quotients of $W$ by its parabolic…

Group Theory · Mathematics 2007-05-23 Sankaran Viswanath

A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…

Data Structures and Algorithms · Computer Science 2016-07-25 Mikkel Abrahamsen , Stephen Alstrup , Jacob Holm , Mathias Bæk Tejs Knudsen , Morten Stöckel

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…

Logic in Computer Science · Computer Science 2015-05-08 Nans Lefebvre

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

Group Theory · Mathematics 2015-12-08 R. Rajkumar , P. Devi

Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we give a complete characterization of the graphs $G$ for which $\reg(R/I(G)) = 3$.

Commutative Algebra · Mathematics 2026-03-25 Akane Kanno

Whitney's 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. We present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic…

Combinatorics · Mathematics 2019-10-11 Iain Moffatt , Jaeseong Oh

This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…

Commutative Algebra · Mathematics 2024-01-15 Anuvinda J , Ranjana Mehta , Kamalesh Saha

Let $I_{G} \subset K[x_{1},...,x_{m}]$ be the toric ideal associated to a finite graph $G$. In this paper we study the binomial arithmetical rank and the $G$-homogeneous arithmetical rank of $I_G$ in 2 cases: $G$ is bipartite, $I_G$ is…

Commutative Algebra · Mathematics 2009-12-16 Anargyros Katsabekis

We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a…

Rings and Algebras · Mathematics 2021-07-22 Daniel Gonçalves , Danilo Royer

Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $\mathcal{D}$ contains a perfect matching consisting of leaves, we provide…

Commutative Algebra · Mathematics 2018-05-14 Huy Tài Hà , Kuei-Nuan Lin , Susan Morey , Enrique Reyes , Rafael H. Villarreal

Let $R$ be a commutative ring with unity. The prime ideal sum graph of the ring $R$ is a simple undirected graph whose vertex set is the set of nonzero proper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if…

Combinatorics · Mathematics 2023-08-09 Praveen Mathil , Jitender Kumar

In the present note we study Waldschmidt constants of Stanley-Reisner ideals of a hypergraph and a graph with vertices forming a bipyramid over a planar n-gon. The case of the hypergraph has been studied by Bocci and Franci. We reprove…

Algebraic Geometry · Mathematics 2017-04-21 Tomasz Szemberg , Justyna Szpond

Given a conditional expectation $P$ from a C*-algebra $B$ onto a C*-subalgebra $A$, we observe that induction of ideals via $P$, together with a map which we call co-induction, forms a Galois connection between the lattices of ideals of $A$…

Operator Algebras · Mathematics 2025-11-04 Kevin Aguyar Brix , Chris Bruce , Kang Li , Eduardo Scarparo

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

Commutative Algebra · Mathematics 2022-08-09 Matthew Mastroeni , Jason McCullough , Andrew Osborne , Joshua Rice , Cole Willis

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

Commutative Algebra · Mathematics 2024-02-09 Luis A. Dupont , Humberto Muñoz-George , Rafael H. Villarreal

We classify all quotients $W/W_J$ up to isomorphism in Bruhat order, with $(W,S)$ a Coxeter system and $W_J$ a parabolic subgroup of $W$. In particular, the non-trivial isomorphisms fall into a small number of cases which are highly…

Representation Theory · Mathematics 2023-03-14 Joseph Newton

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

Commutative Algebra · Mathematics 2011-10-13 Hailong Dao , Craig Huneke , Jay Schweig

We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…

Geometric Topology · Mathematics 2017-09-05 Deanna Needell , Sam Nelson