Results 21 to 30 of about 112 (95)
How to see the forest despite the trees
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
An EZ${\mathcal {E}\mathcal {Z}}$‐structure for the mapping class group
Abstract We construct a boundary for the mapping class group Mod(S)${\rm Mod}(S)$ of a surface S$S$ of finite type. The action of Mod(S)${\rm Mod}(S)$ on this boundary is minimal, strongly proximal and topologically free. The boundary is the boundary of an EZ${\mathcal {E}\mathcal {Z}}$‐structure for Mod(S)${\rm Mod}(S)$.
Ursula Hamenstädt
wiley +1 more source
ABSTRACT The critical micelle concentration (CMC) values of the cationic gemini surfactant pentadiyl‐α,ω‐bis(dimethyldodecylammonium) bromide depend on the hydrophobicity of added conjugated organic carboxylate anions. Nine conjugated counterions, present as sodium salts of organic acids, were studied to expand the correlation to the counterion ...
Alexia Rios +4 more
wiley +1 more source
ABSTRACT Background TeleCHAT is the Comprehensive High‐dose Aphasia Treatment program delivered via telerehabilitation. TeleCHAT is a complex intervention, with delivery challenges arising from its comprehensive scope and individualised therapeutic and technological requirements. Thus, training for speech‐language pathologists (SLPs) in the delivery of
Shu En Lee +3 more
wiley +1 more source
Phylogeographical studies of Amazonian birds have revealed large intraspecific diversity, even within recognized areas of endemism. To understand the origin and organization of Amazonian diversity, including the influence of current and historical landscapes, we need to evaluate fine‐scale patterns of genetic diversity in relation to detailed ...
Affonso Henrique Nascimento de Souza +4 more
wiley +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
Privacy as a Defense Against Premature Representation
Journal of Social Philosophy, EarlyView.
Jordan Wallace‐Wolf
wiley +1 more source
Optimized protocol to generate genome-wide inactivated Cas9-expressing murine T cells. [PDF]
Laprie-Sentenac M +2 more
europepmc +1 more source
Macroscopic Properties and Pore Structure Fractal Characteristics of Alkali-Activated Metakaolin-Slag Composite Cementitious Materials. [PDF]
Zhan J, Fu B, Cheng Z.
europepmc +1 more source
Adam Smith and market urbanism
Economic Affairs, Volume 46, Issue 2, Page 357-363, June 2026.
Eugenio Gerardo Garza Garza
wiley +1 more source

