Surface subgroups for cocompact lattices of isometries of H2n$\mathbb {H}^{2n}$
Journal of Topology, Volume 19, Issue 3, September 2026.Abstract We prove the existence of surface subgroups within any cocompact lattice Γ$\Gamma$ in SO(2n,1)$\mathrm{SO}(2n,1)$ for n⩾2$n\geqslant 2$. This result addresses the cases missing from the work of Hamenstädt in 2015, who constructed surface subgroups in cocompact lattices for all other rank‐1 simple Lie groups of noncompact type.
Jeremy Kahn, Zhenghao Rao
wiley +1 more source
scBiG for representation learning of single-cell gene expression data based on bipartite graph embedding. [PDF]
NAR Genom BioinformLi T, Qian K, Wang X, Li WV, Li H.
europepmc +1 more source
Novel link prediction for large-scale miRNA-lncRNA interaction network in a bipartite graph. [PDF]
BMC Med Genomics, 2018 Huang ZA +4 more
europepmc +1 more source
In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro
Advanced Intelligent Systems, Volume 8, Issue 8, August 2026.This article reported a continuous‐time (CT) Boolean satisfiability (SAT) problem solver using bidirectional 11T‐SRAM macro. The proposed system operates asynchronously using capacitor‐based gradient integration and maximizes the parallelism for SAT solving by in‐memory computing (IMC).
Dongseok Kwon +3 more
wiley +1 more source
BiGATAE: a bipartite graph attention auto-encoder enhancing spatial domain identification from single-slice to multi-slices. [PDF]
Brief BioinformTao Y, Sun X, Wang F.
europepmc +1 more source
Measurement and simulation of the relatively competitive advantages and weaknesses between economies based on bipartite graph theory. [PDF]
PLoS One, 2018 Guan J, Xu X, Wu S, Xing L.
europepmc +1 more source
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley +1 more source
Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle-Infrastructure Systems. [PDF]
Sensors (Basel), 2017 Tang X, Hong D, Chen W.
europepmc +1 more source
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, Volume 112, Issue 4, Page 433-437, August 2026.ABSTRACT A graph G is m‐minor‐universal if every graph H with at most m edges and no isolated vertices is contained as a minor in G. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c > 0 such that the d‐dimensional hypercube Q d is ( c ⋅ 2 d / d)‐minor‐universal, while there is an absolute constant K > 0 such that Q d ...
Emma Hogan +5 more
wiley +1 more source
Long Induced Paths in K s , s‐Free Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 438-441, August 2026.ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s‐free graph containing an n‐vertex path must contain an induced path of length f ( n ), where f ( n ) → ∞ as n → ∞. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 / 5 − o ( 1 ).
Zach Hunter +3 more
wiley +1 more source