Results 61 to 70 of about 6,526 (216)
Statistics of Feynman amplitudes in ϕ 4-theory
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
JENGA, a very popular game of physical skill, when played by perfect players, can be seen as a pure combinatorial ruleset. Taking that into account, it is possible to play with more than one tower; a move is made by choosing one of the towers, removing a block from there, that is, a disjunctive sum.
Carvalho, Alda +2 more
openaire +1 more source
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
Combinatorics of γ -Structures [PDF]
38 pages 9 ...
Han, Hillary Siwei +2 more
openaire +3 more sources
On the automorphisms of the power semigroups of a numerical semigroup
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was
Sean Carrell, Guillaume Chapuy
doaj +1 more source
ABSTRACT Capsets are subsets of F 3 n with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3. In particular we construct the smallest known complete capsets with size proportional to the best known lower bound.
Cassie Grace, José Felipe Voloch
wiley +1 more source
Continuous dependence and differentiation of solutions of finite difference equations
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
On the Hardness of Switching to a Small Number of Edges
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
INTEGRABLE COMBINATORICS [PDF]
We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)
openaire +4 more sources

