Results 31 to 40 of about 304 (134)

Quasi‐convex surface subgroups in some one‐relator groups with torsion

Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We find surface subgroups in certain one‐relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Andrew Ng
wiley   +1 more source

An elegant model of the geodesic flow on the modular surface

Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley   +1 more source

Antitone Galois Connections and Formal Concepts [PDF]

International Journal of Fuzzy Logic and Intelligent Systems, 2010
In this paper, we investigate the properties of antitone Galois connection and formal concepts. Moreover, we show that order reverse generating maps induce formal, attribute oriented and object oriented concepts on a complete residuated lattice.
Jung Mi Ko, Yong Chan Kim
openaire   +1 more source

Abelian threefolds with imaginary multiplication

Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Let A$A$ be an abelian threefold defined over a number field K$K$ with potential multiplication by an imaginary quadratic field M$M$. Under mild assumptions on K$K$, if A$A$ has signature (2,1) and the multiplication by M$M$ is defined over KM$KM$, we attach to A$A$ an elliptic curve defined over K$K$ with potential complex multiplication by M$
Francesc Fité, Pip Goodman
wiley   +1 more source

Logics from Galois connections

International Journal of Approximate Reasoning, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jouni Järvinen, Michiro Kondo, Jari Kortelainen   +2 more
openaire   +2 more sources

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

Galois Connections in Categorial Type Logic

Electronic Notes in Theoretical Computer Science, 2004
AbstractThe introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are order-preserving; in this paper instead, we consider the addition of order-reversing, Galois connected operators. In §2 we do the basic model-theoretic and proof-theoretic groundwork.
Carlos Areces, Raffaella Bernardi, Michael Moortgat   +2 more
openaire   +8 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

Galois Connections: Mathematics, Art, and Archives [PDF]

Electronic Workshops in Computing, 2015
Evariste Galois (1811--1832) has been increasingly recognised as an important mathematician who despite his short life developed mathematical ideas that today have applications in computer science (such as Galois connections) and elsewhere. Some of Galois' mathematics can be visualised in interesting and even artistic ways, aided using software.
Jonathan P. Bowen, Tula Giannini
openaire   +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, Emil Karlsson, Simin Nadjm‐Tehrani   +2 more
wiley   +1 more source