Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLocally free representations of quivers over commutative Frobenius algebras
131
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we investigate locally free representations of a quiver Q over a commutative Frobenius algebra R by arithmetic Fourier transform. When the base field is finite we prove that the number of isomorphism classes of absolutely indecomposable locally free representations of fixed rank is independent of the orientation of Q. We also prove that the number of isomorphism classes of locally free absolutely indecomposable representations of the preprojective algebra of Q over R equals the number of isomorphism classes of locally free absolutely indecomposable representations of Q over R[t]/(t^2). Using these results together with results of Geiss, Leclerc and Schroer we give, when k is algebraically closed, a classification of pairs (Q,R) such that the set of isomorphism classes of indecomposable locally free representations of Q over R is finite. Finally, when the representation is free of rank 1 at each vertex of Q, we study the function that counts the number of isomorphism classes of absolutely indecomposable locally free representations of Q over the Frobenius algebra F_q[t]/(t^r). We prove that they are polynomial in q and their generating function is rational and satisfies a functional equation.
rate research
Read More
In arXiv:0810.2076 we presented a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the representation varieties of Riemann surfaces with semi-simple conjugacy classes at the punctures. We proved several results which support this conjecture. Here we announce new results which are consequences of those of arXiv:0810.2076.
It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
This is a survey article for Handbook of Linear Algebra, 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraists point of view is given. The notion of quiver representations is extended to representations of mixed graphs, which permits one to study systems of linear mappings and bilinear or sesquilinear forms. The problem of classifying such systems is reduced to the problem of classifying systems of linear mappings.
In this paper, we clarify some aspects on LCD codes in the literature. We first prove that a non-free LCD code does not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the existence of LCD code over finite commutative Frobenius rings. We later show that a free constacyclic code over finite chain ring is LCD if and only if it is reversible, and also provide a necessary and sufficient condition for a constacyclic code to be reversible over finite chain rings. We illustrate the minimum Lee-distance of LCD codes over some finite commutative chain rings and demonstrate the results with examples. We also got some new optimal $mathbb{Z}_4$ codes of different lengths {which are} cyclic LCD codes over $mathbb{Z}_4$.
Let G be a complex reductive group acting on a finite-dimensional complex vector space H. Let B be a Borel subgroup of G and let T be the associated torus. The Mumford cone is the polyhedral cone generated by the T-weights of the polynomial functions on H which are semi-invariant under the Borel subgroup. In this article, we determine the inequalities of the Mumford cone in the case of the linear representation associated to a quiver and a dimension vector n=(n_x). We give these inequalities in terms of filtered dimension vectors, and we directly adapt Schofields argument to inductively determine the dimension vectors of general subrepresentations in the filtered context. In particular, this gives one further proof of the Horn inequalities for tensor products.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
