Results 61 to 70 of about 7,538,990 (210)
Design and implementation of distributed Galois [PDF]
, 2013 textThe Galois system provides a solution to the hard problem of parallelizing irregular algorithms using amorphous data-parallelism. The present system works on the shared-memory programming model. The programming model has limitations on the memory and
Dhanapal, Manoj
core
A BRB Algorithm for Non-Binary LDPC Decoding With Single-Symbol Extrinsic Information Modification
IEEE AccessIn the weighted bit-reliability based (wBRB) Non-binary LDPC decoding algorithm, using the minimum bit-reliability as the reliability of the entire symbol for information updating significantly decreases the decoding performance in cases of a large order
Xiangcheng Li +4 more
doaj +1 more source
The asymptotic Mahler measure of Gaussian periods
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen +2 more
wiley +1 more source
Computing Galois groups of Eisenstein polynomials over p-adic fields [PDF]
, 2017 The most efficient algorithms for computing Galois groups of polynomials over global fields are based on Stauduhar’s relative resolvent method. These methods are not directly generalizable to the local field case, since they require a field that contains
Milstead, Jonathan +1 more
core
Manin's conjecture for integral points on toric varieties
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract We formulate a conjecture on the number of integral points of bounded height on log Fano varieties in analogy with Manin's conjecture on the number of rational points of bounded height on Fano varieties. We also give a prediction for the leading constant that is similar to Peyre's interpretation of the leading constant in Manin's conjecture ...
Tim Santens
wiley +1 more source
A single source theorem for primitive points on curves
Forum of Mathematics, SigmaLet C be a curve defined over a number field K and write g for the genus of C and J for the Jacobian of C. Let $n \ge 2$ . We say that an algebraic point $P \in C(\overline {K})$ has degree n if the extension $K(P)/K$ has degree n. By
Maleeha Khawaja, Samir Siksek
doaj +1 more source
Computing Bonds Between Formal Contexts
Mathematical Methods in the Applied Sciences, Volume 49, Issue 11, Page 11661-11677, 30 July 2026.ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón +2 more
wiley +1 more source
On the Galoisian Structure of Heisenberg Indeterminacy Principle [PDF]
, 2013 We revisit Heisenberg indeterminacy principle in the light of the Galois-Grothendieck theory for the case of finite abelian Galois extensions. In this restricted framework, the Galois-Grothendieck duality between finite K-algebras split by a Galois ...
Catren, Gabriel, Page, Julien
core
We introduce and study a class of field extensions that we call pre-Galois; viz. extensions that become Galois after some linearly disjoint Galois base change L/k.
Harbater, David, Dèbes, Pierre
core +2 more sources
IEEE Access, 2020 The main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper.
Waheed Ullah +2 more
doaj +1 more source