Results 71 to 80 of about 343 (169)
Counting 5‐isogenies of elliptic curves over Q$\mathbb {Q}$
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract We show that the number of 5‐isogenies of elliptic curves defined over Q$\mathbb {Q}$ with naive height bounded by H>0$H > 0$ is asymptotic to C5·H1/6(logH)2$C_5\cdot H^{1/6} (\log H)^2$ for some explicitly computable constant C5>0$C_5 > 0$. This settles the asymptotic count of rational points on the genus zero modular curves X0(m)$\mathcal {X}
Santiago Arango‐Piñeros +3 more
wiley +1 more source
The quantale of Galois connections [PDF]
algebra universalis, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Evaluation and analysis of the computation cost of linear network coding
Tongxin xuebao, 2011 The complexity of algebraic operation methods on Galois fields was analyzed and the operation mechanism of linear network coding was anatomized.Based on deterministic network coding data transmission and random network coding data transmission for single-
PU Bao-xing1, WANG Wei-ping2
doaj +2 more sources
A characterization of adjunction in a many-valued modal system
CQD Revista Eletrônica Paulista de MatemáticaGalois connections are pairs of functions, defined over ordered sets, that preserve some particular aspects. They are studied in the context of algebraic structures.
Hércules de Araújo Feitosa +1 more
doaj +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
Ricerche di matematica con Giuseppina Varone
Science & Philosophy, 2013 In memory of the researcher Pina Varone, I present the research carried out together for over 20 years. Some relevant issues and applicants were: the connection between teaching and research, and as an in-depth teaching emerge new research topics; the ...
Antonio Maturo
doaj
Galois connections categorically
Journal of Pure and Applied Algebra, 1990 This is an expansion of a previous paper [Lect. Notes Comput. Sci. 239, 122-134 (1986; Zbl 0615.06002)]. It is a somewhat discursive discussion of Galois connections in (briefly) partially ordered sets, concrete categories, and categories. In concrete categories the authors consider only Galois connections commuting with the forgetful functors, which ...
Herrlich, H., Hušek, M.
openaire +2 more sources
A Galois Connection for Reduced Incidence Algebras [PDF]
Proceedings of the American Mathematical Society, 1974 If N = { 1 , ⋯
openaire +1 more source