Results 151 to 160 of about 5,946 (233)

Large dynamic range Shack-Hartmann wavefront sensing based on a graph-theoretic computational model. [PDF]

open access: yesLight Sci Appl
Du L   +9 more
europepmc   +1 more source

How to see the forest despite the trees

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley   +1 more source

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs. [PDF]

open access: yesNat Commun
Zhang Y   +7 more
europepmc   +1 more source

Lower bounds for cube‐ideal set‐systems

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy