Linear Discrepancy and Bandwidth

نویسندگان

  • Peter C. Fishburn
  • Paul J. Tanenbaum
  • Ann N. Trenk
چکیده

The linear discrepancy of a partially ordered set P = (X;), denoted by ld(P), is the least integer k for which there exists an injection f : X ! Z satisfying (i) if x y, then f (x) < f (y); and (ii) if x and y are incomparable, then jf(x)?f(y)j k. There is an apparent connection between ld(P) and the bandwidth of the incomparability graph of P. We prove that, in fact, these two quantities are always equal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Brooks-type Theorem for the Bandwidth of Interval Graphs

Let G be an interval graph. The layout that arranges the intervals in order by right endpoint easily shows that the bandwidth of G is at most its maximum degree ∆. Hence, if G contains a clique of size ∆ + 1, then its bandwidth must be ∆. In this paper we prove a Brooks-type bound on the bandwidth of interval graphs. Namely, the bandwidth of an interval graph is at most ∆, with equality if and ...

متن کامل

Discrimination of time series based on kernel method

Classical methods in discrimination such as linear and quadratic do not have good efficiency in the case of nongaussian or nonlinear time series data. In nonparametric kernel discrimination in which the kernel estimators of likelihood functions are used instead of their real values has been shown to have good performance. The misclassification rate of kernel discrimination is usually less than ...

متن کامل

Enhanced-Delivery Overlay Multicasting Scheme by Optimizing Bandwidth and Latency Discrepancy Ratios

With optimized bandwidth and latency discrepancy ratios, Node Gain Scores (NGSs) are determined and used as a basis for shaping the max-heap overlay. The NGSs determined as the respective bandwidth-latency-products govern the construction of max-heap-form overlays. Each NGS is earned as a synergy of discrepancy ratio of the bandwidth requested with respect to the estimated available bandwidth, ...

متن کامل

On Poisson signal estimation under Kullback–Leibler discrepancy and squared risk

Regression problems under Poisson variability arise in many different scientific areas such as, for examples, astrophysics and medical imaging. This article considers the problem of bandwidth selection for kernel smoothing of Poisson data. Its first contribution is the proposal of a new bandwidth selectionmethod that aims to choose the bandwidth thatminimizes theKullback–Leibler (KL)distance be...

متن کامل

A Characterization of Partially Ordered Sets with Linear Discrepancy Equal to 2

The linear discrepancy of a poset P is the least k such that there is a linear extension L of P such that if x and y are incomparable in P, then |hL(x) − hL(y)| ≤ k, where hL(x) is the height of x in L. Tanenbaum, Trenk, and Fishburn characterized the posets of linear discrepancy 1 as the semiorders of width 2 and posed the problem of characterizing the posets of linear discrepancy 2. We show t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Order

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2001