Results 71 to 80 of about 660,683 (355)

Heat loss through cylindrical and spherical building partitions

open access: yes, 2020
Heat transfer through curvilinear partitions differs, in mathematical terms, from transfer through flat ones. However, in practical calculations, an approximation is commonly used by estimating heat loss by analogy to flat partitions. There
Brycht, Natalia, Natalia Brycht
core   +1 more source

The (Glg)ABCs of cyanobacteria: modelling of glycogen synthesis and functional divergence of glycogen synthases in Synechocystis sp. PCC 6803

open access: yesFEBS Letters, EarlyView.
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee   +3 more
wiley   +1 more source

Valosin‐containing protein counteracts ATP‐driven dissolution of FUS condensates through its ATPase activity in vitro

open access: yesFEBS Letters, EarlyView.
Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura   +2 more
wiley   +1 more source

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Harada's conjecture II for the finite general linear groups and unitary groups [PDF]

open access: yesInternational Journal of Group Theory
K. Harada conjectured for any finite group $G$, the product of sizes of all conjugacy classes is divisible by the product of degrees of all irreducible characters. We study this conjecture when $G$ is the general linear group over a finite field. We show
Masahiro Sugimoto
doaj   +1 more source

Plane Partitions and a Problem of Josephus

open access: yesMathematics, 2023
The Josephus Problem is a mathematical counting-out problem with a grim description: given a group of n persons arranged in a circle under the edict that every kth person will be executed going around the circle until only one remains, find the position ...
Mircea Merca
doaj   +1 more source

10 Problems for Partitions of Triangle-free Graphs

open access: yes, 2022
We will state 10 problems, and solve some of them, for partitions in triangle-free graphs related to Erdős' Sparse Half Conjecture. Among others we prove the following variant of it: For every sufficiently large even integer n the following holds.
Clemen, Felix Christian   +2 more
core  

Linking neurogenesis, oligodendrogenesis, and myelination defects to neurodevelopmental disruption in primary mitochondrial disorders

open access: yesFEBS Letters, EarlyView.
Mitochondrial remodeling shapes neural and glial lineage progression by matching metabolic supply with demand. Elevated OXPHOS supports differentiation and myelin formation, while myelin compaction lowers mitochondrial dependence, revealing mitochondria as key drivers of developmental energy adaptation.
Sahitya Ranjan Biswas   +3 more
wiley   +1 more source

On the number of partitions of a number into distinct divisors [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
Let p_{dsd}(n) be the number of partitions of n into distinct squarefree divisors of n. In this note, we find a lower bound for p_{dsd}(n), as well as a sequence of n for which p_{dsd} (n) is unusually large.
Noah Lebowitz-Lockard, Joseph Vandehey
doaj   +1 more source

On partitioning of hypergraphs

open access: yesDiscrete Mathematics, 2007
The edge-isoperimetric problem on graphs (EIP), namely for a given integer \(m\) and graph \(G=(V,E)\) to find a subset \(A\) of the vertices of \(G\) of cardinality \(m\) so that the number of edges of \(G\) connecting vertices in \(A\) to vertices in \(V\setminus A\), is minimized (version 1), or such that the number of edges of \(G\) induced by \(A\)
S. Bezrukov, Battiti, Roberto
openaire   +3 more sources

Home - About - Disclaimer - Privacy