Results 31 to 40 of about 68,753 (202)
On Values of Cyclotomic Polynomials. V [PDF]
In this paper, we present three results on cyclotomic polynomials. First, we present results about factorization of cyclotomic polynomials over arbitrary fields K.
Motose, Kaoru
core +1 more source
Square-free values of reducible polynomials
Square-free values of reducible polynomials, Discrete Analysis, 2016:8, 18 pp. When does a polynomial with integer coefficients take infinitely many prime values? An obvious necessary condition is that it should be irreducible, and another is that there
Andrew R. Booker, T. D. Browning
doaj +1 more source
The construction of graphs with irreducible matching polynomials and their generalizations
This paper investigates methods for constructing graphs whose matching polynomials are irreducible over [Formula: see text]. Building on this, the construction method is extended to general graph polynomials, for graphs whose polynomials satisfy certain ...
Hou Shengzhe
doaj +1 more source
Some properties of generalized self-reciprocal polynomials over finite fields [PDF]
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4].
Ryul Kim, Ok-Hyon Song, Hyon-Chol Ri
doaj
Quantum alpha-determinants and q-deformed hypergeometric polynomials
The quantum $\alpha$-determinant is defined as a parametric deformation of the quantum determinant. We investigate the cyclic $\mathcal{U}_q(\mathfrak{sl}_2)$-submodules of the quantum matrix algebra $\mathcal{A}_q(\mathrm{Mat}_2)$ generated by the ...
Kimoto, Kazufumi
core +2 more sources
Enumeration of Linear Transformation Shift Registers
We consider the problem of counting the number of linear transformation shift registers (TSRs) of a given order over a finite field. We derive explicit formulae for the number of irreducible TSRs of order two.
Ram, Samrith
core +1 more source
Development and design of an FPGA-based encoder for NPN
This paper describes a cryptographic protection system hardware device designed to improve data encryption and decryption performance and preserve data integrity.
M.K. Ibraimov +4 more
doaj +1 more source
Irreducibility of multivariate polynomials
This paper deals with the problem of computing the degrees and multiplicities of the irreducible factors of a given multivariate polynomial. This includes the important question of testing for irreducibility. A probabilistic reduction from multivariate to bivariate polynomials is given, over an arbitrary (effectively computable) field.
openaire +1 more source
Irreducibility of extensions of Laguerre polynomials [PDF]
For integers $a_0,a_1,\ldots,a_n$ with $|a_0a_n|=1$ and either $α=u$ with $1\leq u \leq 50$ or $α=u+ \frac{1}{2}$ with $1 \leq u \leq 45$, we prove that $ψ_n^{(α)}(x;a_0,a_1,\cdots,a_n)$ is irreducible except for an explicit finite set of pairs $(u,n)$. Furthermore all the exceptions other than $n=2^{12},α=89/2$ are necessary.
Laishram, Shanta +2 more
openaire +3 more sources
Optimized potential of rCB via DOE: recovered carbon black from end‐of‐life tires was assessed as a full substitute for conventional carbon black in IIR composites. DOE and response surface methodology optimized rCB loading, plasticizer, and sulfur contents. Hardness showed linear trends, while rupture energy was nonlinear.
Vinícius Guedes Gobbi +3 more
wiley +1 more source

