相关论文: On defining irreducibility

We consider a version of a famous open problem formulated by Kadison, asking whether bounded representations of operator algebras are automatically completely bounded. We investigate this question in the context of amenable operator…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

The motivation for this paper is to detect when an irreducible projective variety V is not toric. We do this by analyzing a Lie group and a Lie algebra associated to V. If the dimension of V is strictly less than the dimension of the above…

Let L be a finite-dimensional Lie algebra over a field of non-zero characteristic. By a theorem of Jacobson, L has a finite-dimensional faithful module which is completely reducible. We show that if the field is not algebraically closed,…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

We determine the finite groups whose real irreducible representations have different degrees.

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

The decision problem of membership in the Representation Class of Relation Algebras (RRA) for finite structures is undecidable. However, this does not hold for many Relation Algebra reduct languages. Two well known properties that are…

We develop a simple algebraic approach to the study of the Weil representation associated to a finite abelian group. As a result, we obtain a simple proof of a generalisation of a well-known formula for the absolute value of its character.…

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

We determine the regular irreducible components of the variety mod(A,d), where A=kQ/I is a string algebra and I is generated by a set of paths of length two. Our case is among the first examples of descriptions of irreducible components,…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We study finite-dimensional representations of hyper loop algebras over non-algebraically closed fields. The main results concern the classification of the irreducible representations, the construction of the Weyl modules, base change,…

We call a finite-dimensional K-algebra A geometrically irreducible if for all d all connected components of the affine scheme of d-dimensional A-modules are irreducible. We prove that a geometrically irreducible algebra with exactly two…

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

We exhibit a theory where definable types lack the amalgamation property.

In this paper, we first present a classification theorem of infinite-dimensional simple Novikov algebras over an algebraically closed field with characteristic 0. Then we classify all the irreducible modules of a certain…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…