Related papers: Computing quaternion quotient graphs via represent…
Leavitt path algebras are shown to be algebras of right quotients of their corresponding path algebras. Using this fact we obtain maximal algebras of right quotients from those (Leavitt) path algebras whose associated graph satisfies that…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…
We provide a graphical calculus for computing averages of tensor network diagrams with respect to the distribution of random vectors containing independent uniform complex phases. Our method exploits the order structure of the partially…
Some comments are made on the matrices which serve as the basis of a quaternionic algebra. We show that these matrices are related with the quaternionic action of the imaginary units from the left and from the right.
We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest…
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…
In the graphical calculus of planar string diagrams, equality is generated by exchange moves, which swap the heights of adjacent vertices. We show that left- and right-handed exchanges each give strongly normalizing rewrite strategies for…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
We construct C-algebras for a class of surfaces that are inverse images of certain polynomials of arbitrary degree. By using the directed graph associated to a matrix, the representation theory can be understood in terms of ``loop'' and…
I consider differential of mapping $f$ of continuous division ring as linear mapping the most close to mapping $f$. Different expressions which correspond to known deffinition of derivative are supplementary. I explore the Gateaux…
Conjugation coactions of the quantum general linear group on the algebra of quantum matrices have been introduced in an earlier paper and the coinvariants have been determined. In this paper the notion of orbit is considered via co-orbit…
Let $K$ be the function field of a curve $C$ over a field $\mathbb{F}$ of either odd or zero characteristic. Following the work by Serre and Mason on $\mathrm{SL}_2$, we study the action of arithmetic subgroups of $\mathrm{SU}(3)$ on its…
A variety of universal similarity factorization equalities over real Clifford algebras ${\cal R}_{p,q}$ are established. On the basis of these equalities, real, complex and quaternion matrix representations of elements in ${\cal R}_{p,q}$…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…
We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the…
With the intent of laying the groundwork for a program that aims at explicitly describing the space of Cartan (i.e. multiplicative) connections on a general proper Lie groupoid, we begin to investigate the space of such connections in the…