Results 151 to 160 of about 2,876,957 (249)
Optimising daily sampling of plant–bee interaction networks
Journal of Animal Ecology, Volume 95, Issue 10, Page 1903-1918, October 2026.Daily variation in ecological interaction networks is rarely quantified due to limited temporal sampling, yet network structure may change substantially within a single day. We show that plant–bee networks exhibit strong intraday shifts in composition and structure, and that sampling distributed across key daily periods better captures network ...
Caio S. Ballarin +6 more
wiley +1 more source
The R203W substitution drives PACS‐1 syndrome by disrupting intramolecular regulation
The FEBS Journal, Volume 293, Issue 19, Page 5717-5734, October 2026.The middle region (MR) of PACS‐1 controls engagement with specific partner proteins. This manuscript presents the structure of the Furin binding region (FBR) and how interactions with partners are regulated through the interplay between a basic patch in the FBR and an acidic cluster in the MR.
Troy C. Krzysiak +7 more
wiley +1 more source
New discretised polynomial expander and incidence estimates
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We present two applications of recent developments in incidence geometry. One is a δ$\delta$‐discretised version of a particular ‘Elekes–Rónyai’ expander problem. The second is an incidence estimate addressing the scenario in which both tubes, squares and their shadings satisfy non‐concentration assumptions.
Ciprian Demeter, William O'Regan
wiley +1 more source
A tropical version of Martens' theorem for metric graphs
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We study the conjecture stated by Jensen and Len on a tropical version on Martens' theorem via the Brill–Noether rank of a tropical curve. We recall Coppens' counterexample of Martens‐special chain of cycles, and we generalize the construction defining another class of graphs, Martens‐special trees of cycles, for which the conjecture does not ...
Giusi Capobianco, Angelina Zheng
wiley +1 more source
Using MR-chordless circuits for efficient enumeration of autocatalytic cores in large chemical reaction networks. [PDF]
J CheminformGolnik R +4 more
europepmc +1 more source
No‐(k+1)$(k+1)$‐in‐line problem for large constant k$k$
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract How many points can be placed in an n×n$n\times n$ grid so that every (affine) line contains at most k$k$ points? We prove that for n⩾k⩾1037$n \geqslant k \geqslant 10^{37}$ the maximum number of points is exactly kn$kn$. Our proof builds on the recent work of Kovács, Nagy and Szabó (who proved an analogous result when k$k$ is at least about ...
Alexandr Grebennikov, Matthew Kwan
wiley +1 more source
The Picard Group of a complete bipartite graph
, 2016 The Picard Group of a finite connected graph is a finite abelian group of order equal to the number of spanning trees of the graph. The Picard Group can be defined in a several different ways, which we consider in this paper.
Kalustova, Inna
core +1 more source
A unified framework for molecular property prediction based on hierarchical multi-granularity molecular representation learning. [PDF]
BioinformaticsZhao X, Chen X, Wang Y, An Y, Zhao H.
europepmc +1 more source
Matchings: Source, goal, and faithful companion
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract Matchings were among the earliest motivations for graph theory. They subsequently remained a central goal, inspiring the development of new mathematical tools that went well beyond problems directly concerning matchings. These tools proved widely applicable, accompanying the growth of graph theory over the past century.
András Sebő
wiley +1 more source
List 3-coloring on comb-convex and caterpillar-convex bipartite graphs. [PDF]
J Comb OptimŞen BB, Erlebach T, Yaşar Ö.
europepmc +1 more source