AbstractA uniform proof is given for various (known) theorems asserting the convexity of a set S of integers, e.g., S the set of cardinalities of finite irredundant sets of axioms for an equational theory (Tarski), or S the set of cardinalities of complete homomorphic images of a graph (Harary, Hedetniemi and Prins). The same proof also yields some convexity results for coverings and packings
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.Includes bibliogr...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
AbstractA uniform proof is given for various (known) theorems asserting the convexity of a set S of ...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
SIGLETIB: RN 4052 (85368-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Copyright © 2004 Hindawi Publishing Corporation. This is an open access article distributed under th...
Known properties of "canonical connections" from database theory and of "closed sets" from statistic...
Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a...
The notion of convex set for subsets of lattices in one particular case was introduced in [1], where...
We present some complexity results concerning the problems of covering a graph with p convex sets an...
The relations between the complex theory of interpolation for families of Banach spaces and the noti...
International audienceIn this paper we show that every sufficiently large family of convex bodies in...
We present two important theorems in combinatorial algebraic topology and convex combinatorial geome...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.Includes bibliogr...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
AbstractA uniform proof is given for various (known) theorems asserting the convexity of a set S of ...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
SIGLETIB: RN 4052 (85368-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Copyright © 2004 Hindawi Publishing Corporation. This is an open access article distributed under th...
Known properties of "canonical connections" from database theory and of "closed sets" from statistic...
Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a...
The notion of convex set for subsets of lattices in one particular case was introduced in [1], where...
We present some complexity results concerning the problems of covering a graph with p convex sets an...
The relations between the complex theory of interpolation for families of Banach spaces and the noti...
International audienceIn this paper we show that every sufficiently large family of convex bodies in...
We present two important theorems in combinatorial algebraic topology and convex combinatorial geome...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.Includes bibliogr...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
See also arXiv:1301.0760International audienceWe show analogues of the classical Krein-Milman theore...
DOI
Add to ORKG