Results 71 to 80 of about 68,753 (202)
On the additive image of zeroth persistent homology
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Irreducible polynomials are widely used in modern cryptography; however, algorithms for finding such polynomials remain quite complex and require significant computational resources.
Dina Shaltykova +3 more
doaj +1 more source
Survey on counting special types of polynomials [PDF]
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly.
Gathen, Joachim von zur +1 more
core
Rational points on even‐dimensional Fermat cubics
Abstract We show that even‐dimensional Fermat cubic hypersurfaces are rational over any field of characteristic not equal to three, by constructing explicit rational parameterizations with polynomials of low degree. As a byproduct of our rationality constructions, we obtain estimates for the number of their rational points over a number field and ...
Alex Massarenti
wiley +1 more source
Abstract This article demonstrates the integration of in‐line mass spectrometry as a process analytical technology (PAT) tool with model‐based soft sensors in a continuous filtration‐drying carousel system for solid–liquid separation (SLS) of crystal slurries.
Inyoung Hur +3 more
wiley +1 more source
On fundamental groups of plane curve complements
In this paper we discuss some properties of fundamental groups and Alexander polynomials of plane curves. We discuss the relationship of the non-triviality of Alexander polynomials and the notion of (nearly) freeness for irreducible plane curves.
Bartolo, Enrique Artal, Dimca, Alexandru
core +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
Irreducibility of generalized Hermite-Laguerre Polynomials III
For a positive integer $n$ and a real number $\alpha$, the generalized Laguerre polynomials are defined by \begin{align*} L^{(\alpha)}_n(x)=\sum^n_{j=0}\frac{(n+\alpha)(n-1+\alpha)\cdots (j+1+\alpha)(-x)^j}{j!(n-j)!}.
Laishram, Shanta, Shorey, Tarlok
core +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
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

