Results 91 to 100 of about 10,924,025 (294)

Invisible but not inaccessible—Revealing transient oligomers formed by intrinsically disordered proteins with solution NMR and complementary methods

open access: yesFEBS Letters, EarlyView.
Transient oligomers formed by intrinsically disordered proteins may be ‘invisible’ to direct detection yet remain accessible to solution NMR through equilibrium‐exchange measurements and pressure‐jump experiments. Complementary methods report on mass, stoichiometry, selected distance distributions, morphology, and internal packing.
Martin D. Gelenter, Ad Bax
wiley   +1 more source

Prime order derangements in primitive permutation groups

open access: yes, 2011
Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|.
Giudici, M.   +8 more
core   +1 more source

Constructing finitely presented simple groups that contain Grigorchuk groups [PDF]

open access: yes, 1999
We construct infinite finitely presented simple groups that have subgroups isomorphic to Grigorchuk groups. We also prove that up to one possible exception all previously known finitely presented simple groups are torsion locally ...
Röver, Claas E.
core   +1 more source

Going viral − Virus‐targeting nanobodies for research, diagnostics and therapy

open access: yesFEBS Letters, EarlyView.
The increasing prevalence of viral diseases represents a major threat for global human health. Nanobodies, small binding fragments derived from camelid heavy‐chain antibodies, offer versatile tools for viral research, diagnostics, and antiviral therapy.
Domenic Ebert, Ulrich Rothbauer
wiley   +1 more source

Simple groups contain minimal simple groups

open access: yes, 2021
It is a consequence of the classification of finite simple groups that every non-abelian simple group contains a subgroup which is a minimal simple ...
Ward, M. B., Barry, M. J. J.
core  

Symmetric Presentations of Coxeter Groups [PDF]

open access: yes, 2011
We apply the techniques of symmetric generation to establish the standard presentations of the finite simply laced irreducible finite Coxeter groups, that is, the Coxeter groups of types An, Dn and En, and show that these are naturally arrived at purely ...
Fairbairn, Ben, Ben Fairbairn
core   +1 more source

Comparing the paths of Hedgehog release in artificial and natural settings

open access: yesFEBS Letters, EarlyView.
Hh morphogens require solubilization factors to overcome their tight association with the plasma membrane and signal to distant cells, but the precise functions of these factors are controversial. Here, we use published in vivo observations as the most relevant evidence to test their suggested functions and discuss contradictions and gaps between in ...
Janna Puschmann, Kay Grobe
wiley   +1 more source

Irredundant bases for finite almost simple groups [PDF]

open access: yes
In this thesis, we study maximum irredundant base sizes I(G, Γ) of three types of finite primitive permutation groups G, where two of the three types are almost simple.
Wu, Peiran
core   +1 more source

Admissible groups, symmetric factor sets, and simple algebras

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1984
Let K be a field of characteristic zero and suppose that D is a K-division algebra; i.e. a finite dimensional division algebra over K with center K. In Mollin [1] we proved that if K contains no non-trivial odd order roots of unity, then every finite odd
R. A. Mollin
doaj   +1 more source

On Tensor Products of Simple Modules for Simple Groups [PDF]

open access: yesAlgebras and Representation Theory, 2011
In an attempt to get some information on the multiplicative structure of the Green ring we study algebraic modules for simple groups, and associated groups such as quasisimple and almost-simple groups. We prove that, for almost all groups of Lie type in defining characteristic, the natural module is non-algebraic.
openaire   +3 more sources

Home - About - Disclaimer - Privacy