Results 291 to 300 of about 972,343 (359)

Knowledge Spillover, Trust, Effort, and Error Exposure in Peer‐Assisted Learning

open access: yesTopics in Cognitive Science, EarlyView.
Abstract Peer‐assisted learning has the potential to improve learning in academic settings and beyond. However, the cognitive and motivational mechanisms of learning through interaction with other learners are not fully understood. Here, we present an empirical study in which we compare a peer‐assisted learning condition with two individual learning ...
Ion Juvina   +5 more
wiley   +1 more source

Thin hyperbolic reflection groups

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract We study a family of Zariski dense finitely generated discrete subgroups of Isom(Hd)$\mathrm{Isom}(\mathbb {H}^d)$, d⩾2$d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an application, we obtain a general description of all thin hyperbolic reflection groups.
Nikolay Bogachev, Alexander Kolpakov
wiley   +1 more source

A finite‐dimensional counterexample for Arveson's hyperrigidity conjecture

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract We construct an operator system generated by four operators that is not hyperrigid, although all restrictions of irreducible representations have the unique extension property.
Marcel Scherer
wiley   +1 more source

Lagrangian Relations and Quantum L ∞ Algebras. [PDF]

open access: yesCommun Math Phys
Jurčo B, Pulmann J, Zika M.
europepmc   +1 more source

Quasi‐projective varieties are Grassmannians for fully exact subcategories of quiver representations

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract Reineke and independent other authors proved that every projective variety arises as a quiver Grassmannian. We prove the claim in the title by restricting Reineke's isomorphism to Grassmannians for a fully exact subcategory.
Alexander Pütz, Julia Sauter
wiley   +1 more source

Longest cycles in vertex‐transitive and highly connected graphs

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy