Related papers: The Minimal Non-Koszul A(Gamma)
Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…
Axial algebras are non-associative algebras generated by semisimple idempotents whose adjoint actions obey a fusion law. Axial algebras that are generated by two such idempotents play a crucial role in the theory. We classify all primitive…
The relationship between an algebra and its associated monomial algebra is investigated when at least one of the algebras is $d$-Koszul. It is shown that an algebra which has a reduced \grb basis that is composed of homogeneous elements of…
Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…
We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…
We study the Koszul property of a standard graded $K$-algebra $R$ defined by the binomial edge ideal of a pair of graphs $(G_1,G_2)$. We show that the following statements are equivalent: (i) $R$ is Koszul; (ii) the defining ideal…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all the edges of label $m$. A chart $\Gamma$ is of type $(m;2,3,2)$ if $w(\Gamma)=7$, $w(\Gamma_m\cap\Gamma_{m+1})=2$, $w(\Gamma_{m+1}\cap\Gamma_{m+2})=3$, and…
We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…
Confirming a conjecture of Ne\v{s}et\v{r}il, we show that up to isomorphism there is only a finite number of finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly…
Let $\Gamma$ be a simple graph of size $m$ and degree sequence $\delta_1\ge \delta_2\ge ... \ge \delta_n$. Let ${\cal L}(\Gamma)$ denotes the line graph of $\Gamma$. The aim of this paper is to study mathematical properties of the alliance…
We consider extremal problems for subgraphs of pseudorandom graphs. For graphs $F$ and $\Gamma$ the generalized Tur\'an density $\pi_F(\Gamma)$ denotes the density of a maximum subgraph of $\Gamma$, which contains no copy of~$F$. Extending…
We prove that finitely generated purely loxodromic subgroups of a right-angled Artin group $A(\Gamma)$ fulfill equivalent conditions that parallel characterizations of convex cocompactness in mapping class groups $\text{Mod}(S)$. In…
Koszul algebras have arisen in many contexts; algebraic geometry, combinatorics, Lie algebras, non-commutative geometry and topology. The aim of this paper and several sequel papers is to show that for any finite dimensional algebra there…
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensonal braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…
Juri\'{s}i\v{c} et al. conjectured that if a distance-regular graph $\Gamma$ with diameter $D$ at least three has a light tail, then one of the following holds: 1.$a_1 =0$; 2.$\Gamma$ is an antipodal cover of diameter three; 3.$\Gamma$ is…
Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all the edges of label $m$. A chart $\Gamma$ is of type $(3,2,2)$ if there exists a label $m$ such that $w(\Gamma)=7$, $w(\Gamma_m\cap\Gamma_{m+1})=3$,…
Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $\Gamma_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some…
We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular…
In his 1930 paper, Kuratowksi categorized planar graphs, proving that a finite graph $\Gamma$ is planar if and only if it does not contain a subgraph that is homeomorphic to $K_5$, the complete graph on 5 vertices, or $K_{3,3}$, the…