中文
相关论文

相关论文: On defining irreducibility

200 篇论文

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

表示论 · 数学 2024-10-28 Marko Čmrlec

A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a…

逻辑 · 数学 2014-04-01 Gyorgy Turan , Jon Yaggie

Let $G$ be a finite group of Lie type and $\ell$ be a prime which is not equal to the defining characteristic of $G$. In this note we discuss some open problems concerning the $\ell$-modular irreducible representations of $G$. We also…

表示论 · 数学 2011-07-04 Meinolf Geck

We establish an irreducibility property for the characters of finite dimensional, irreducible representations of simple Lie algebras (or simple algebraic groups) over the complex numbers, i.e., that the characters of irreducible…

表示论 · 数学 2011-10-25 C. S. Rajan

We prove some basic results about irreducible components of varieties of modules for an arbitrary finitely generated associative algebra. Our work generalizes results of Kac and Schofield on representations of quivers, but our methods are…

代数几何 · 数学 2007-05-23 William Crawley-Boevey , Jan Schröer

We prove that the finiteness of a finitely generated category of irreducible algebraic varieties over a field of characteristic zero is decidable. We also obtain a Burnside finiteness criterion for such a category, with applications to…

代数几何 · 数学 2023-09-11 Junho Peter Whang

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

逻辑 · 数学 2013-11-13 Ralph McKenzie , Matthew Smedberg

We prove Hilbert's irreducibility theorem for abelian varieties over function fields of characteristic zero.

代数几何 · 数学 2025-07-30 Ariyan Javanpeykar

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

逻辑 · 数学 2014-06-26 Shohei Izawa

We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…

形式语言与自动机理论 · 计算机科学 2018-12-06 Martin Beaudry

Let $\mathcal{V}$ be a congruence permutable variety generated by a finite nilpotent algebra $\mathbf{A}$. If $\mathbf{A}$ is a product of algebras of prime power order, then the class $\mathcal{V}_\text{si}$ of subdirectly irreducible…

逻辑 · 数学 2023-09-01 Joshua Grice

We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…

逻辑 · 数学 2025-06-16 Pablo Andújar Guerrero

In this paper, we study questions of definability and decidability for infinite algebraic extensions ${\bf K}$ of $\mathbb{F}_p(t)$ and their subrings of $\mathcal{S}$-integral functions. We focus on fields ${\bf K}$ satisfying a local…

数论 · 数学 2025-01-17 Alexandra Shlapentokh , Caleb Springer

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

逻辑 · 数学 2019-06-07 Matthew Moore

In this article we define a new reducibility based on the enumeration orders of r.e. sets.

形式语言与自动机理论 · 计算机科学 2010-03-03 Ali Akbar Safilian , Farzad Didehvar

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

计算机科学中的逻辑 · 计算机科学 2014-12-11 Fred Mesnard , Etienne Payet

We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…

数论 · 数学 2019-12-12 Lior Bary-Soroker , Alexei Entin

We prove that persistently finite algebras are not created by completions of algebras, in any ordered discriminator variety. A persistently finite algebra is one without infinite simple extensions. We prove that finite measurable relation…

逻辑 · 数学 2025-02-12 H. Andréka , I. Németi

We show that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…

表示论 · 数学 2007-05-23 C. S. Rajan

For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…

数论 · 数学 2012-10-11 James Lanterman
‹ 上一页 1 2 3 10 下一页 ›