Results 171 to 180 of about 20,142 (301)

Chaotische Bewegung auf Hamiltonschen Tori

open access: yes, 1992
KAM-tori are well known to be that (finite!) part of phase space in which the motion of a weakly perturbed classical Hamiltonian system remains integrable. Moreover, they are barriers in the phase space of systems with two degrees of freedom.
Kempis, A. von
core  

Hemp seed counting and morphometric analysis method comparison

open access: yesThe Plant Phenome Journal, Volume 9, Issue 1, December 2026.
Abstract The USDA ARS Hemp Germplasm Laboratory recently acquired over 800 hemp accessions (Cannabis sativa L.). Variation in hemp seed size characteristics is needed to develop quantitative standards to support the transition of hemp grain into a commodity.
Tyler Gordon, Zachary Stansell
wiley   +1 more source

Fault-Tolerant Meshes and Tori Embedded in a Faulty Supercube

open access: yes, 2011
Hypercubes, meshes, and tori are well known interconnection networks for parallel computing. The Supercube network is a generalization of the hypercube.
Lin, Jen-Chih   +1 more
core  

Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic

open access: yesCommunications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1973-2102, August 2026.
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley   +1 more source

On Oriented Colourings of Graphs on Surfaces

open access: yesJournal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.
ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley   +1 more source

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

open access: yesJournal of Graph Theory, Volume 112, Issue 3, Page 267-275, July 2026.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák   +1 more
wiley   +1 more source

Home - About - Disclaimer - Privacy