Results 71 to 80 of about 58,072 (195)
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, Volume 111, Issue 9, Page 4015-4040, 1 September 2026.Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley +1 more source
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
Ural Mathematical JournalFor a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj +1 more source
Geophysical Research Letters, Volume 53, Issue 16, 28 August 2026.Abstract The annual mean Surface Air Temperature (SAT) observed during 1757–1762 in central Beijing was 3.1°C lower than that of the nearby Autonomous Weather Stations (AWS) in recent 6 years (2015–2020). The change was much larger than the averaged global warming of the past century.
Guoyu Ren +4 more
wiley +1 more source
Jordan Curves: Ramsey Approach and Topology
MathematicsWe develop a topological-combinatorial framework applying classical Ramsey theory to systems of arcs connecting points on Jordan curves and their higher-dimensional analogues.
Edward Bormashenko
doaj +1 more source
The power of many: when genetics met yeasts and high‐throughput
Biological Reviews, Volume 101, Issue 4, Page 1662-1682, August 2026.ABSTRACT In recent years, complex technological capabilities have evolved, driven by the need to solve complex and integrative biological questions through global analyses. New equipment allows the scaling up and automation of processes which previously were carried out on a very limited scale.
Víctor A. Tallada, Víctor Carranco
wiley +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
Problems in extremal and probabilistic combinatorics
, 2017 In this thesis we consider some problems in extremal and probabilistic combinatorics. In Chapter 2 we determine the maximum number of induced cycles that can be contained in a graph on n ≥ n0 vertices, and show that there is a unique graph that achieves this maximum. This answers a question of Tuza. Let Qd denote the hypercube of dimension d. Given d ≥
Morrison, N, Noel, J
openaire +2 more sources
Random Fibonacci Words via Clone Schur Functions
Forum of Mathematics, SigmaWe investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj +1 more source
Asymmetric Results About Graph Homomorphisms
Random Structures &Algorithms, Volume 69, Issue 1, August 2026.ABSTRACT Many important results in extremal graph theory can be roughly summarized as “if a triangle‐free graph G$$ G $$ has certain properties, then it has a homomorphism to a triangle‐free graph Γ$$ \Gamma $$ of bounded size.” For example, bounds on homomorphism thresholds give such a statement if G$$ G $$ has sufficiently high minimum degree, and ...
Lior Gishboliner +2 more
wiley +1 more source
Representation Functions With Prescribed Rates of Growth
Random Structures &Algorithms, Volume 69, Issue 1, August 2026.ABSTRACT Fix an integer h≥2$$ h\ge 2 $$, and let b1,…,bh$$ {b}_1,\dots, {b}_h $$ be (not necessarily distinct) positive integers with gcd(b1,…,bh)=1$$ \gcd \left({b}_1,\dots, {b}_h\right)=1 $$. For any subset A⊆ℕ$$ A\subseteq \mathbb{N} $$, let rA(n)$$ {r}_A(n) $$ denote the number of solutions (k1,…,kh)∈Ah$$ \left({k}_1,\dots, {k}_h\right)\in {A}^h $$
Christian Táfula
wiley +1 more source