Results 91 to 100 of about 144,275 (215)
Combinatorics on ideals and axiom A [PDF]
Journal of Symbolic Logic, 1994 Throughout this paper denotes a nonprincipal ultrafilter and ℐ denotes the dual ideal. ℙ(ℐ) is the poset of all partial functions p: ω → 2 such that dom(p) ∈ ℐ. In [2], Grigorieff proved that ω1 is preserved in the corresponding generic extension if and only if is a P-point.
openaire +3 more sources
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
JTAM (Jurnal Teori dan Aplikasi Matematika)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
Random Diophantine equations in the primes
Mathematika, Volume 72, Issue 3, July 2026.Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
Ore's theorem on subfactor planar algebras
, 2019 This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection.
Palcoux, Sebastien
core
Quantitative asymptotics for polynomial patterns in the primes
Mathematika, Volume 72, Issue 3, July 2026.Abstract We prove quantitative estimates for averages of the von Mangoldt and Möbius functions along polynomial progressions n+P1(m),…,n+Pk(m)$n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials Pi$P_i$. The error terms obtained save an arbitrary power of logarithm, matching the classical Siegel–Walfisz error term.
Lilian Matthiesen +2 more
wiley +1 more source
Invariants of Combinatorial Line Arrangements and Rybnikov's Example
, 2004 Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups.
Artal, E. +3 more
core