Results 151 to 160 of about 1,801,897 (347)
Sequences of Primitive and Non-primitive BCH Codes
In this work, we introduce a method by which it is established that; how a sequence of non-primitive BCH codes can be obtained by a given primitive BCH code.
A. S. Ansari +3 more
doaj +1 more source
Certain Classes of Ideals in Polynomial Rings
The purpose of this paper is to establish some results, of a somewhat miscellaneous nature, concerning certain classes of ideals in polynomial rings. Although the results will be formulated for a ring
N. H. McCoy
core +1 more source
Prime ideals of skew polynomial rings and skew Laurent polynomial rings
Let \(S=R[X,X^{-1};\rho]\) be a skew Laurent polynomial ring over a ring \(R\) with automorphism \(\rho\). The authors characterize those prime ideals \(P\) of \(S\) with \(P\cap R=0\) in terms of irreducible polynomials over the centre of \(Q[X,X^{-1};\rho]\), where \(Q\) is the right Martindale quotient of \(R\) with respect to the filter of non-zero
Cisneros, Eduardo +2 more
openaire +4 more sources
Cornus mas L. seeds are transformed into a high‐performance biosorbent through chemical modification, effectively removing methylene blue from aqueous solutions. Comprehensive characterization and optimization reveal a maximum biosorption capacity of 71.71 mg g−1, establishing this sustainable, cost‐effective material as a promising solution for ...
Hakan Yıldız +2 more
wiley +1 more source
When is R[x] a principal ideal ring?
Because of its interesting applications in coding theory, cryptography, and algebraic combinatoris, in recent decades a lot of attention has been paid to the algebraic structure of the ring of polynomials R[x], where R is a finite commutative ring with ...
Henry Chimal-Dzul, C. A. López-Andrade
doaj +1 more source
Rings : An efficient Java/Scala library for polynomial rings
In this paper we briefly discuss Rings — an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gröbner bases are implemented with the use of modern asymptotically fast algorithms. Rings can be
Poslavsky, S (via Mendeley Data)
core +1 more source
Solving quadratic equations over polynomial rings of characteristic two [PDF]
We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation an tn + ··· + a0 = 0 with coefficients ai in A, our problem is to find its roots in A. We show that when A = B[x]
Wheland, Ethel +12 more
core +1 more source
Waterborne polyurethane/graphene formulations are developed as piezoresistive coatings on glass fabric to enable flexible strain sensing. The graphene‐enabled conductive network provides a stable electromechanical response under cyclic compression. The coating demonstrates reliable pressure‐dependent resistance changes, highlighting its potential for ...
Vishnu Vijayan Pillai +8 more
wiley +1 more source
The main goal of this article is to introduce the concept of EM−G− graded rings. This concept is an extension of the notion of EM− rings. Let G be a group, and R be a G− graded commutative ring.
Tariq Alraqad +2 more
doaj +1 more source
This study explores how machine learning models, trained on small experimental datasets obtained via Phase Doppler Anemometry (PDA), can accurately predict droplet size (D32) in ultrasonic spray coating (USSC). By capturing the influence of ink complexity (solvent, polymer, nanoparticles), power, and flow rate, the model enables precise droplet control
Pieter Verding +5 more
wiley +1 more source

