Results 81 to 90 of about 169,932 (295)
Statistics of Feynman amplitudes in ϕ 4-theory
Journal of High Energy Physics, 2023 The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs, this represents more
Paul-Hermann Balduf
doaj +1 more source
PPP-Completeness and Extremal Combinatorics [PDF]
, 2023 Romain Bourneuf +4 more
openalex +1 more source
Plank theorems and their applications: A survey
Bulletin of the London Mathematical Society, EarlyView.Abstract Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems in various areas of mathematics.
William Verreault
wiley +1 more source
The combinatorics of splittability
, 2004 Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete classification of
Bartoszyński +13 more
core +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
Continuous dependence and differentiation of solutions of finite difference equations
International Journal of Mathematics and Mathematical Sciences, 1991 Conditions are given for the continuity and differentiability of solutions of initial value problems and boundary value problems for the nth order finite difference equation, u(m+n)=f(m,u(m),u(m+1),…,u(m+n−1)),m∈ℤ.
Johnny Henderson, Linda Lee
doaj +1 more source
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Additive Combinatorics and its Applications in Theoretical Computer Science
Theory of Computing, 2017 Additive combinatorics (or perhaps more accurately, arithmetic combinatorics) is a branch of mathematics which lies at the intersection of combinatorics, number theory, Fourier analysis and ergodic theory.
Shachar Lovett
semanticscholar +1 more source
On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
Journal of Combinatorial Designs, Volume 34, Issue 2, Page 69-86, February 2026.ABSTRACT Let Γ denote a finite, connected graph with vertex set X. Fix x ∈ X and let ε ≥ 3 denote the eccentricity of x. For mutually distinct scalars { θ i * } i = 0 ε define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) as follows: for y ∈ X we let ( A * ) y y = θ ∂ ( x , y ) *, where ∂ denotes the shortest path length ...
Blas Fernández +3 more
wiley +1 more source
Graphs with 4-Rainbow Index 3 and n − 1
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang +3 more
doaj +1 more source