Results 1  10
of
473,736
On the Partitioned Version of the ErdösSzekeres Theorem
, 2002
"... Let k 4. A nite planar point set X is called a convex k clustering, if it is a disjoint union of k sets X1 ; : : : ; Xk of equal sizes such that x1x2 : : : xk is a convex kgon for each choice of x1 2 X1 ; : : : ; xk 2 Xk . Answering a question of Gil Kalai, we show that for every k 4 there ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
strengthens the socalled positive fraction Erd}os{Szekeres theorem proved by Barany and Valtr. The proof gives reasonable estimates on c and c , and it works also in higher dimensions. We also improve the previous constants for the positive fraction Erd}os{Szekeres theorem obtained by Pach
Note on the ErdösSzekeres theorem
, 1997
"... Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n in convex position. In 1935 P. Erdos and G. Szekeres showed that g(n) exists and 2 n\Gamma2 + 1 g(n) i 2n\Gamma4 n\Gamma2 j + 1. Recently, the upper bound has been slightly ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n in convex position. In 1935 P. Erdos and G. Szekeres showed that g(n) exists and 2 n\Gamma2 + 1 g(n) i 2n\Gamma4 n\Gamma2 j + 1. Recently, the upper bound has been
An ErdösSzekeres type problem in the plane
"... Let f(k; n), n k 3, denote the smallest positive integer such that any set of f(k; n) points, in general position in the plane, contains n points whose convex hull has at least k vertices. We give lower and upper estimates on f(k; n), both in the form (kn) + 2 (k) . ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let f(k; n), n k 3, denote the smallest positive integer such that any set of f(k; n) points, in general position in the plane, contains n points whose convex hull has at least k vertices. We give lower and upper estimates on f(k; n), both in the form (kn) + 2 (k) .
The ErdösSzekeres theorem: upper bounds and related results
 in Combinatorial and Computational Geometry
, 2004
"... Let ES(n) denote the least integer such that among any ES(n) points in general position in the plane there are always n in convex position. In 1935, P. Erdös and G. Szekeres showed that ES(n) exists and ES(n) ≤ + 1. About 62 years later, the upper bound has been slightly improved by Chung and ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Let ES(n) denote the least integer such that among any ES(n) points in general position in the plane there are always n in convex position. In 1935, P. Erdös and G. Szekeres showed that ES(n) exists and ES(n) ≤ + 1. About 62 years later, the upper bound has been slightly improved by Chung
HigherOrder Abstract Syntax
"... We describe motivation, design, use, and implementation of higherorder abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding informat ..."
Abstract

Cited by 358 (18 self)
 Add to MetaCart
We describe motivation, design, use, and implementation of higherorder abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or syntax incorporates name binding
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
. Isabelle is now based on higherorder logic  a precise and wellunderstood foundation. Examples illustrate use of this metalogic to formalize logics and proofs. Axioms for firstorder logic are shown sound and complete. Backwards proof is formalized by metareasoning about objectlevel entailment
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 507 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
Good News and Bad News: Representation Theorems and Applications
 Bell Journal of Economics
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract

Cited by 684 (3 self)
 Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 362 (10 self)
 Add to MetaCart
representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful
Results 1  10
of
473,736