Results 81 to 90 of about 1,299 (185)
A generalisation of the functional approach to compactness
, 2009 A topological space X is compact iff the projection π:X×Y→Y is closed for any space Y. Taking this as a definition and then asking that π maps α-closed subspaces of X×Y onto β-closed subspaces of Y, for different closures α and β, extends the notion of ...
David Holgate, Holgate, David
core +1 more source
Tate modules as condensed modules
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We prove that the category of countable Tate modules over an arbitrary discrete ring embeds fully faithfully into that of condensed modules. If the base ring is of finite type, we characterize the essential image as generated by the free module of infinite countable rank under direct sums, duals and retracts.
Valerio Melani +2 more
wiley +1 more source
Sections and projections of the outer and inner regularizations of a convex body
Mathematika, Volume 72, Issue 3, July 2026.Abstract We establish new geometric inequalities comparing the volumes of sections and projections of a convex body, whose barycenter or Santaló point is at the origin, with those of its inner and outer regularizations. We also provide functional extensions of these inequalities to the setting of log‐concave functions. Our approach relies on the recent
Natalia Tziotziou
wiley +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
Topology, intersections and flat modules
, 2016 It is well known that, in general, multiplication by an ideal I does not commute with the intersection of a family of ideals, but that this fact holds if I is flat and the family is finite.
Finocchiaro, Carmelo A., Spirito, Dario
core +1 more source
Progress of metabolomics‐centric multi‐omics research in medicine
iMetaOmics, Volume 3, Issue 2, June 2026.The graphical abstract illustrates a holistic roadmap for metabolomics‐centric multi‐omics integration in medical research. The upper panel depicts the technological transition from traditional bulk analysis to high‐resolution single‐cell and spatial methodologies, specifically addressing inherent challenges such as molecular complexity and dynamic ...
Ziyi Wang +6 more
wiley +1 more source
Spaces of continuous functions, $\Sigma$-products and Box Topology
, 2006 summary:For a Tychonoff space $X$, we will denote by $X_0$ the set of its isolated points and $X_{1}$ will be equal to $X\setminus X_{0}$. The symbol $C(X)$ denotes the space of real-valued continuous functions defined on $X$.
Tamariz-Mascarúa, Á., Angoa, J.
core
Deep Learning Unlocks Behavioral Prediction and Neurobehavioral Decoding
Med Research, Volume 2, Issue 2, Page 371-387, June 2026.This review evaluates deep learning frameworks that surmount conventional limitations through high‐dimensional nonlinear modeling, spatiotemporal dependency capture, and multimodal information integration. Focusing on biological behavior forecasting and neural mechanism decoding, we delineate cutting‐edge applications, including real‐time action ...
Tianzhe Han +5 more
wiley +1 more source
The feasibility principle in community ecology
Oikos, Volume 2026, Issue 6, June 2026.The structure and function of ecological communities emerge from interactions among populations within specific environmental contexts. Yet we still lack general principles that explain how communities assemble, which patterns we should expect, and when transitions occur across diverse settings.
Serguei Saavedra
wiley +1 more source
Subspace properties of randomized network coding [PDF]
Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries.
Diggavi, Suhas +2 more
core +1 more source