Results 31 to 40 of about 90,514 (193)

Groups with only two nonlinear non-faithful irreducible characters [PDF]

open access: yes, 2019
summary:We determine the groups with exactly two nonlinear non-faithful irreducible characters whose kernels intersect ...
Lewis, Mark L., Chen, Xiaoyou
core   +1 more source

Path Degeneracy and Applications

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In this work, we relate girth and path‐degeneracy in classes with sub‐exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor‐closed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of g $g$‐cages is verified). As an application,
Yuquan Lin, Patrice Ossona de Mendez
wiley   +1 more source

Irreducible components of module varieties: an example [PDF]

open access: yes, 2011
We determine the irreducible components of the variety of d-dimensional modules over the algebra k〈α,β〉/〈α2,β2,βα+qαβ〉 with q∈k⁎, for any d, and we describe any intersection of irreducible components as the zero set of some ideal.
Rutscho, M.   +6 more
core   +1 more source

Liberation Through Narration: A Novel Humanistic Framework to Address Body Dissatisfaction

open access: yesThe Journal of Humanistic Counseling, EarlyView.
ABSTRACT Though body dissatisfaction is nuanced and pervasive, the magnitude of body dissatisfaction is undercut by essentialist conceptualizations of the body and medicalized metrics of wellness tied to disordered eating. Hence, there is a need for a contextualized and sustaining framework to address and promote healing from body dissatisfaction ...
Kim Hughes, Amber L. Pope
wiley   +1 more source

"Constellation Coloring Pages" adapted from Johann Bode, "Uranographia" (1801) [PDF]

open access: yes, 2016
Johann Bode, director of the Observatory of the Berlin Academy of Sciences, produced the last of the four major celestial atlases in which artful depictions of constellation figures appear alongside the most up-to-date scientific data.

core  

A Branch-and-Price Approach for Graph Multi-Coloring

open access: yes, 2018
We present a branch-and-price framework for solving the graph multicoloring problem. We propose column generation to implicitly optimize the linear programming relaxation of an independent set formulation (where there is one variable for each independent
Anuj Mehrotra (5455697)   +1 more
core   +1 more source

Glocal Regenerative Viticulture: Exploring Sustainable Winemaking Strategies in Europe

open access: yesSustainable Development, EarlyView.
ABSTRACT The global wine industry is transforming due to climate change challenges. Glocalization is increasingly relevant in winemaking, where geographical and cultural diversity requires context‐specific solutions in the existing sustainability spectrum in viticulture.
Aleksandra N. Volkova   +4 more
wiley   +1 more source

‘Sustainable Development’ or ‘Development Sustainability’? A Corpus Linguistic Analysis of Hong Kong Legislative Discourse (2016–2021)

open access: yesSustainable Development, EarlyView.
ABSTRACT Grounded in the Sustainable Development Goals (SDGs) framework, I examined sustainability discourse in the Hong Kong Legislative Council (LegCo) Hansards. Using LancsBox X, I employed collocational and concordance analyses to investigate a 15.7‐million‐word Hansard corpus.
Emmanuel Mensah Bonsu
wiley   +1 more source

Visionary, engineer, and experimenter: Three forms of entrepreneurship in the quest for product–market fit

open access: yesStrategic Entrepreneurship Journal, EarlyView.
Abstract Research summary Entrepreneurship unfolds under uncertainty, which complicates entrepreneurs' efforts to align idea, action, and environment to reach product–market fit. To illuminate how entrepreneurs perform such alignment, we complement the theory‐based view and its focus on cognitive uncertainty with a discussion of behavioral uncertainty.
Thomas Zellweger, Djordje Djokovic
wiley   +1 more source

Coloring fuzzy graphs

open access: yes, 2005
Given a graph G = (V, E), a coloring function C assigns an integer value C(i) to each node i epsilon V in such a way that the extremes of any edge {i,j} epsilon E cannot share the same color, i.e., C(i) epsilon C(j). Two different approaches to the graph
Yáñez Gestoso, Francisco Javier   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy