Search references for UPPER BOUND-THEOREM. Phrases containing UPPER BOUND-THEOREM
See searches and references containing UPPER BOUND-THEOREM!UPPER BOUND-THEOREM
In mathematics, the upper bound theorem states that cyclic polytopes have the largest possible number of faces among all convex polytopes with a given
Upper_bound_theorem
Property of a partially ordered set
values under f. Then b is an upper bound for S, and the least upper bound must be a root of f. The Bolzano–Weierstrass theorem for R states that every sequence
Least-upper-bound_property
Convex hull of points on moment curve
an important role in polyhedral combinatorics: according to the upper bound theorem, proved by Peter McMullen and Richard Stanley, the boundary Δ(n,d)
Cyclic_polytope
Continuous real function on a closed interval has a maximum and a minimum
real analysis, the extreme value theorem states that if a real-valued function f is continuous on the closed and bounded interval [a,b], then f must attain
Extreme_value_theorem
British mathematician
particular for proving what was then called the upper bound conjecture and now is the upper bound theorem. This result states that cyclic polytopes have
Peter_McMullen
Smallest convex set containing a given set
and in time matching the worst-case output complexity given by the upper bound theorem in higher dimensions. As well as for finite point sets, convex hulls
Convex_hull
Exponentially decreasing bounds on tail distributions of random variables
In probability theory, a Chernoff bound is an exponentially decreasing upper bound on the tail of a random variable based on its moment generating function
Chernoff_bound
Statement in mathematical combinatorics
order n. Ramsey's theorem states that such a number exists for all m and n. By symmetry, it is true that R(m, n) = R(n, m). An upper bound for R(r, s) can
Ramsey's_theorem
Theorems on the convergence of bounded monotonic sequences
non-decreasing bounded-above sequence of real numbers a1≤a2≤a3≤...≤K converges to its smallest upper bound, its supremum. Likewise, a non-increasing bounded-below
Monotone_convergence_theorem
Shape where all small sets of vertices form a face
term of the sum should be halved if d is even. According to the upper bound theorem of McMullen (1970), neighborly polytopes achieve the maximum possible
Neighborly_polytope
Number of intersection points of algebraic curves and hypersurfaces
this theorem provides only an upper bound of the number of points, which is almost always reached. This bound is often referred to as the Bézout bound. Bézout's
Bézout's_theorem
On chains and antichains in partial orders
decomposition into finitely many chains, or when there exists a finite upper bound on the size of an antichain, the sizes of the largest antichain and of
Dilworth's_theorem
Characterization of how many integers are prime
(and the theorem) does not say anything about the limit of the difference of the two functions as x increases without bound. Instead, the theorem states
Prime_number_theorem
Nonexistence of gaps in the number line
theorem or collection of theorems. The least-upper-bound property states that every nonempty subset of real numbers having an upper bound (or bounded
Completeness of the real numbers
Completeness_of_the_real_numbers
Relationship between derivatives and integrals
over an interval with a variable upper bound. Conversely, the second part of the theorem, the second fundamental theorem of calculus, states that the integral
Fundamental theorem of calculus
Fundamental_theorem_of_calculus
example is of dimension d = 4 and has f0 = 8 vertices. The upper bound theorem gives upper bounds for the numbers fi of i-faces of any simplicial d-sphere
Simplicial_sphere
Greatest lower bound and least upper bound
is an upper bound of S, then the supremum of S is less than or equal to b. Consequently, the supremum is also referred to as the least upper bound (or LUB)
Infimum_and_supremum
Bounded sequence in finite-dimensional Euclidean space has a convergent subsequence
Euclidean space R n {\displaystyle \mathbb {R} ^{n}} . The theorem states that each infinite bounded sequence in R n {\displaystyle \mathbb {R} ^{n}} has a
Bolzano–Weierstrass_theorem
Triangulation method
mcgill.ca. Retrieved 29 October 2018. Seidel, Raimund (1995). "The upper bound theorem for polytopes: an easy proof of its asymptotic version". Computational
Delaunay_triangulation
Theorem in order theory
Markowsky's theorem states: every chain-complete poset is a dcpo where a poset is chain-complete if each chain in it has a least upper bound. a poset is
Markowsky's_theorem
number theory, the Brun–Titchmarsh theorem, named after Viggo Brun and Edward Charles Titchmarsh, is an upper bound on the distribution of prime numbers
Brun–Titchmarsh_theorem
Continuous function on an interval takes on every value between its values at the ends
In mathematical analysis, the intermediate value theorem states that if f is a continuous function whose domain contains the interval [a, b] and s is
Intermediate_value_theorem
Mathematical proposition equivalent to the axiom of choice
as above, we take xα to be some upper bound of the sequence xβ,β<α via c. (See also Transfinite recursion theorem § Example: a proof of Zorn's lemma
Zorn's_lemma
bound of Theorem 2 into the bound of Theorem 1 produces a numerical upper bound on A q ( n , d ) {\displaystyle A_{q}(n,d)} . Elias Bassalygo bound Gilbert–Varshamov
Johnson_bound
Probabilistic inequality applying on sum of bounded random variables
probability theory, Hoeffding's inequality provides an upper bound on the probability that the sum of bounded independent random variables deviates from its expected
Hoeffding's_inequality
The Forster–Swan theorem is a result from commutative algebra that states an upper bound for the minimal number of generators of a finitely generated
Forster–Swan_theorem
Method for finding limits in calculus
theorem regarding the limit of a function that is bounded between two other functions. The squeeze theorem is used in calculus and mathematical analysis,
Squeeze_theorem
Theorem that tells the maximum rate at which information can be transmitted
Ralph Hartley. The Shannon–Hartley theorem states the channel capacity C, meaning the theoretical tightest upper bound on the information rate of data that
Shannon–Hartley_theorem
Certain dynamical systems will eventually return to (or approximate) their initial state
the flow. Poincaré's formulation of the theorem then states: If a flow preserves volume and has only bounded orbits, then, for each open set, there is
Poincaré_recurrence_theorem
On the existence of arithmetic progressions in subsets of the natural numbers
Roth's theorem is a special case of Szemerédi's theorem for the case k=3. A subset A of the natural numbers is said to have positive upper density if
Roth's theorem on arithmetic progressions
Roth's_theorem_on_arithmetic_progressions
Mathematical algorithm for eliminating variables from a system of linear inequalities
many redundant constraints implied by other constraints. McMullen's upper bound theorem states that the number of non-redundant constraints grows as a single
Fourier–Motzkin_elimination
Extremal graph theory bound on clique-free graph edges
following proofs only give the upper bound of (1−1r)n22. Aigner & Ziegler (2018) list five different proofs of Turán's theorem. Many of the proofs involve
Turán's_theorem
Codes intended to correct short, contiguous errors in a communications channel
code is bounded from above by ℓ⩽n−k. Cyclic codes are considered optimal for burst error detection since they meet this upper bound: Theorem (Cyclic burst
Burst_error-correcting_code
Result about when a matrix can be diagonalized
In linear algebra and functional analysis, a spectral theorem is a result about when a linear operator or matrix can be diagonalized (that is, represented
Spectral_theorem
Upper bound in coding theory
the Singleton bound, named after the American mathematician Richard Collom Singleton (1928–2007), is a relatively crude upper bound on the size of an
Singleton_bound
Rational-number approximation of a real number
a comparison, one may want upper bounds or lower bounds of the accuracy. A lower bound is typically described by a theorem like "for every element α of
Diophantine_approximation
Relation between sides of a right triangle
In mathematics, the Pythagorean theorem or Pythagoras's theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle
Pythagorean_theorem
Every symmetric convex set in R^n with volume > 2^n contains a non-zero integer point
by exactly 1det(B) under an application of B−1. Minkowski's theorem gives an upper bound for the length of the shortest nonzero vector. This result has
Minkowski's_theorem
Upper bound on intersecting set families
theorem thus gives an upper bound for the number of pairwise overlapping hyperedges in an r-uniform hypergraph with n vertices and n≥2r. The theorem may
Erdős–Ko–Rado_theorem
On the number of common zeros of Laurent polynomials
Mathematical Journal. 7 (2): 169–171. MR 2337876. Bézout's theorem for another upper bound on the number of common zeros of n polynomials in n indeterminates
Bernstein–Kushnirenko_theorem
Approximation of a function by a polynomial
In calculus, Taylor's theorem gives an approximation of a k-times differentiable function around a given point by a polynomial of degree k, called the
Taylor's_theorem
Limits ideals to be checked in order to determine the class number of a number field
In algebraic number theory, Minkowski's bound gives an upper bound of the norm of ideals to be checked in order to determine the class number of a number
Minkowski's_bound
Mathematical theorem
mathematics, Bloch's theorem describes the behaviour of holomorphic functions defined on the unit disk. It gives a lower bound on the size of a disk
Bloch's theorem (complex analysis)
Bloch's_theorem_(complex_analysis)
Long dense subsets of the integers contain arbitrarily large arithmetic progressions
Szemerédi's theorem is equivalent to the asymptotic bound rk(N)=o(N). That is, rk(N) grows less than linearly with N. Van der Waerden's theorem, a precursor
Szemerédi's_theorem
Every polynomial has a real or complex root
The fundamental theorem of algebra, also called d'Alembert's theorem or the d'Alembert–Gauss theorem, states that every non-constant single-variable polynomial
Fundamental theorem of algebra
Fundamental_theorem_of_algebra
Ranges of numbers contained in each other
inscribed and circumscribed a unit circle, in order to get a lower and upper bound for the circles circumference - which is the circle number Pi (π). The
Nested_intervals
Mathematical inequality
w) making h(w)≜supz∈Zf(z,w) an upper bound on g(z) for any choice of w∈W. Because the supremum is the least upper bound, supz∈Zg(z)≤h(w) holds for all
Max–min_inequality
The upper bound plastic collapse theorem The lower bound plastic collapse theorem The lower bound shakedown theorem The upper bound shakedown theorem The
Limit_load_(physics)
On prime divisors of differences two nth powers
In number theory, Zsigmondy's theorem, named after Karl Zsigmondy, states that if a > b > 0 {\displaystyle a>b>0} are coprime integers, then for any integer
Zsigmondy's_theorem
subadditive ergodic theorem is one of several ergodic theorems. It can be seen as a generalization of Birkhoff's ergodic theorem. Intuitively, the subadditive
Kingman's subadditive ergodic theorem
Kingman's_subadditive_ergodic_theorem
Upper bound on the knowable information of a quantum state
Holevo's theorem is a result in quantum information theory. It is sometimes called Holevo's bound, since it gives an upper bound on the accessible information
Holevo's_theorem
Theorem about complexity measures of Boolean functions
have the upper bound s(f)≤n. Tal, improving on an earlier bound of Nisan and Szegedy, showed that s(f)≤deg(f)2. Note that for this upper bound, it is important
Sensitivity_theorem
Establishes the limits to possible data compression
with negligible probability of loss. The source coding theorem for symbol codes places upper and lower bounds on the minimal possible expected length
Shannon's source coding theorem
Shannon's_source_coding_theorem
Geometry of the location of polynomial roots
and explains why Cauchy's bound is more widely used than Lagrange's. Both bounds result from the Gershgorin circle theorem applied to the companion matrix
Geometrical properties of polynomial roots
Geometrical_properties_of_polynomial_roots
Bound on the number of incidences between points and lines in the plane
O(n2/3m2/3+n+m). This bound cannot be improved, except in terms of the implicit constants in its big O notation. An equivalent formulation of the theorem is the following
Szemerédi–Trotter_theorem
Sufficiency theorem for reconstructing signals from samples
The Nyquist–Shannon sampling theorem, or the sampling theorem, is a theorem in the field of signal processing which serves as a fundamental bridge between
Nyquist–Shannon sampling theorem
Nyquist–Shannon_sampling_theorem
Subset of Euclidean space is compact if and only if it is closed and bounded
closed and bounded. The theorem is sometimes also called the Borel–Lebesgue lemma. The history of what today is called the Heine–Borel theorem starts in
Heine–Borel_theorem
Mathematical optimization concept
upper bound. This gives the following LP: Minimize bTy subject to ATy ≥ c, y ≥ 0 This LP is called the dual of the original LP. The duality theorem has
Dual_linear_program
Mathematical theorem
complex-valued diagonalizable matrix. In its substance, it states an absolute upper bound for the deviation of one perturbed matrix eigenvalue from a properly
Bauer–Fike_theorem
Algebraic numbers are not near many rationals
Dirichlet's theorem gives μ ( α ) ≥ 2 {\displaystyle \mu (\alpha )\geq 2} when α {\displaystyle \alpha } is irrational. The first upper bound, restricting
Roth's_theorem
Given more time, a Turing machine can solve more problems
the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more
Time_hierarchy_theorem
Theorem in probability theory
Shiganov, I.S. (1986). "Refinement of the upper bound of a constant in the remainder term of the central limit theorem". Journal of Soviet Mathematics. 35 (3):
Berry–Esseen_theorem
Mathematical theorem
In mathematics, the transfinite recursion theorem says a function can be defined using a recursion over a well-ordered set; for example, ℕ but also over
Transfinite_recursion_theorem
Branch of mathematical combinatorics
proof, is an upper bound for a problem related to Ramsey theory. Another large example is the Boolean Pythagorean triples problem. Theorems in Ramsey theory
Ramsey_theory
Tool for analyzing divide-and-conquer algorithms
not depend on n. The theorem below also assumes that, as a base case for the recurrence, T(n)=Θ(1) when n is less than some bound κ>0, the smallest input
Master theorem (analysis of algorithms)
Master_theorem_(analysis_of_algorithms)
Theorem in functional analysis
the associated singular values. The min-max theorem can be extended to self-adjoint operators that are bounded below. Let A be a n × n Hermitian matrix.
Min-max_theorem
Mathematical result on order relations
In order theory, the Szpilrajn extension theorem (also called the order-extension principle), proved by Edward Szpilrajn in 1930, states that every partial
Szpilrajn_extension_theorem
Combinitorics of Polyhedra
Another important inequality on polytope face counts is given by the upper bound theorem, first proven by McMullen (1970), which states that a d-dimensional
Polyhedral_combinatorics
On polynomial rings over fields
In mathematics, Hilbert's syzygy theorem is one of the three fundamental theorems about polynomial rings over fields, first proved by David Hilbert in
Hilbert's_syzygy_theorem
Mathematical result or axiom on order relations
Lang's Algebra. The Bourbaki–Witt theorem states Let X be a nonempty poset in which each chain has a least upper bound (i,e., supremum). Then each function
Hausdorff_maximal_principle
Theorem in topology
Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer. It states that for any continuous function f mapping
Brouwer_fixed-point_theorem
On when a set of compact Riemannian manifolds of a given dimension is relatively compact
manifolds with a fixed lower bound on the Ricci curvature, the crucial covering condition in Gromov's metric compactness theorem is automatically satisfied
Gromov's compactness theorem (geometry)
Gromov's_compactness_theorem_(geometry)
Mathematics of real numbers and real functions
number (an upper bound), then there is a least upper bound, that is an upper bound that is smaller than all of the others. Most of the theorems that are
Real_analysis
Concept in cryptography theory
give an upper bound on the cost) and lower bound strategies have been developed. For most functions, there is a large gap between the known upper and lower
Conditional disclosure of secrets
Conditional_disclosure_of_secrets
Concept of complex analysis
In complex analysis, the residue theorem, sometimes called Cauchy's residue theorem, is a powerful tool to evaluate line integrals of analytic functions
Residue_theorem
Fundamental theorem in probability theory and statistics
where sup denotes the supremum (i.e. least upper bound) of the set. In this variant of the central limit theorem the random variables Xi have to be independent
Central_limit_theorem
Theorem in order and lattice theory
f γ for a limit ordinal γ is the least upper bound of the f β for all β ordinals less than γ. The dual theorem holds for the greatest fixpoint. For example
Knaster–Tarski_theorem
Result in combinatorics and graph theory
mathematics, Hall's marriage theorem, proved by Philip Hall (1935), is a theorem with two equivalent formulations. In each case, the theorem gives a necessary and
Hall's_marriage_theorem
Continuous maps on a closed subset of a normal space can be extended
that is, if f is bounded then F may be chosen to be bounded (with the same bound as f). We prove the theorem in the case where f is bounded. The function
Tietze_extension_theorem
Collection of mathematical objects of finite size
is called an upper bound of S. The terms bounded from below and lower bound are similarly defined. A set S is bounded if it has both upper and lower bounds
Bounded_set
Theorem in Ramsey theory
of W(r, k) for most values of r and k. The proof of the theorem provides only an upper bound. For the case of r = 2 and k = 3, for example, the argument
Van_der_Waerden's_theorem
Conditions for switching order of integration in calculus
n=∑n=1∞∑m=1∞am,n. A special case of Fubini's theorem for continuous functions on the product of closed, bounded subsets of real vector spaces was known to
Fubini's_theorem
Well-quasi-ordering of finite trees
In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under
Kruskal's_tree_theorem
Unsolved problem in extremal graph theory
removed vertices forms a K3,3 subgraph. The Kővári–Sós–Turán theorem provides an upper bound on the solution to the Zarankiewicz problem. It was established
Zarankiewicz_problem
better rate vs. distance tradeoff than is given by the Gilbert–Varshamov bound. Theorem: Let q⩾2. For every 0⩽δ<1−1q and 0<ε⩽1−Hq(δ), there exists a q-ary linear
Gilbert–Varshamov bound for linear codes
Gilbert–Varshamov_bound_for_linear_codes
Theorem stating that pointwise boundedness implies uniform boundedness
thus bounded operators) whose domain is a Banach space, pointwise boundedness is equivalent to uniform boundedness in operator norm. The theorem was first
Uniform_boundedness_principle
Uniqueness theorem in complex analysis
Carlson's theorem has generalized analogues for other expansions. Assume that f satisfies the following three conditions. The first two conditions bound the
Carlson's_theorem
Term in mathematics
characterisations: The least-upper-bound property The greatest-lower-bound property The nested interval property The Bolzano-Weierstrass theorem The convergence of
Characterization (mathematics)
Characterization_(mathematics)
Theorem bounding chromatic number of symmetric graphs
The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general).
Symmetric_hypergraph_theorem
Mathematical theorem
In mathematics, Vincent's theorem—named after Alexandre Joseph Hidulphe Vincent [fr]—is a theorem that isolates the real roots of polynomials with rational
Vincent's_theorem
Generative adversarial network variant
and consequently the upper bound:‖D‖L≤∏i=1n‖Wi‖sThus, if we can upper-bound operator norms ‖Wi‖s of each matrix, we can upper-bound the Lipschitz norm of
Wasserstein_GAN
Theorem about consecutive perfect powers
transcendence theory to establish a bound on a,b and used existing results bounding x,y in terms of a, b to give an effective upper bound for x,y,a,b. Michel Langevin
Catalan's_conjecture
Theorem in number theory
these intervals dominate the integral, hence to prove the theorem one has to give an upper bound for S ( α ) {\displaystyle S(\alpha )} for α {\displaystyle
Vinogradov's_theorem
Form of logic that allows quantification over predicates
reals has arbitrarily large models due to the compactness theorem. Thus the least-upper-bound property cannot be expressed by any set of sentences in first-order
Second-order_logic
Physics theorem
virial theorem provides a general equation that relates the average over time of the total kinetic energy of a stable system of discrete particles, bound by
Virial_theorem
have Ω(n1+1/k) edges? More unsolved problems in mathematics The bound of Erdős's theorem is tight up to constant factors for some small values of k: for
Even_circuit_theorem
named after Rajendra Bhatia and Chandler Davis, is an upper bound on the variance σ2 of any bounded probability distribution on the real line. Despite its
Bhatia–Davis_inequality
Fixed-point theorem
non-empty poset that is chain complete, meaning each chain has a least upper bound, and f : X → X {\displaystyle f:X\to X} is a function such that f ( x
Bourbaki–Witt_theorem
and an upper bound on its book thickness is 5. Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-Regular Graphs, Springer-Verlag, Theorem 9.2.9
Wells_graph
Theorem on graph coloring on surfaces
1976 as the four color theorem by Haken and Appel. On the sphere the lower bound is easy, whereas for higher genera the upper bound is easy and was proved
Heawood_conjecture
travel, tourism, insurance
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
UPPER BOUND-THEOREM
travel, tourism, insurance