Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A matroid isomorphism between and is a bijection such that if and only if . It relabels the ground set without changing independence. The number of labelled matroids therefore differs from the number of types up to matroid isomorphism.
An element is a loop of a matroid when its singleton is not a matroid independent set. By heredity, no matroid independent set contains it. Equivalently its singleton has rank of a matroid zero, or it belongs to the closure of a matroid of the empty set. In a graphic matroid, a self-loop is a loop of a matroid.
A nonloop is an element whose singleton is a matroid independent set. It is precisely an element that is not a loop of a matroid, and its singleton has rank of a matroid one.
A matroid dependent set is a subset of the ground set that is not a matroid independent set. By heredity, every subset containing a matroid dependent set is also dependent. Distinct nonloops are parallel elements of a matroid exactly when their pair is a matroid dependent set.
Distinct nonloops are parallel elements of a matroid when their pair is dependent. Declaring each nonloop parallel to itself makes parallelism an equivalence relation on the nonloops. Transitivity follows directly from augmentation: if and are dependent but independent, the independent singleton could not be augmented from the independent pair , contradicting the matroid independence axioms. In a linear matroid, nonzero proportional vectors give parallel elements of a matroid.
For , the uniform matroid on an -element ground set has as its matroid independent sets exactly the subsets of cardinality at most . Heredity is immediate, and augmentation works because any smaller such subset can acquire an element of a larger one without exceeding . Its rank of a matroid on is .
The closure of a matroid adds all elements that fail to increase its rank of a matroid. It abstracts the linear span in a linear matroid. It is extensive, preserves inclusion, preserves the rank of a matroid, and is an idempotent function:Proof. Extensivity follows from when . If and , submodularity of matroid rank gives . Thus an element in also lies in ; the case is automatic. Add the finitely many elements of one at a time. Inclusion preservation makes each addition have zero marginal increment of the rank of a matroid, proving rank preservation.
For completeness, nested subsets of equal rank of a matroid have the same closure of a matroid. If , apply submodularity of matroid rank to and to obtain ; monotonicity gives the reverse bound. The defining tests for membership in their closures are therefore equal. If , , so both closures contain . Apply this equal-rank result to to prove idempotence. In particular, every maximal matroid independent set of has the same closure of a matroid as .
The closure of a matroid obeys the displayed exchange rule. This is the finite pregeometry exchange principle: if adding newly makes dependent, then adding also makes dependent.
Proof. Write . The first hypothesis and the one-element bound on the rank of a matroid give . The second gives . Inclusion gives , so equality holds. This is exactly .
On labelled ground sets of sizes , there are respectively matroids, or up to matroid isomorphism. At rank of a matroid one, a nonempty subset of nonloops specifies all matroid independent sets of cardinality one. On three labels at rank of a matroid two, the three types are one matroid loop with an independent pair, no matroid loops with one pair of parallel elements of a matroid, and all pairs independent with the triple dependent.
A choice of a domain and meanings for the symbols of a formal language, used to evaluate its sentences. The same sentence can have different truth values under different interpretations, unless it is valid under every admitted interpretation.
A propositional formula or first-order formula is in negation normal form when its negations occur only directly before atomic formulas, and its other logical connectives are conjunction and disjunction, together with quantifiers in the first-order case. Remove implications using , then push negations inward using De Morgan's laws, double-negation cancellation, andIn particular, negating an implication gives , so its antecedent retains its original sign after the outer negation has been pushed through.
A logical derivation is a finite application of explicitly specified inference rules to premises or temporary assumptions. In natural deduction, which assumptions remain open is part of the logical derivation: a conclusion reached inside a temporary subproof cannot simply be used outside it.
An inference rule licenses a conclusion from specified premises, possibly with side conditions. A derived inference rule is justified by a logical derivation using the primitive inference rules; using it subsequently abbreviates that logical derivation.
Determining the value of a European option or American option from a specified financial market model and its permitted exercise rules. Risk-neutral pricing, replicating strategies and optimal stopping address different parts of this problem.
An integral of future flows weighted by a specified discount factor, such as . For an exponentially growing flow, convergence requires the discount rate to exceed its growth rate.
The absolute decline from a previous running peak of a cumulative-value process. For positive peak values a relative decline can also be defined, but that is a different unit convention. Flat intervals do not end a drawdown, and a brief recovery that stays below the previous peak does not necessarily end it either. A maximum consecutive strictly negative run is therefore not generally a maximum drawdown.
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





