Results 11 to 20 of about 406,000 (79)
Constructive Galois connections: taming the Galois connection framework for mechanized metatheory [PDF]
ACM SIGPLAN International Conference on Functional Programming, 2015 Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation.
David Darais, David Van Horn
semanticscholar +1 more source
Advanced Engineering Research, 2017 Introduction . One of the tasks arising in cryptography is to ensure the safe and honest conduct of e-voting. This procedure provides that voters submit their votes electronically - for example, through electronic terminals.
Larisa V. Cherkesova +3 more
doaj +1 more source
The Projective Character Tables of a Solvable Group 26:6×2
International Journal of Mathematics and Mathematical Sciences, 2019 The Chevalley–Dickson simple group G24 of Lie type G2 over the Galois field GF4 and of order 251596800=212.33.52.7.13 has a class of maximal subgroups of the form 24+6:A5×3, where 24+6 is a special 2-group with center Z24+6=24. Since 24 is normal in 24+6:
Abraham Love Prins
doaj +1 more source
Arithmetic gauge theory: A brief introduction [PDF]
Modern Physics Letters A, 2017 Much of arithmetic geometry is concerned with the study of principal bundles. They occur prominently in the arithmetic of elliptic curves and, more recently, in the study of the Diophantine geometry of curves of higher genus.
Minhyong Kim
semanticscholar +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, EarlyView.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
A Vulnerability Lens for Intuitive‐Logic Scenarios
FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley +1 more source
Bridging 4D QFTs and 2D VOAs via 3D high-temperature EFTs
Journal of High Energy PhysicsThe high-temperature limit of the superconformal index, especially on higher sheets, often captures useful universal information about a theory. In 4d N = 2 $$ \mathcal{N}=2 $$ superconformal field theories with fractional r-charges, there exists a ...
Arash Arabi Ardehali +3 more
doaj +1 more source
An effective method to study the Hopf-Galois module structure of certain extensions of fields
We develop a method to compute a basis of the associated order in a Hopf Galois structure H of the ring of integers O_L of an extension of number or p-adic fields L/K.
Daniel Gil Muñoz
semanticscholar +1 more source
Attribute Implication Bases From Galois Connection Structures
Mathematical Methods in the Applied Sciences, Volume 49, Issue 4, Page 2729-2753, 15 March 2026.ABSTRACT Modeling knowledge systems by determining relationships among key variables have been and currently is a fundamental and nontrivial challenge in real‐world scenarios. Many approaches have been developed to reach this goal, but many of them are heuristic and require of alternative procedures to provide robust and tractable rules.
M. Eugenia Cornejo +2 more
wiley +1 more source
Simplification of exponential factors of irregular connections on P1${\mathbb {P}}^1$
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract We give an explicit algorithm to reduce the ramification order of any exponential factor of an irregular connection on P1$\mathbb {P}^1$, using the same types of basic operations as in the Katz–Deligne–Arinkin algorithm for rigid irregular connections.
Jean Douçot
wiley +1 more source