Results 31 to 40 of about 36,999 (191)
An Innovative Approach to Multi‐Valued Logic
The current generation of computer systems operates on the principles of binary logic, which encompasses both logical and arithmetic operations. However, silicon technology has reached its peak performance, prompting researchers to explore alternative methods for enhancing computational efficiency. One such method is the adoption of Multi‐Valued Logic (
Ali Mokhtari, Peyman Kabiri
wiley +1 more source
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
MODULAR SYSTOLIC DIGITAL SIGNAL PROCESSOR WITH RECONFIGURING THE STRUCTURE
Computational systolic model for orthogonal signal transformation in extended Galois GF(pv) fields based on polynomial system of residue classes is examined. Modular codes' ability to increase fault-tolerant characteristics is proven.
Igor Anatol’evich Kalmykov +3 more
doaj
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
Norm-Euclidean Galois fields [PDF]
Let K be a Galois number field of prime degree $\ell$. Heilbronn showed that for a given $\ell$ there are only finitely many such fields that are norm-Euclidean.
McGown, Kevin J.
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
When using a discrete Fourier transform (DFT) to solve digital signal processing (DSP) problems, errors occur in rounding or truncating the results of operations to the word length used by specialized processors (SP).
M. I. Kalmykov +3 more
doaj +1 more source
Hecke algebra isomorphisms and adelic points on algebraic groups [PDF]
Let $G$ denote a linear algebraic group over $\mathbf{Q}$ and $K$ and $L$ two number fields. Assume that there is a group isomorphism of points on $G$ over the finite adeles of $K$ and $L$, respectively.
Cornelissen, Gunther +1 more
core
Nonabelian Cohen-Lenstra Heuristics over Function Fields
Boston, Bush, and Hajir have developed heuristics, extending the Cohen-Lenstra heuristics, that conjecture the distribution of the Galois groups of the maximal unramified pro-p extensions of imaginary quadratic number fields for p an odd prime.
Boston, Nigel, Wood, Melanie Matchett
core +1 more source
Wild conductor exponents of curves
Abstract We give an explicit formula for wild conductor exponents of plane curves over Qp$\mathbb {Q}_p$ in terms of standard invariants of explicit extensions of Qp$\mathbb {Q}_p$, generalising a formula for hyperelliptic curves. To do so, we prove a general result relating the wild conductor exponent of a simply branched cover of the projective line ...
Harry Spencer
wiley +1 more source

