Related papers: A Note on Primitive Equivalence

Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…

We prove that in the varieties where every compact congruence is a factor congruence and every nontrivial algebra contains a minimal subalgebra, a finitely presented algebra is projective if and only if it has every minimal algebra as its…

As previously known, all 3-manifolds of genus two can be represented by edge-coloured graphs uniquely defined by 6-tuples of integers satisfying simple conditions. The present paper describes an ``elementary transformation'' on these…

A recently proposed integral representation for permanents is rederived using only elementary combinatorics. For this proof the assumption that the matrix, for which the permanent is calculated, has an inverse is not necessary.

We define {\bf primitive derivations} for Coxeter arrangements which may not be irreducible. Using those derivations, we introduce the {\bf primitive filtrations} of the module of invariant logarithmic differential forms for an arbitrary…

In this paper two related simplification problems for systems of linear inequalities describing precedence relation systems are considered. Given a precedence relation system, the first problem seeks a minimum subset of the precedence…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…

Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte--Coxeter graph and the Higman--Sims graph. In this paper we systematically analyse edge-primitive and edge-quasiprimitive graphs via the O'Nan--Scott Theorem…

We classify finite primitive permutation groups having a suborbit of length 5. As a corollary, we obtain a classification of finite vertex-primitive graphs of valency 5. In the process, we also classify finite almost simple groups that have…

We study equivalence relation of the set of triangles generated by similarity and operation on a triangle to get a new one by joining division points of three edges with the same ratio. Using the moduli space of similarity classes of…

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

We prove that a unital shift equivalence induces a graded isomorphism of Leavitt path algebras when the shift equivalence satisfies an alignment condition. This yields another step towards confirming the Graded Classification Conjecture.…

Let k be an algebraically closed field of characteristic 0. Musson and vandenBergh classified primitive ideals for rings of torus invariant differential operators. This classification applies in particular to subquotients of localized…

In this paper, prime as well as primitive Kumjian-Pask algebras $\mathrm{KP}_R(\Lambda)$ of a row-finite $k$-graph $\Lambda$ over a unital commutative ring $R$ are completely characterized in graph-theoretic and algebraic terms. By applying…

Motivated by Williams' problem of measuring novel differences between shift equivalence (SE) and strong shift equivalence (SSE), we introduce three equivalence relations that provide new ways to obstruct SSE while merely assuming SE. Our…

In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…

Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…

The centralizer of a matrix in a full matrix algebra is called a principal centralizer matrix algebra. Characterizations are presented for principal centralizer matrix algebras to be Morita equivalent, almost $\nu$-stable derived…

An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…