Results 81 to 90 of about 147,491 (227)
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
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
Steiner Triple Systems With High Discrepancy
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
A focal boundary value problem for difference equations
The eigenvalue problem in difference equations, (−1)n−kΔny(t)=λ∑i=0k−1pi(t)Δiy(t), with Δty(0)=0, 0≤i≤k, Δk+iy(T+1)=0, 0 ...
Cathryn Denny, Darrel Hankerson
doaj +1 more source
Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs
ABSTRACT Let Q be an n × n array whose top left r × s sub‐array L is filled with a set of k different symbols such that each cell of L contains λ symbols. In this note, we find conditions under which each empty cell of Q can be filled with λ symbols in such a way that the total number of occurrences of each symbol is prescribed and that each symbol ...
Amin Bahmanian
wiley +1 more source
This study aims to analyze the application of the RBL-STEM learning model in improving students' financial literacy to control their consumptive behavior.
Sumarno +5 more
doaj +1 more source
The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let Pk denote the path on k vertices and let mPk denote m disjoint copies of Pk.
Lan Yongxin, Qin Zhongmei, Shi Yongtang
doaj +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
On a rigidity property for quadratic gauss sums
Abstract Let N$N$ be a large prime and let c>1/4$c > 1/4$. We prove that if f$f$ is a ±1$\pm 1$‐valued multiplicative function, such that the exponential sums Sf(a):=∑1⩽n
Alexander P. Mangerel
wiley +1 more source
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
On certain extremal Banach–Mazur distances and Ader's characterization of distance ellipsoids
Abstract A classical consequence of the John Ellipsoid Theorem is the upper bound n$\sqrt {n}$ on the Banach–Mazur distance between the Euclidean ball and any symmetric convex body in Rn$\mathbb {R}^n$. Equality is attained for the parallelotope and the cross‐polytope. While it is known that they are unique with this property for n=2$n=2$ but not for n⩾
Florian Grundbacher, Tomasz Kobos
wiley +1 more source

