English
Related papers

Related papers: Undecidability, unit groups, and some totally imag…

200 papers

Since the introduction of Askey-Wilson algebras by Zhedanov in 1991, the classification of the finite-dimensional irreducible modules of Askey-Wilson algebras remains open. A universal analog $\triangle_q$ of the Askey-Wilson algebras was…

Rings and Algebras · Mathematics 2015-07-14 Hau-wen Huang

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

Logic · Mathematics 2007-05-23 Oleg Belegradek

Let $n>1$ be an odd integer. We prove that there are infinitely many imaginary quadratic fields of the form $\mathbb{Q}(\sqrt{x^2-2y^n})$ whose ideal class group has an element of order $n$. This family gives a counter example to a…

Number Theory · Mathematics 2019-09-05 Kalyan Chakraborty , Azizul Hoque

The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…

solv-int · Physics 2009-10-30 Y. Brihaye , S. Giller , P. Kosinski , J. Nuyts

We provide algebraic conditions ensuring the decidability of the theory of modules over effectively given Pr\"ufer (in particular B\'ezout) domains with infinite residue fields in terms of a suitable generalization of the prime radical…

Logic · Mathematics 2024-12-23 Lorna Gregory , Sonia L'Innocente , Gena Puninski , Carlo Toffalori

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Logic · Mathematics 2018-04-18 Lars Kristiansen , Juvenal Murwanashyaka

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Dynamical Systems · Mathematics 2015-03-31 Simone Ugolini

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…

Logic · Mathematics 2007-05-23 Patrick Cegielski , Denis Richard , Maxim Vsemirnov

The description of irreducible finite dimensional representations of finite dimensional solvable Lie superalgebras over complex numbers given by V.~Kac is refined. In reality these representations are not just induced from a polarization…

Representation Theory · Mathematics 2007-05-23 Alexander Sergeev

Under the assumption that the quantum parameter $q$ is an $l$-th primitive root of unity with $l$ odd in a field $F$ of characteristic 0 and $m+n\geq r$, we obtained a complete classification of irreducible modules of the $q$-Schur…

Representation Theory · Mathematics 2013-01-03 Jie Du , Haixia Gu , Jianpan Wang

Fix a finite collection of primes $\{ p_j \}$, not containing $2$ or $3$. Using some observations which arose from attempts to solve the SIC-POVMs problem in quantum information, we give a simple methodology for constructing an infinite…

Number Theory · Mathematics 2024-06-24 Gary McConnell

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

Logic · Mathematics 2024-07-08 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

We construct an infinite family of imaginary bicyclic biquadratic number fields $k$ with the 2-ranks of their 2-class groups are $\geq3$, whose strongly ambiguous classes of $k/Q(i)$ capitulate in the absolute genus field $k^{(*)}$, which…

Number Theory · Mathematics 2015-03-13 Abdelmalek Azizi , Abdelkader Zekhnini , Mohammed Taous

We determine a necessary and sufficient condition for the infinitude of primes $p$ such that none of the equations $a_i^x \equiv b_i \pmod{p}, 1 \le i \le n,$ are solvable. We control the insolvability of $a^x \equiv b \pmod{p}$ by power…

Number Theory · Mathematics 2020-07-03 Olli Järviniemi

We consider questions posed in a recent paper of Mandayam, Bandyopadhyay, Grassl and Wootters [10] on the nature of "unextendible mutually unbiased bases." We describe a conceptual framework to study these questions, using a connection…

Quantum Physics · Physics 2014-07-11 Koen Thas

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

Number Theory · Mathematics 2024-05-08 Lior Bary-Soroker , Daniele Garzoni , Vlad Matei

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

Logic in Computer Science · Computer Science 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski