Related papers: Computable Categoricity for Algebraic Fields with …
Let F be a finite field with q elements, let A be a finite dimensional F-algebra and let J=J(A) be the Jacobson radical of A. Then G=1+J is a p-group, where p is the characteristic of F. We refer to G as an F-algebra group. A subgroup H of…
G. Prasad and A. Rapinchuk asked if two quaternion division F -algebras that have the same subfields are necessarily isomorphic. The answer is known to be "no" for some very large fields. We prove that the answer is "yes" if F is an…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
We give a full classification, up to equivalence, of finite-dimensional graded division algebras over the field of real numbers. The grading group is any abelian group.
The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…
Let $K$ be a subfield of $\mathbb{R}$. The theory of $\mathbb{R}$ viewed as an ordered $K$-vector space and expanded by a predicate for $\mathbb{Z}$ is decidable if and only if $K$ is a real quadratic field.
We prove that the Reeb space of a proper definable map $f:X \rightarrow Y$ in an arbitrary o-minimal expansion of a real closed field is realizable as a proper definable quotient. This result can be seen as an o-minimal analog of Stein…
Frames play an important role in various practical problems related to signal and image processing. In this paper, we define computable frames in computable Hilbert spaces and obtain computable versions of some of their characterizations.…
We propose the notion of countable decomposability of maps on C*-algebras: a bounded linear map $\varphi : \mathscr{A}\to B(\mathcal{H})$, where $\mathscr{A}$ is a C*-algebra and $\mathcal{H}$ a Hilbert space, will be called countably…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
A finite group $G$ is said to be admissible over a field $F$ if there exists a division algebra $D$ central over $F$ with a maximal subfield $L$ such that $L/F$ is Galois with group $G$. In this paper we give a complete characterization of…
An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…
We present a unified ring theoretic approach, based on properties of the Casimir element of a symmetric algebra, to a variety of known divisibility results for the degrees of irreducible representations of semisimple Hopf algebras in…
The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…
We consider the problem where a set of individuals has to classify $m$ objects into $p$ categories by aggregating the individual classifications, and no category can be left empty. An aggregator satisfies \emph{Expertise} if individuals are…
In this paper, we consider the problem of determining the \emph{exact} number of periodic orbits for polynomial planar flows. This problem is a variant of Hilbert's 16th problem. Using a natural definition of computability, we show that the…
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…