Results 121 to 130 of about 1,222,002 (199)

Why is it easier to predict the epidemic curve than to reconstruct the underlying contact network? [PDF]

J Math Biol
Keliger D, Horváth I.
europepmc   +1 more source

Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley   +1 more source

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]

J Chem Theory Comput
Golnik R, Gatter T, Stadler PF, Vassena N.   +3 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

Quantifying distribution shifts in single-cell data with scXMatch. [PDF]

Bioinformatics
Möller A, Schnitzerlein M, Greto E, Zaburdaev V, Uderhardt S, Blumenthal DB.   +5 more
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

Mendelianization: Concentrating Polygenic Signal Into a Single Causal Locus. [PDF]

Genet Epidemiol
Strobl EV.
europepmc   +1 more source

Universal properties of Delannoy categories

Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.
Abstract Recently, Harman and Snowden introduced a new symmetric tensor category Perm̲(G,μ)$\operatorname{\underline{Perm}}(G, \mu)$ associated with an oligomorphic group G$G$ with a measure μ$\mu$. When G$G$ is the group of order‐preserving self‐bijections of the real line there are four such measures, and the resulting tensor categories are called ...
Kevin Coulembier, Nate Harman, Andrew Snowden   +2 more
wiley   +1 more source

A new approach to the envelope theorem [PDF]

We study the di¤erentiability of the value function of a constrained optimization problem. We consider the envelope-theorem framework of Milgrom and Segal (2002), and we accomplish two goals.
Francesco Ruscitti
core  

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc   +1 more source