Results 141 to 150 of about 56,667 (302)
PARTIAL DIFFERENTIAL EQUATIONS FOR PRODUCTS OF TWO CLASSICAL ORTHOGONAL POLYNOMIALS [PDF]
, 2005 D.W. LEE
openalex +1 more source
Knowledge Spillover, Trust, Effort, and Error Exposure in Peer‐Assisted Learning
Topics 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
Discrete Entropies of Chebyshev Polynomials
MathematicsBecause of its flexibility and multiple meanings, the concept of information entropy in its continuous or discrete form has proven to be very relevant in numerous scientific branches. For example, it is used as a measure of disorder in thermodynamics, as
Răzvan-Cornel Sfetcu +2 more
doaj +1 more source
On rational classical orthogonal polynomials and their application for explicit computation of inverse Laplace transforms [PDF]
, 2005 Mohammad Masjed‐Jamei, Mehdi Dehghan
openalex +1 more source
Orthogonal Polynomials with Singularly Perturbed Freud Weights. [PDF]
Entropy (Basel), 2023 Min C, Wang L.
europepmc +1 more source
Thin hyperbolic reflection groups
Bulletin 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
Non-classical Orthogonality Relations for Continuous q-Jacobi Polynomials [PDF]
, 2011 Samuel G. Moreno +1 more
openalex +1 more source
Longest cycles in vertex‐transitive and highly connected graphs
Bulletin 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