On the Cycle Structure of Permutation Polynomials of Finite Fields [PDF]
, 2007 Any permutation of a finite field Fq can be represented by a polynomial Pn(x)=(⋯+((a0x+a1)q−2+a2)q−2+⋯+an)q−2+an+1, for some n⩾0. P0 is linear and the cycle structure of P1 is known.
Meidl, Wilfried +2 more
core +3 more sources
A natural graph of finite fields distinguishing between models
, 2021 We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.
Kuhn, Gaëtan +3 more
core +1 more source
Algebraic Methods for Finite Linear Cellular Automata [PDF]
, 1996 PhDCellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are ...
Dow, R. A.
core +4 more sources
Tuples of polynomials over finite fields with pairwise coprimality conditions [PDF]
, 2018 Let q be a prime power. We estimate the number of tuples of degree bounded monic polynomials (Q1, . . . , Qv) ∈ (Fq[z])v that satisfy given pairwise coprimality conditions.
Randell Heyman +3 more
core +1 more source
Finite elements with divergence-free shape function and the application to inhomogeneously-loaded waveguide analysis [PDF]
, 1997 A simple mixed triangular edge element is proposed for the finite elements, with which inhomogeneously-loaded and arbitrarily shaped waveguides are analyzed.
Kagawa, Yukio, Mahmood, Zaheed
core +1 more source
The Chebotarev density theorem for function fields-Incomplete intervals
, 2021 We prove a Polya-Vinogradov type variation of the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" I subset of F-p, provided (p(1/2) log p)/|I| = o(1). Applications include density results for irreducible
Rosenzweig, Lior,, Kurlberg, Pär,
core +1 more source
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
IEEE Access, 2020 Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on
Hong-Li Wang, Gang Wang, You Gao
doaj +1 more source
Computation with finite fields
Information and Control, 1963 A technique for systematically generating representations of finite fields is presented. Relations which must be physically realized in order to implement a parallel arithmetic unit to add, multiply, and divide elements of finite fields of 2n elements are obtained.
Thomas C. Bartee, David I. Schneider
openaire +1 more source
Practical analysis of 3-D dynamic nonlinear magnetic field using time-periodic finite element method [PDF]
, 1995 A practical 3-D finite element method using edge elements for analyzing stationary nonlinear magnetic fields with eddy currents in electric apparatus, in which the flux interlinking the voltage winding is given, has been proposed.
Nakata, Takayoshi +5 more
core +1 more source
The finite-volume method in computational rheology [PDF]
, 2012 The finite volume method (FVM) is widely used in traditional computational fluid dynamics (CFD), and many commercial CFD codes are based on this technique which is typically less demanding in computational resources than finite element methods (FEM ...
Pinho, F.T. +4 more
core +4 more sources