English
Related papers

Related papers: Undecidability of $\mathbb Q^{(2)}$

200 papers

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Number Theory · Mathematics 2007-05-23 Roland Bacher

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

We give the decomposition into irreducible factors of Weil representations of the symplectic groups at even levels, generalizing previous decompositions at odd levels. We then derive the decomposition of the quantum representations of…

Representation Theory · Mathematics 2017-10-30 Julien Korinman

The complexes of integral forms on the quantum Euclidean group $E_q(2)$ and the quantum plane are defined and their isomorphisms with the corresponding de Rham complexes are established.

Quantum Algebra · Mathematics 2015-03-13 Tomasz Brzeziński

In this paper, we classify the possible torsion subgroup structures of elliptic curves defined over the compositum of all quadratic extensions of the rational number field, whose $j$-invariant is a rational number not equal to 0 or 1728.

Number Theory · Mathematics 2025-02-13 Lucas Hamada

We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria in terms of (partial) homomorphisms and products and prove that this problem is…

Logic in Computer Science · Computer Science 2016-08-08 Elena Botoeva , Carsten Lutz , Vladislav Ryzhikov , Frank Wolter , Michael Zakharyaschev

In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…

Number Theory · Mathematics 2026-02-10 Simona Fryšová , Magdaléna Tinková

We show that for any positive integer $N$, there are only finitely many holomorphic eta quotients of level $N$, none of which is a product of two holomorphic eta quotients other than 1 and itself. This result is an analog of Zagier's…

Number Theory · Mathematics 2017-09-19 Soumya Bhattacharya

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

Number Theory · Mathematics 2018-09-07 Lucas Reis

In the paper it is demonstrated that Bells theorem is an unprovable theorem.

General Physics · Physics 2021-11-16 Han Geurdes , Koji Nagata , Tadao Nakamura , Ahmed Farouk

We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.

General Topology · Mathematics 2007-05-23 Aarno Hohti

We provide a partial result on Taylor's modularity conjecture, and several related problems. Namely, we show that the interpretability join of two idempotent varieties that are not congruence modular is not congruence modular either, and we…

Rings and Algebras · Mathematics 2018-12-06 Jakub Opršal

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…

Commutative Algebra · Mathematics 2018-08-30 Chris J. Conidis , Pace P. Nielsen , Vandy Tombs

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

Logic · Mathematics 2026-05-19 Gwangyong Gwon

The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…

Logic in Computer Science · Computer Science 2018-02-05 Joel Day , Vijay Ganesh , Paul He , Florin Manea , Dirk Nowotka

Irreducible representations of quantum groups $SL_q(2)$ (in Woronowicz' approach) were classified in J.Wang, B.Parshall, Memoirs AMS 439 in the~case of $q$ being an~odd root of unity. Here we find the~irreducible representations for all…

High Energy Physics - Theory · Physics 2008-02-03 P. Kondratowicz , P. Podles

For a Galois extension $K/F$ with $\text{char}(K)\neq 2$ and $\text{Gal}(K/F) \simeq \mathbb{Z}/2\mathbb{Z}\oplus\mathbb{Z}/2\mathbb{Z}$, we determine the $\mathbb{F}_2[\text{Gal}(K/F)]$-module structure of $K^\times/K^{\times 2}$. Although…

Number Theory · Mathematics 2022-05-27 Frank Chemotti , Jan Minac , Andrew Schultz , John Swallow

We prove that the enveloping algebra $U(\mathfrak q)$ of a finite-dimensional Lie algebra $\mathfrak q$ contains a commutative subalgebra of the maximal possible transcendence degree $(\dim\mathfrak q+ \mathrm{ind}\,\mathfrak q)/2$.

Representation Theory · Mathematics 2020-01-31 Oksana Yakimova

In this paper we first review the history of Hilbert's Tenth Problem, and then study mixed quantifier prefixes over Diophantine equations with integer variables. For example, we prove that $\forall^2\exists^4$ over $\mathbb Z$ is…

Number Theory · Mathematics 2024-06-14 Zhi-Wei Sun
‹ Prev 1 8 9 10 Next ›