Computing Uniform Bounds
نویسندگان
چکیده
منابع مشابه
Uniform Bounds on Multigraded Regularity
We give an effective uniform bound on the multigraded regularity of a subscheme of a smooth projective toric variety X with a given multigraded Hilbert polynomial. To establish this bound, we introduce a new combinatorial tool, called a Stanley filtration, for studying monomial ideals in the homogeneous coordinate ring of X . As a special case, we obtain a new proof of Gotzmann’s regularity the...
متن کاملUniform Bounds for Bessel Functions
For ν > −1/2 and x real we shall establish explicit bounds for the Bessel function Jν(x) which are uniform in x and ν. This work and the recent result of L. J. Landau [7] provide relatively sharp inequalities for all real x.
متن کاملNormal transversality and uniform bounds
Let A be a commutative ring. A graded A-algebra U = ⊕n≥0Un is a standard A-algebra if U0 = A and U = A[U1] is generated as an A-algebra by the elements of U1. A graded U -module F = ⊕n≥0Fn is a standard U -module if F is generated as an U -module by the elements of F0, that is, Fn = UnF0 for all n ≥ 0. In particular, Fn = U1Fn−1 for all n ≥ 1. Given I, J , two ideals of A, we consider the follo...
متن کاملImproved Uniform Test Error Bounds
We derive distribution free uniform test error bounds that improve on VC type bounds for validation We show how to use knowledge of test inputs to improve the bounds The bounds are sharp but they require intense computation We introduce a method to trade sharpness for speed of computation Also we compute the bounds for several test cases Key wordsmachine learning learning theory generalization ...
متن کاملNew Non-Uniform Lower Bounds for Uniform Classes
We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show that the lower bound holds against sub-linear advice. More formally, we show that for any constants d and d′ such that 1 6 d < d′, and for any time-constructible bound t = o(n), there is a language in NTIME(n) which is not in NTIME(t)/n1/d . The best known earlier separation of Fortnow, Santhanam ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80375-x