Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    EXPONENT MATRICES AND TILED ORDERS OVER DISCRETE VALUATION RINGS

    Exponent matrices appear in the theory of tiled orders over a discrete valuation ring. Many properties of such an order and its quiver are fully determined by its exponent matrix. We prove that an arbitrary strongly connected simply laced quiver with a loop in every vertex is realized as the quiver of a reduced exponent matrix. The relations between exponent matrices and finite posets, Markov chains, and doubly stochastic matrices are discussed.

  • articleNo Access

    ON INCIDENCE MODULO IDEAL RINGS

    For a given associative ring B, a two-sided ideal J ⊂ B and a finite partially ordered set P, we study the ring A = I(P, B, J) of incidence modulo J matrices determined by P. The properties of A involving its radical and quiver are investigated, and the interaction of A with serial rings is explored. The category of A-modules is studied if P is linearly ordered. Applications to the general linear group over some local rings are given.

  • articleNo Access

    On exponent matrices of tiled orders

    We describe two methods to determine all generators of the additive semigroup of the non-negative exponent n×n-matrices, and illustrate them finding all generating 3×3-exponent matrices. The generating 4×4-exponent matrices are found using a computer. We consider the Hasse diagram H of the partially ordered set of non-negative matrices and prove that for an arbitrary non-negative exponent matrix A there exists an oriented path in H, starting in some matrix unit and ending in A, which does not pass through any other exponent matrix. We also show that for any non-negative exponent matrix A there exists a chain of non-negative exponent matrices A0A1At=A such that A0 is a (0,1)-matrix, and each Ai is obtained from Ai1 by adding a (0,1)-matrix.