Related papers: Free multiderivations of connected subgraph arrang…

Cuntz algebras $\mathcal{O}_n$, $n>1$, are celebrated examples of a separable infinite simple C*-algebra with a number of fascinating properties. Their K-theory allows an embedding of $\mathcal O_m$ in $\mathcal O_n$ whenever $n-1$ divides…

We show the quarter of a century old conjecture that every $K_4$-free graph with $n$ vertices and $\lfloor n^2/4 \rfloor +k$ edges contains $k$ pairwise edge disjoint triangles.

Let $\mathcal C :f=0$ be a curve arrangement in the complex projective plane. If $\mathcal C$ contains a curve subarrangement consisting of at least three members in a pencil, then one obtains an explicit syzygy among the partial…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

Motivated by pseudo-Gorenstein rings in commutative algebra, introduced by Herzog et al., we define pseudo-Gorenstein$^{*}$ graphs and classify them in several natural graph families using independence polynomials.

We define a $(V_1, V_2, \ldots, V_k)$-partition for a given graph $H$ and graphical properties $P_1, P_2, \ldots, P_k$ as a partition where each $V_i$ induces a subgraph of $H$ with property $P_i$. Matamala (2007) extended this result by…

We say that a nonselfadjoint operator algebra is partly free if it contains a free semigroup algebra. Motivation for such algebras occurs in the setting of what we call free semigroupoid algebras. These are the weak operator topology closed…

The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We determine, with an exception of two cases, the complexity of the…

Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. There is the stronger…

An algebra with identities $(a,b,c)=(a,c,b)=(b,a,c)$ is called {\it assosymmetric}, where $(x,y,z)=(xy)z-x(yz)$ is associator. We study $S_n$-module, $A_n$-module and $GL_n$-module structures of free assosymmetric algebra.

Quasi-free actions of finite groups on Cuntz algebras $\mathcal O_n$ for $n\geq 2$ are classified up to conjugacy by data in the representation ring. Partial results are obtained for quasi-free actions by compact groups.

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

A graph is unichord free if it does not contain a cycle with exactly one chord as its subgraph. In [3], it is shown that a graph is unichord free if and only if every minimal vertex separator is a stable set. In this paper, we first show…

We generalize free monoids by defining $k$-monoids. These are nothing other than the one-vertex higher-rank graphs used in $C^{\ast}$-algebra theory with the cardinality requirement waived. The $1$-monoids are precisely the free monoids. We…

We define a notion of cofibration among n-categories and show that the cofibrant objects are exactly the free ones, that is those generated by polygraphs.

This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…

Let $K\langle X_d\rangle$ denote the free associative algebra of rank $d \geq 2$ over a field $K$. By results of Lane (1976) and Kharchenko (1978), the algebra of invariants $K\langle X_d\rangle ^G$ is free for any subgroup $G \leq…

This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…

Paolo Aluffi showed that the Chern--Schwartz--MacPherson class of the complement of a free arrangement agrees with the total Chern class of the sheaf of logarithmic derivations along the arrangement. We describe the defect of equality of…