Results 81 to 90 of about 888,944 (169)
On p-Adic Estimates of Weights in Abelian Codes over Galois Rings [PDF]
, 2005 Let p be a prime. We prove various analogues and generalizations of McEliece's theorem on the p-divisibility of weights of words in cyclic codes over a finite field of characteristic p. Here we consider Abelian codes over various Galois rings.
Katz, Daniel Jerome
core +1 more source
ComputersIrreducible 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
Galois connecting call-by-value and call-by-name [PDF]
Logical Methods in Computer ScienceWe establish a general framework for reasoning about the relationship between call-by-value and call-by-name. In languages with computational effects, call-by-value and call-by-name executions of programs often have different, but related, observable ...
Dylan McDermott, Alan Mycroft
doaj +1 more source
On the Lang–Trotter conjecture for Siegel modular forms
Mathematika, Volume 72, Issue 3, July 2026.Abstract Let f$f$ be a genus‐two cuspidal Siegel eigenform. We prove an adelic open image theorem for the compatible system of Galois representations associated with f$f$, generalizing the results of Ribet and Momose for elliptic modular forms. Using this result, we investigate the distribution of the Hecke eigenvalues ap$a_p$ of f$f$, and obtain upper
Arvind Kumar, Moni Kumari, Ariel Weiss
wiley +1 more source
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 Galois connection between distance functions and inequality relations [PDF]
, 1974 summary:Following the ideas of R. DeMarr, we establish a Galois connection between distance functions on a set $S$ and inequality relations on $X_{S}=S \times \mathbb{R}$.
Száz, Árpád +2 more
core +1 more source
A Constructive Framework for Galois Connections
CoRR, 2017 Abstract interpretation-based static analyses rely on abstract domains of program properties, such as intervals or congruences for integer variables. Galois connections (GCs) between posets provide the most widespread and useful formal tool for mathematically specifying abstract domains.
openaire +2 more sources
Prismatic F‐crystals and Wach modules
Proceedings of the London Mathematical Society, Volume 133, Issue 1, July 2026.Abstract We show that the category of analytic/completed prismatic F-crystals$F\text{-crystals}$ on the absolute prismatic site of a small (unramified at p$p$) base ring is naturally equivalent to the category of relative Wach modules from the theory of (φ,Γ)-modules$(\varphi, \Gamma)\text{-modules}$.
Abhinandan
wiley +1 more source
A Galois connection for weighted (relational) clones of infinite size [PDF]
, 2015 A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs).
Zivny, S +3 more
core +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.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