Related papers: On defining irreducibility

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

We relate the geometry of the resonance varieties associated to a commutative differential graded algebra model of a space to the finiteness properties of the completions of its Alexander-type invariants. We also describe in simple…

We examine Li's double determinantal varieties in the special case that they are toric. We recover from the general double determinantal varieties case, via a more elementary argument, that they are irreducible and show that toric double…

Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…

We introduce a notion of fractional (noninteger order) derivative on an arbitrary nonempty closed subset of the real numbers (on a time scale). Main properties of the new operator are proved and several illustrative examples given.

Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.

We give parameterizations of the irreducible representations of finite groups of Lie type in their defining characteristic.

We study evolution algebras of arbitrary dimension. We analyze in deep the notions of evolution subalgebras, ideals and non-degeneracy and describe the ideals generated by one element and characterize the simple evolution algebras. We also…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…

Irreducible representations are the building blocks of general, semisimple Galois representations \rho, and cuspidal representations are the building blocks of automorphic forms \pi of the general linear group. It is expected that when an…

The SU(2) TQFT representation of the mapping class group of a closed surface of genus g, at a root of unity of prime order, is shown to be irreducible. Some examples of reducible representations are also given.

We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…

We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong…

In this paper we continue the investigation of a real number object, i.e., an object representing the real numbers, in categories of relations. Our axiomatization is based on a relation algebraic version of Tarski's axioms of the real…

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

In this survey, we shall be concerned with the category of finite-dimensional representations of the untwisted quantum affine algebras when the quantum parameter q is not a root of unity. We review the foundational results of the subject,…

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

We give a characterization theorem for non-degenerated plane foliations of degree different from 1 having a rational first integral. Moreover, we prove that the degree $r$ of a non-degenerated foliation as above provides the minimum number,…

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…