Results 41 to 50 of about 36,999 (191)
, 2018 The aim of Bogomolov's programme is to prove birational anabelian conjectures for function fields $K|k$ of varieties of dimension $\geq 2$ over algebraically closed fields. The present article is concerned with the 1-dimensional case.
Lüdtke, Martin
core +2 more sources
Solving the n $n$‐Player Tullock Contest
Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley +1 more source
Discrete Cartesian Coordinate Transformations: Using Algebraic Extension Methods
Applied SciencesIt is shown that it is reasonable to use Galois fields, including those obtained by algebraic extensions, to describe the position of a point in a discrete Cartesian coordinate system in many cases. This approach is applicable to any problem in which the
Aruzhan Kadyrzhan +3 more
doaj +1 more source
A classification of Prüfer domains of integer‐valued polynomials on algebras
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract Let D$D$ be an integrally closed domain with quotient field K$K$ and A$A$ a torsion‐free D$D$‐algebra that is finitely generated as a D$D$‐module and such that A∩K=D$A\cap K=D$. We give a complete classification of those D$D$ and A$A$ for which the ring IntK(A)={f∈K[X]∣f(A)⊆A}$\textnormal {Int}_K(A)=\lbrace f\in K[X] \mid f(A)\subseteq A ...
Giulio Peruginelli, Nicholas J. Werner
wiley +1 more source
Electronic Fourier–Galois Spectrum Analyzer for the Field GF(31)
Applied SciencesA scheme for the Fourier–Galois spectrum analyzer for the field GF(31) is proposed. It is shown that this analyzer allows for solving a wide enough range of problems related to image processing, in particular those arising in the course of experimental ...
Kaisarali Kadyrzhan +5 more
doaj +1 more source
A Method for Strict Remote User Identification Using non - Reversible Galois Field Transformations
MATEC Web of Conferences, 2017 This article proposes an approach that accelerates the realization of strict remote user identification using non reversible Galois field transformation.
Bardis Nikolaos G. +2 more
doaj +1 more source
NONLINEAR NYBERG CONSTRUCTION TRANSFORMS OVER ISOMORPHIC REPRESENTATIONS OF FIELDS GALOIS
Системный анализ и прикладная информатика, 2017 Further development of cryptographic algorithms based on the principles of many-valued logic requires more accurate research of non-binary cryptographic primitives – S-boxes.
A. V. Sokolov, O. N. Zhdanov
doaj +1 more source
Design space exploration of high throughput finite field multipliers for channel coding on Xilinx FPGAs [PDF]
Advances in Radio Science, 2012 Channel coding is a standard technique in all wireless communication systems. In addition to the typically employed methods like convolutional coding, turbo coding or low density parity check (LDPC) coding, algebraic codes are used in many cases.
C. de Schryver +3 more
doaj +1 more source
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
International Journal of Mathematics and Mathematical Sciences, 1997 First, we will give all necessary definitions and theorems. Then the definition of a Hilbert sequence by using a Galois group is introduced. Then by using the Hilbert sequence, we will build tower fields for extension K/k, where K=k(d1,d2) and k=Q for ...
M. Haghighi, J. Miller
doaj +1 more source