Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For , the sign of distinguishes a hyperbolic partial differential equation when , an elliptic partial differential equation when , and a parabolic partial differential equation when and the principal symbol has rank one. If , the second-order principal symbol has rank zero and the differential order drops; this fully degenerate case must be checked separately for compatibility with the lower-order terms and forcing.
In two independent variables, a scalar second-order partial differential equation with a nonzero rank-one principal symbol. Its two characteristic directions coincide. The heat equation is the basic example.
In two independent variables, a scalar second-order partial differential equation with a definite principal symbol. It has no real characteristic direction. Laplace's equation is the basic example.
A propositional formula with two blocks of quantified Boolean variables. Determining the truth of an existential-then-universal instance is a canonical complete problem for the existential second level of the polynomial hierarchy, . For completeness one may restrict the matrix to a disjunction of terms with at most three literals. The order of the quantifiers matters: the assignment to must work for every assignment to .
The temporal orientation associated with the typical increase of macroscopic entropy away from suitable low-entropy conditions. It is a statistical claim about specified initial or boundary conditions and a macroscopic description, rather than a universal monotonicity theorem for every microscopic trajectory. Time reversal in classical mechanics pairs suitable increasing trajectories with decreasing ones, while fine-grained entropy is conserved under regular volume-preserving Hamiltonian flow.
The rule giving the successor state of each permitted state-action pair in a search problem. A compound action may include deterministic environmental responses. If a game state is sampled at full-turn boundaries, its search transition model must still detect terminal events occurring inside the turn. Otherwise an intermediate failure can be incorrectly hidden by the final position. All information needed for future successors and the goal test must be encoded in the state or supplied as fixed problem data.
A condition deciding whether a state successfully completes a search problem. Its timing must agree with the search transition model: arriving at a destination before an adversary's compulsory response need not be a successful terminal state.
A function estimating the remaining cost from a state to a goal in a search problem. The estimate is an admissible heuristic when it never exceeds the true minimum remaining cost. A consistent heuristic satisfies an additional local inequality along each permitted transition.
A heuristic function bounded above by the minimum remaining goal cost . When no goal is reachable, take . Admissibility is a lower-bound guarantee, rather than a statement that the estimate is usually numerically accurate. Ignoring constraints can produce a relaxation heuristic because it enlarges the available solution set.
A heuristic function is consistent if at every goal andfor every permitted transition with step cost . Summing these inequalities along a finite route to a goal gives its total cost. Taking the minimum over such routes proves that every consistent heuristic is an admissible heuristic.
A heuristic function obtained by solving an easier problem that permits every original transition and possibly additional ones, with original transitions costing no more in the easier problem. Every original solution remains available, so the easier optimum is an admissible heuristic.
If is the exact distance to the relaxed goal set, each original transition also gives by taking that transition and then a relaxed optimal continuation. Thus this construction gives a consistent heuristic when original goals have relaxed distance zero. For a four-direction grid walk, deleting obstacles gives Manhattan distance; deleting a pursuer's capture constraint supplies another relaxation. The resulting estimate can remain finite when the original goal is unreachable.
A search problem in which the available observations need not identify the current physical state. The controller must choose the same action for physical states that its observed history cannot distinguish. A belief state summarizes those possibilities; contingent planning selects future actions according to subsequent observations.
Two controlled walkers on the same connected undirected graph can each traverse one edge or wait in each unit-cost step. If they meet only by occupying the same vertex at the same time, their minimum meeting time iswhere is the shortest path distance. A common meeting point after steps implies by the triangle inequality. Conversely, choose a middle vertex of a shortest connecting graph path; both walkers reach it within steps, and the earlier arrival waits. The wait is essential when the path length is an odd integer. This distance on the joint Cartesian product state space is a consistent heuristic: each joint move changes the walkers’ separation by at most two. Replacing by an obstacle-free Manhattan distance preserves admissible heuristic and consistent heuristic guarantees.
Exploration of a game tree containing choices by competing decision makers. A maximizing node chooses the largest successor value; a minimizing opponent chooses the smallest. Known random outcomes instead require chance nodes and expected values, as in expectimax. A game tree representation can combine controlled choices and chance without assuming that chance maliciously chooses its worst outcome.
The path cost of a search node is the sum of step costs along the action history that reaches it:The same physical state can have different path costs when reached through different histories. Uniform-cost search orders nodes by accumulated path cost; A-star search adds a heuristic function estimating the remaining cost.
A state satisfying a problem's goal test. Whether its generation or its later selection terminates a search algorithm affects optimality for algorithms such as A-star search. A goal state's remaining optimal cost is zero, whereas its accumulated path cost need not be zero.
A search problem whose states are words of fixed length, with a transition changing exactly one letter and requiring the resulting word to belong to a specified dictionary. Unit path costs make a shortest graph path a minimum-mutation solution. Hamming distance to the target is a consistent heuristic: one transition changes this distance by at most one. Dictionary restrictions may force a longer solution or make the target unreachable.
The Schwinger boson representation satisfies , where is the local total boson number operator. Thus a prescribed local spin requires the displayed operator constraint at every site. A condition on alone is insufficient: for , . Projecting onto the required eigenspace at each site removes the unwanted local irreducible spin representations.
For radial motion in Schwarzschild spacetime, . At a prospective radial turning point , bounded outward proper acceleration permits . The equality defines a unique critical radius outside the horizon. A ship already falling inward cannot turn at or below it. The Newtonian proposed radius is strictly smaller and is therefore too late for reversal. A radius beyond the critical one is necessary, but braking must also remove the pre-existing inward velocity.
A Schwarzschild static observer at areal radius emits an outward null geodesic at a small angle to the radial direction. Its impact parameter is , and the accumulated azimuth to infinity is . Thus weak curvature magnifies a narrow outward beam angle by , rather than producing the full infinity-to-infinity deflection .
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





