English
Related papers

Related papers: Universally Koszul algebras defined by graphs

200 papers

We show that the Koszul homology algebra of a quotient by the edge ideal of a forest is generated by the lowest linear strand. This provides a large class of Koszul algebras whose Koszul homology algebras satisfy this property. We obtain…

Commutative Algebra · Mathematics 2019-09-16 Rachel N. Diethorn

Given a family $\mathcal{H}$ of graphs, a graph $G$ is called $\mathcal{H}$-universal if $G$ contains every graph of $\mathcal{H}$ as a subgraph. Following the extensive research on universal graphs of small size for bounded-degree graphs,…

Combinatorics · Mathematics 2023-09-12 Peter Allen , Julia Böttcher , Anita Liebenau

We give a complete characterisation of the cubic graphs with no eigenvalues in the open interval $(-1,1)$. There are two infinite families, one due to Guo and Mohar [Linear Algebra Appl. 449:68--75] the other due to Koll\'ar and Sarnak…

Combinatorics · Mathematics 2024-09-05 Krystal Guo , Gordon F. Royle

This is a survey paper on commutative Koszul algebras and Castelnuovo-Mumford regularity. We describe several techniques to establish the Koszulness of algebras. We discuss variants of the Koszul property such as strongly Koszul, absolutely…

Commutative Algebra · Mathematics 2012-11-20 Aldo Conca , Emanuela De Negri , Maria Evelina Rossi

In this paper we study finite generation of the Ext algebra of a Brauer graph algebra by determining the degrees of the generators. As a consequence we characterize the Brauer graph algebras that are Koszul and those that are K_2.

Representation Theory · Mathematics 2015-08-03 Edward L Green , Sibylle Schroll , Nicole Snashall , Rachel Taillefer

Restuccia and Rinaldo proved that a standard graded $K$-algebra $K[x_1, ... x_n]/I$ is strongly Koszul if the reduced Gr\"obner basis of $I$ with respect to any reverse lexicographic order is quadratic. In this paper, we give a sufficient…

Commutative Algebra · Mathematics 2018-08-22 Kazunori Matsuda , Hidefumi Ohsugi

We generalise Koszul and D-Koszul algebras by introducing a class of graded algebras called (D,A)-stacked algebras. We give a characterisation of (D,A)-stacked algebras and show that their Ext algebra is finitely generated as an algebra in…

Representation Theory · Mathematics 2015-10-29 Joanne Leader , Nicole Snashall

A conjecture of Chung and Graham states that every $K_4$-free graph on $n$ vertices contains a vertex set of size $\lfloor n/2 \rfloor$ that spans at most $n^2/18$ edges. We make the first step toward this conjecture by showing that it…

Combinatorics · Mathematics 2020-07-30 Xizhi Liu , Jie Ma

A fork is a graph obtained from $K_{1,3}$ (usually called claw) by subdividing an edge once. A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and…

Combinatorics · Mathematics 2025-04-23 Baogang Xu , Miaoxia Zhuang

The rate of a standard graded $K$-algebra $A$ is a measure of the growth of the shifts in a minimal free resolution of $K$ as an $A$-module. In particular $A$ has rate one if and only if it is Koszul. It is known that a generic Artinian…

Commutative Algebra · Mathematics 2026-01-14 Mats Boij , Emanuela De Negri , Alessandro De Stefani , Maria Evelina Rossi

A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$…

Combinatorics · Mathematics 2017-03-13 Pavol Hell , César Hernández-Cruz , Cláudia Linhares Sales

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with a subset of the integers ranging from 0 to m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the…

Combinatorics · Mathematics 2025-02-03 Edinah K. Gnang

Let $A = \bigoplus_{i \geqslant 0} A_i$ be a graded locally finite $k$-algebra such that $A_0$ is an arbitrary finite-dimensional algebra satisfying a certain splitting condition. In this paper we develop a generalized Koszul theory…

Representation Theory · Mathematics 2013-12-09 Liping Li

In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$, or the complete graph minus a 1-factor as appropriate, into subgraphs such that each resolution class contains only blocks isomorphic to the same…

Combinatorics · Mathematics 2013-12-10 Salvatore Milici , Zsolt Tuza

Let S=K[x_1,...,x_n] be a polynomial ring over a field K and I a homogeneous ideal in S generated by a regular sequence f_1,f_2,...,f_k of homogeneous forms of degree d. We study a generalization of a result of Conca, Herzog, Trung, and…

Commutative Algebra · Mathematics 2013-08-01 Neeraj Kumar

We extend the the definition of Kumjian-Pask algebras to include algebras associated to finitely aligned higher-rank graphs. We show that these Kumjian-Pask algebras are universally defined and have a graded uniqueness theorem. We also…

Rings and Algebras · Mathematics 2015-12-22 Lisa Orloff Clark , Yosafat E. P. Pangalela

Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected graph, and a refined algorithm by Er\"ocal, Motsak, Schreyer and Steenpa{\ss} for computing syzygies, we display a free resolution of the lattice ideal…

Commutative Algebra · Mathematics 2018-02-23 Liam O'Carroll , Francesc Planas-Vilanova

We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…

Group Theory · Mathematics 2021-01-05 Noam Kolodner

In this paper we prove that, if $\mathbb{k}$ is an algebraically closed field of characteristic different from 2, almost all quadratic standard graded $\mathbb{k}$-algebras $R$ such that $\dim_{\mathbb{k}}R_2 = 3$ are Koszul. More…

Commutative Algebra · Mathematics 2020-06-17 Alessio D'Alì

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…

Combinatorics · Mathematics 2021-05-25 Marcin Stawiski
‹ Prev 1 3 4 5 6 7 10 Next ›