Related papers: A graph theoretic approach to graded identities fo…

It was shown by Rordam and the second named author that a countable group G admits an action on a compact space such that the crossed product is a Kirchberg algebra if, and only if, G is exact and non-amenable. This construction allows a…

We show that the graded maximal ideal of a graded $K$-algebra $R$ has linear quotients for a suitable choice and order of its generators if the defining ideal of $R$ has a quadratic Gr\"obner basis with respect to the reverse lexicographic…

A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…

A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and…

We systematically develop a theory of graded semigroups, that is semigroups S partitioned by groups G, in a manner compatible with the multiplication on S. We define a smash product S#G, and show that when S has local units, the category…

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…

We study the C*-algebra crossed product $C_0(X)\rtimes G$ of a locally compact group $G$ acting properly on a locally compact Hausdorff space $X$. Under some mild extra conditions, which are automatic if $G$ is discrete or a Lie group, we…

To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

For a simple algebraic group $G$ over an algebraically closed field, we study products of normal subsets. For this we mark the nodes of the Dynkin diagram of $G$. We use two types of labels, a binary marking and a labeling with non-negative…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…

The theory of generalized matric Massey products has been applied for some time to $A$-modules $M$, $A$ a $k$-algebra. The main application is to compute the local formal moduli $\hat{H}_M$, isomorphic to the local ring of the moduli of…

The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

For a directed graph $E$, we compute the $K$-theory of the $C^*$-algebra $C^*(E)$ from the Cuntz-Krieger generators and relations. First we compute the $K$-theory of the crossed product $C^*(E)\times_\gamma\IT$, and then using duality and…

Let G be any group and F an algebraically closed field of characteristic zero. We show that any G-graded finite dimensional associative G-simple algebra over F is determined up to a G-graded isomorphism by its G-graded polynomial…

A graph $G$ is factored into graphs $H$ and $K$ via a matrix product if there exist adjacency matrices $A$, $B$, and $C$ of $G$, $H$, and $K$, respectively, such that $A = BC$. In this paper, we study the spectral aspects of the matrix…

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…

Given a graph $G$, a dominating set $D$ is a set of vertices such that any vertex in $G$ has at least one neighbor (or possibly itself) in $D$. A ${k}$-dominating multiset $D_k$ is a multiset of vertices such that any vertex in $G$ has at…