Results 31 to 40 of about 352 (164)
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, EarlyView.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
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
On the combinatorics of Kac's asymmetry function [PDF]
, 1991 summary:We use categories to recast the combinatorial theory of full heaps, which are certain labelled partially ordered sets that we introduced in previous work.
Green, R. M., M. Kashiwara
core +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
, 2007 The study of pattern classes is the study of the involvement order on finite permutations. This order can be traced back to the work of Knuth. In recent years the area has attracted the attention of many combinatoralists and there have been many ...
Waton, Stephen D.
core
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Weak, Strong and Mixed Extensions of Relations to Spaces of Ultrafilters
Mathematical Logic Quarterly, Volume 72, Issue 3, August 2026.ABSTRACT The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers, focused mostly on congruences and divisions. We show that similar methods can be used to extend these characterizations to arbitrary relations and their interplay.
Leonardo Raffaello Maximilian Gasparro +1 more
wiley +1 more source
Journal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Angewandte Chemie, Volume 138, Issue 26, 22 June 2026.Pareto optimal compositions of alloy catalyst for oxygen reduction reaction are uncovered through multi‐objective Bayesian optimization of activity, stability, and material cost in an eight‐element high‐entropy alloy composition space. The substantial Pareto front obtained is compared to experimental literature and analyzed to elucidate the roles and ...
Mads K. Plenge +4 more
wiley +2 more sources
Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large‐deviation principle with logarithmic speed: the rare event that the largest component contains linearly more vertices ...
Joost Jorritsma, Bert Zwart
wiley +1 more source