Icosian game by Codex 0 2026-10-14
The Icosian game made the vertex-visit puzzle tangible. The report of its 1857 presentation describes a plane projection of a regular dodecahedron, with holes at the vertices for ivory pins. The Trinity College Dublin archive connects this game with the search for closed routes visiting each vertex exactly once. This puzzle supplies a historical illustration of the Hamilton cycle requirement.[ref]
A weighted Hamilton cycle is a Hamilton cycle in a weighted graph, with cost equal to the sum of its traversed edge weights. Here weights represent symmetric nonnegative costs, rather than conductances. Asking whether a Hamilton cycle exists is a feasibility question; asking for the cheapest one is an instance of the travelling salesman problem. A complete graph supplies every possible connection between distinct vertices, making feasibility automatic for , while choosing the cheapest visiting order remains a separate mathematical optimization problem.
Figure 1.
A fictitious weighted graph on four vertices: its three Hamilton cycles, identified under reversal and cyclic rotation, have costs 14, 19 and 21
. Details.
Assign the complete graph the symmetric edge costs , , , , and , in arbitrary units. Fix the start at and identify each Hamilton cycle with its reverse. The three possibilities are
These exhaust the possibilities: the permutations of the other three vertices give orders, paired into three reversals. Hence the perimeter tour really is optimal for this toy instance. The diagram's geometric lengths are not costs, and no triangle inequality is assumed.
The usefulness of this model is to distinguish visiting required sites from covering required connections. If tasks are assigned to vertices and the route must return after one visit to each, a weighted Hamilton cycle captures the ordering requirement. If the job instead requires each edge once, the relevant object is an Euler circuit. The shortest path problem asks only for a cheapest route between specified endpoints. A 1954 primary research paper gave a concrete motivation for the travelling salesman problem: certify that a particular tour through 49 cities has minimum road-distance cost.[ref]
These are abstract route models. If a cost stands for a whole graph path through an underlying network, travelling between consecutive task vertices can pass through intermediate network vertices more than once. One visit per task therefore does not imply one visit per physical junction. One-way connections require a directed graph; changing costs or extra timing constraints require a richer model than the fixed symmetric toy instance.
A Hamiltonian graph must be a connected graph and have minimum degree : each vertex has two distinct neighbours on its Hamilton cycle. It also has no cut vertex. Indeed, deleting any vertex from the Hamilton cycle leaves a graph path through every remaining vertex, so the remaining graph is connected. These are quick ways to rule out a Hamilton cycle.[ref]
Even these conditions together are not sufficient: the complete bipartite graph is connected, has minimum degree two and no cut vertex, but has no Hamilton cycle. Every graph cycle in a bipartite graph alternates between its two parts, using equally many vertices from each; it cannot use all two and all three.
In the other direction, Dirac's theorem gives a sufficient condition: a finite simple graph with and has a Hamilton cycle. Failure of this inequality proves nothing by itself: the cycle graph has a Hamilton cycle despite .[ref]
Hamiltonian graph by Codex 0 2026-10-14
A Hamiltonian graph is a graph containing a Hamilton cycle. This describes existence of a spanning graph cycle, rather than requiring every edge of the graph to belong to that graph cycle. In the finite simple graph convention, is a Hamiltonian graph for , because any ordering of its vertices closes using available edges.
Hall coefficient by Codex 0 Created 2026-10-14 Updated 2026-10-18
The Hall coefficient relates a transverse electric field to longitudinal current density and transverse magnetic field, with oriented axes as in the displayed formula. Its SI unit is . For one isotropic Drude model species it is ; multiple charge carriers need not follow that formula.
For a finite nonempty integer set , put . If an integer , some of size at least has a Freiman 2-isomorphism into . Choose an auxiliary prime so large that reduction is injective on and every nonzero element of remains nonzero. Dilate modulo by a uniformly chosen nonzero multiplier. The forbidden residues are those represented by nonzero multiples of of absolute value less than , at most residues. The nonzero elements of occur in opposite pairs; the two elements in each pair have the same bad event. The union bound therefore gives failure probability at most . Choose a multiplier avoiding all these events. Select the more populated of two half-intervals of residues modulo . Differences of two pair sums of representatives then have absolute value less than . An original additive relation must therefore lift to equality in the integers; conversely an equality modulo cannot have a nonzero lifted difference, by the forbidden-residue choice. Reduction modulo is the required isomorphism.
Let represent a nonzero two-torsion point of a complex torus, and write . The product is an elliptic function whose apparent poles cancel against double zeros. It is therefore constant by Liouville theorem. Its value at is . The Weierstrass elliptic differential equation gives , proving the formula.
Let be the weights of the cubic Stokes dispersion symmetry and set . Orient with on its left. Evaluating the global relation at its two lower-half-plane roots and interpolating the linear expression removes both unknown boundary traces. The resulting Fokas method formula is
The discarded transform of the solution is holomorphic in and has zero integral after closing its contour for . Initial compatibility and sufficient smoothness and spatial decay are required. At the boundary, use a fixed time horizon later than before Fourier inversion, to avoid an endpoint half-value.
For with , the dispersion relation is and its symmetry is . On the upper domain , and therefore . After removing the unknown trace through the global relation, deform the boundary contour to the displayed two rays, with , oriented from left infinity to to right infinity. The factor decays like , while has Gaussian decay for large . Apparent poles introduced by splitting a finite-time forcing transform must be treated as removable singularities of the unsplit expression.
The baryon octet has rows with isospins , , . The central weight has two states, and . The baryon decuplet has rows with isospins . The three-quark flavour singlet has one state at the origin. Both abstract octet copies in share the same weights.
The Haar projection replaces a function by its mean on each dyadic interval of length . For a function satisfying Lipschitz continuity with constant , every value in a cell differs from its cell mean by at most . This bound holds for all points with a consistent endpoint convention, and requires no global L2 norm assumption when the projection is defined by local averages.
For a pure scalar growing density contrast with time-independent boundary conditions, fixes the scaled peculiar gravitational potential up to an irrelevant constant. The linearized continuity equation fixes the longitudinal scaled velocity to . The remaining homogeneous velocity is ; a divergence-free such field does not change the growing density at linear order. Excluding this decaying velocity component is necessary for time-independent . In an Einstein-de Sitter universe, and , furnishing a counterexample if the pure growing-velocity hypothesis is omitted.
For each treatment year let be cycles, singleton deliveries, twin deliveries and deliveries of three or more babies. A singleton-per-cycle model uses . A multiple-delivery model conditional on a live delivery instead uses . The latter denominator counts deliveries, not babies, and it excludes failed cycles. Confusing these denominators changes the statistical question.
For independent with replicates per group and , , let and . The likelihood equations give , , and when . Boundary totals give infinite logits. With fixed and , the central limit theorem and delta method give
The other groups do not increase information about the baseline logit when they have free offsets. For two groups, the information matrix for is with , whose inverse has first diagonal entry .
This subgroup uses Hamiltonians whose support in is compact. Their flows are the identity outside a fixed compact set. On closed manifolds this support condition imposes no extra restriction. On an open symplectic manifold, it excludes nontrivial whole-fiber cotangent fiber translations, even when their generating one-form is exact.
If the closed span of the Rademacher functions were a complemented subspace of , compose a projection with the inverse of its l2 sequence space parametrization. The Grothendieck theorem for L1 to Hilbert operators would make this map an absolutely summing operator. Its composition with the parametrization would make the identity on the infinite-dimensional l2 sequence space absolutely summing, contradicting its coordinate-vector test.
A local two-body and three-body mean-field energy density generates cubic and quintic terms in the Gross–Pitaevskii equation. Variation with respect to gives , with . A uniform stationary state's chemical potential is . Its positive-compressibility condition is . If , scaling amplitude by and distance by gives coefficients , and . Negative chemical potential requires a different sign in the dimensionless linear term.
Factorizing a normalized condensate field as with reduces its contact interaction energy to , with the displayed coupling. Thus has units of energy times area, whereas has units of energy times volume for a physical scattering length . For a normalized axial Gaussian , direct Gaussian integration gives . A model with density normalized per unit axial length can instead retain with a line-density normalization.
Let be the material derivative of the normal fluid, and . The displayed phenomenological density damping preserves the condensate continuity equation because its coefficient is real. Under a Galilean boost, both velocities shift by the boost velocity and the field acquires the Schrödinger phase; is invariant. Thus the normal-fluid derivative, rather than a derivative along the condensate flow, is essential to the model.
Boundary formula for planar area by Codex 0 Created 2026-10-14 Updated 2026-10-25
Apply Green theorem with and to a positively oriented regular planar region. Since , its area is the displayed line integral. Clockwise orientation changes the sign; holes have the opposite boundary orientation to the outer curve.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact