Results 161 to 170 of about 128,731 (304)
ABSTRACT Despite extensive research suggesting the importance of students developing strong foundational math skills during early grades, more than 60% of 4th graders in the United States lack proficiency in mathematics. Such data are influenced by several factors, including summer learning loss in math, negative impacts from the COVID‐19 pandemic, and
Natasha K. Newson +5 more
wiley +1 more source
Tensor Analysis of Tropical Cyclone Boundary Layer Turbulence
Abstract Turbulent momentum transport critically influences tropical cyclone (TC) structure and intensity, but its multiscale characteristics remain poorly understood. Using two large eddy simulations, we investigate the Reynolds stress tensor and subfilter‐scale momentum flux tensor during rapid intensification and mature stages of an idealized TC. We
Shanghong Wang, Xu Zhang
wiley +1 more source
Ischemic stroke is a leading cause of death worldwide, yet clot lodging mechanics remain poorly understood. Most in silico studies assume a stress‐free clot, though both the clot and artery are likely in a pre‐stressed state at the point of thrombectomy procedures.
Jose L. Monclova +3 more
wiley +1 more source
Microhardness reached a maximum of 158.5 ± 3.9 HV at 4 wt.% Fe, with tensile strength peaking at 331.9 ± 9.9 MPa, whereas higher Fe addition (6 wt.%) caused microhardness and tensile strength to decline to 142.4 ± 4.8 HV and 294.7 ± 9.2 MPa, respectively, due to particle clustering and thermal softening.
Zahra Sakhaei +2 more
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs
ABSTRACT Let G be a graph in which each edge is assigned one of the colours 1 , 2 , … , m, and let Γ be a subgroup of S m. The operation of switching at a vertex x of G with respect to an element π of Γ permutes the colours of the edges incident with x according to π.
Richard Brewster +2 more
wiley +1 more source
Some Properties of the Nil-Graphs of Ideals of Commutative Rings
R. Nikandish, Farzad Shaveisi
openalex +2 more sources

