algebraic fields
Recently Published Documents


TOTAL DOCUMENTS

55
(FIVE YEARS 3)

H-INDEX

9
(FIVE YEARS 1)

2021 ◽  
pp. 102973
Author(s):  
Sylvy Anscombe ◽  
Philip Dittmann ◽  
Arno Fehm
Keyword(s):  

2018 ◽  
Vol 32 (14) ◽  
pp. 1850149 ◽  
Author(s):  
Nikolaos Kalogeropoulos

We propose an alternative definition for a Tsallis entropy composition-inspired Fourier transform, which we call “[Formula: see text]-Fourier transform”. We comment about the underlying “covariance” on the set of algebraic fields that motivates its introduction. We see that the definition of the [Formula: see text]-Fourier transform is automatically invertible in the proper context. Based on recent results in Fourier analysis, it turns that the [Formula: see text]-Fourier transform is essentially unique under the assumption of the exchange of the point-wise product of functions with their convolution.


2017 ◽  
Vol 82 (2) ◽  
pp. 474-488
Author(s):  
MOSHE JARDEN ◽  
ALEXANDRA SHLAPENTOKH

AbstractWe discuss the connection between decidability of a theory of a large algebraic extensions of ${\Bbb Q}$ and the recursiveness of the field as a subset of a fixed algebraic closure. In particular, we prove that if an algebraic extension K of ${\Bbb Q}$ has a decidable existential theory, then within any fixed algebraic closure $\widetilde{\Bbb Q}$ of ${\Bbb Q}$, the field K must be conjugate over ${\Bbb Q}$ to a field which is recursive as a subset of the algebraic closure. We also show that for each positive integer e there are infinitely many e-tuples $\sigma \in {\text{Gal}}\left( {\Bbb Q} \right)^e $ such that the field $\widetilde{\Bbb Q}\left( \sigma \right)$ is primitive recursive in $\widetilde{\Bbb Q}$ and its elementary theory is primitive recursively decidable. Moreover, $\widetilde{\Bbb Q}\left( \sigma \right)$ is PAC and ${\text{Gal}}\left( {\widetilde{\Bbb Q}\left( \sigma \right)} \right)$ is isomorphic to the free profinite group on e generators.


2014 ◽  
Vol 367 (6) ◽  
pp. 3981-4017 ◽  
Author(s):  
Denis R. Hirschfeldt ◽  
Ken Kramer ◽  
Russell Miller ◽  
Alexandra Shlapentokh
Keyword(s):  

2009 ◽  
Vol 74 (4) ◽  
pp. 1325-1351 ◽  
Author(s):  
Russell Miller

AbstractWe use the Low Basis Theorem of Jockusch and Soare to show that all computable algebraic fields are d-computably categorical for a particular Turing degree d with d′ = 0″, but that not all such fields are 0′-computably categorical. We also prove related results about algebraic fields with splitting algorithms, and fields of finite transcendence degree over ℚ.


Sign in / Sign up

Export Citation Format

Share Document