When linear and weak discrepancy are equal
From MaRDI portal
Recommendations
Cites work
- A characterization of partially ordered sets with linear discrepancy equal to \(2\)
- Can transitive orientation make sandwich problems easier?
- Forbidden subposets for fractional weak discrepancy at most \(k\)
- scientific article; zbMATH DE number 5073478 (Why is no real title available?)
- Intransitive indifference with unequal indifference intervals
- Irreducible width 2 posets of linear discrepancy 3
- Linear discrepancy and bandwidth
- Linear discrepancy and weak discrepancy of partially ordered sets
- On the Weakness of an Ordered Set
- Online linear discrepancy of partially ordered sets
- The fractional weak discrepancy of a partially ordered set
Cited in
(14)- Linear discrepancy and weak discrepancy of partially ordered sets
- A characterisation of posets that are nearly antichains
- A characterization of partially ordered sets with linear discrepancy equal to \(2\)
- Online linear discrepancy of partially ordered sets
- The total weak discrepancy of a partially ordered set
- Fractional weak discrepancy of posets and certain forbidden configurations
- Enumeration of optimally labelled n-posets of linear discrepancy two
- Simple posets with respect to linear discrepancies
- The fractional weak discrepancy of \((M, 2)\)-free posets
- Linear discrepancy of the complete k-ary tree-poset.
- A note on linear discrepancy and bandwidth
- The \(t\)-discrepancy of a poset
- Irreducible width 2 posets of linear discrepancy 3
- The total linear discrepancy of an ordered set
This page was built for publication: When linear and weak discrepancy are equal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626763)