Results 61 to 70 of about 113,121 (99)
Abstract Rising global and local inequalities make prejudice based on social class an increasingly pressing issue, yet it remains underexplored in psychological literature. Across three studies run in Poland, we apply the Dual‐Process Model of Ideology and Prejudice and find that Social Dominance Orientation (SDO)—a preference for social hierarchy ...
Maciej R. Górski +2 more
wiley +1 more source
An experimental evidence on the validity of third Smarandache conjecture on primes [PDF]
In this note v.e report the results regarding ,he check of the third Smarandache conjecture on ...
Russo, Felice
core +1 more source
ABSTRACT The relation between sleep and irritable affect has been studied extensively. However, whether this relation is bidirectional remains unclear. Furthermore, less is still known about associations between sleep and interpersonal behaviors and perceptions during social interactions. The current study examined bidirectional within‐person relations
Teus Mijnster +6 more
wiley +1 more source
Abstract Chronic illness represents a transition for both patients and their family members although transitions and information behavior changes have largely been explored from an individual perspective. Illness‐related transitions may be undertaken individually or collectively, but little is known about how family information networks change in the ...
Lindsay K. Brown, Tiffany C. Veinot
wiley +1 more source
A new bound for Vizing's conjecture
For any graph $G$, we define the power $π(G)$ as the minimum of the largest number of neighbors in a $γ$-set of $G$, of any vertex, taken over all $γ$-sets of $G$. We show that $γ(G\square H)\geq \frac{π(G)}{2π(G) -1}γ(G)γ(H)$. Our methods allow us to prove the following statements for any graphs $G$ and $H$, (1) $γ(G\square H)\geq \frac{\lceil \frac{γ(
Krop, Elliot, Wolff, Kimber
openaire +2 more sources
Nearly Hamilton cycles in sublinear expanders and applications
Abstract We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due to their potential for various applications to embedding problems in sparse graphs.
Shoham Letzter +2 more
wiley +1 more source
Quantum SU(2) and the Baum-Connes conjecture [PDF]
We review the formulation and proof of the Baum-Connes conjecture for the dual of the quantum group $ SU_q(2) $ of Woronowicz. As an illustration of this result we determine the $ K $-groups of quantum automorphism groups of simple matrix ...
Voigt, Christian
core +1 more source
On Oliver's p-group conjecture : : II. [PDF]
Let $p$ be an odd prime and $S$ a finite $p$-group. B.~Oliver's conjecture arises from an open problem in the theory of $p$-local finite groups and says that a certain characteristic subgroup $\mathfrak{X}(S)$ of $S$ always contains the Thompson subgroup.
Héthelyi, László +2 more
core +4 more sources
Resolving Edge Colorings: Exact Results and a Tabu Search Heuristic
This study presents new results on resolving edge colorings in graphs, a concept introduced by V. Saenpholphat and P. Zhang in 2003. We determine the resolving edge chromatic number for several well‐known families of graphs, including complete graphs, complete bipartite graphs, wheel graphs, sun graphs, and friendship graphs.
Narjes Sabeghi +4 more
wiley +1 more source
ABSTRACT Recent research has called into question the robustness and reliability of using body movements to activate motivational systems like approach‐reward. The purpose of the current studies was to test the effect of a repeated flexion movement task on approach‐reward system activation, positive and negative affect, and persistence on a difficult ...
Marissa R. Vander Missen +8 more
wiley +1 more source

