Results 71 to 80 of about 94,460 (146)
Irreducible skew polynomials over domains
Let S be a domain and R = S[t; σ, δ] a skew polynomial ring, where σ is an injective endomorphism of S and δ a left σ -derivation. We give criteria for skew polynomials f ∈ R of degree less or equal to four to be irreducible.
Brown C., Pumplün S.
doaj +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
The GCD property and irreduciable quadratic polynomials
The proof of the following theorem is presented: If D is, respectively, a Krull domain, a Dedekind domain, or a Prüfer domain, then D is correspondingly a UFD, a PID, or a Bezout domain if and only if every irreducible quadratic polynomial in D[X] is a ...
Saroj Malik +2 more
doaj +1 more source
Negacyclic Codes of Length
Let $F_{q}$ be a finite field of odd order $q$ . Let $m$ be a positive integer such that $X^{2^{m}}+1$ factors completely into degree-one factors in $F_{q^{2}}[X]$ . The polynomial generators of all negacyclic codes of length $2^{m}p^{n}$ over
Jing Huang
doaj +1 more source
Coulomb branch algebras via symplectic cohomology
Abstract Let (M¯,ω)$(\bar{M}, \omega)$ be a compact symplectic manifold with convex boundary and c1(TM¯)=0$c_1(T\bar{M})=0$. Suppose that (M¯,ω)$(\bar{M}, \omega)$ is equipped with a convex Hamiltonian G$G$‐action for some connected, compact Lie group G$G$.
Eduardo González +2 more
wiley +1 more source
On irreducible polynomial remainder codes [PDF]
A general class of polynomial remainder codes is considered. These codes are very flexible in rate and length and include Reed-Solomon codes as a special case. In general, the code symbols of such codes are polynomials of different degree, which leads to two different notions of weights and of distances.
Jiun-Hung Yu, Hans-Andrea Loeliger
openaire +1 more source
Euler‐Top Gaussian Modes: Structured Beams From Quadratic Angular Momentum Dynamics
A new family of structured Gaussian light beams are introduced: Euler‐top Gaussian modes. Their ray‐orbital paths on the Gaussian Poincaré sphere correspond to the polhodes of the Euler top in classical angular momentum theory. This geometric and algebraic construction reveals a nonseparable mode family extending the familiar Hermite‐, Laguerre‐ and ...
Mark R. Dennis, Kerr Maxwell
wiley +1 more source
Irreducibility of random polynomials of bounded degree
Irreducibility of random polynomials of bounded degree, Discrete Analysis 2021:7, 16 pp. This paper contributes to a substantial literature on the subject of random polynomials and their behaviour, considerably generalizing known results that show that ...
Huy Tuan Pham, Max Wenqiang Xu
doaj +1 more source
Prime Numbers and Irreducible Polynomials [PDF]
(2002). Prime Numbers and Irreducible Polynomials. The American Mathematical Monthly: Vol. 109, No. 5, pp. 452-458.
openaire +2 more sources
Commercial finite element method solvers are distilled into a practical workflow for nanoparticle‐on‐mirror cavity simulations. Geometry construction, perfectly matched layer settings, adaptive meshing, convergence tests, mode identification, and spectral matching to single‐particle dark‐field data are integrated into a reproducible route that links ...
Jaewon Lee +3 more
wiley +1 more source

