Results 21 to 30 of about 89,096 (260)
Finite H_v-Fields with Strong-Inverses
Ratio Mathematica, 2017 The largest class of hyperstructures is the class of H v -structures. This is the class of hyperstructures where the equality is replaced by the non-empty intersection.
Theodora Kaplani, Thomas Vougiouklis
doaj +1 more source
Proceedings of the American Mathematical Society, 1962 Let \(F^*\) be the multiplicative group of non-zero elements of \(\mathrm{GF}(p^n)\) where \(p\) is a prime; set \(p^n-1 = rs\) where \((r, s) = 1\), \(r < s\) and \(r\not\equiv 1 \bmod p\). \(F^*\) has subgroups \(Y, Z\) of orders \(r, s\) respectively and every element \(\xi\) of \(F^*\) can be expressed uniquely in the form \(\xi = \eta\zeta\) with \
openaire +2 more sources
On permutation polynomials over finite fields
International Journal of Mathematics and Mathematical Sciences, 1987 A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
FINITE UNDECIDABILITY IN NIP FIELDS
The Journal of Symbolic Logic, 2023 AbstractA field K in a ring language $\mathcal {L}$ is finitely undecidable if $\mbox {Cons}(T)$ is undecidable for every nonempty finite $T \subseteq {\mathtt{Th}}(K; \mathcal {L})$ . We extend a construction of Ziegler and (among other results) use a first-order classification of Anscombe and Jahnke to prove every NIP henselian nontrivially ...
openaire +1 more source
Superregular Matrices over Finite Fields
MathematicsA trivially zero minor of a matrix is a minor having all its terms in the Leibniz formula equal to zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero.
Paulo Almeida +2 more
doaj +1 more source
Parallel machine arithmetic for recurrent number systems in non-quadratic fields [PDF]
Компьютерная оптика, 2020 The paper proposes a new method of synthesis of computer arithmetic systems for "error-free" parallel calculations. The difference between the proposed approach and calculations in traditional systems of Residue Number Systems for the direct sum of ...
Vladimir Chernov
doaj +1 more source
Pseudo-Chebyshev Functions Over Finite Fields
IEEE Open Journal of Circuits and SystemsIn this paper, we introduce the notion of pseudo-Chebyshev functions over finite fields. In brief, such functions correspond to a generalization of the $n$ -th Chebyshev polynomial, where $n$ is not restricted to integer values, but can take on any ...
Juliano B. Lima +2 more
doaj +1 more source
Distribution of constant terms of irreducible polynomials in ℤₚ[x] whose degree is a product of two distinct odd primes [PDF]
Notes on Number Theory and Discrete MathematicsWe obtain explicit formulas for the number of monic irreducible polynomials with prescribed constant term and degree q₁q₂ over a finite field, where q₁ and q₂ are distinct odd primes. These formulas are derived from work done by Yucas.
Sarah C. Cobb +4 more
doaj +1 more source
A Small Subgroup Attack on Bitcoin Address Generation
Mathematics, 2020 We show how a small subgroup confinement-like attack may be mounted on the Bitcoin addresses generation protocol, by inspecting a special subgroup of the group associated to point multiplication.
Massimiliano Sala +2 more
doaj +1 more source
Decomposition of permutations in a finite field
Cryptography and Communications, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikova, Svetla +2 more
openaire +3 more sources