Sciweavers

59 search results - page 1 / 12
» A Pushing-Pulling Method: New Proofs of Intersection Theorem...
Sort
View
COMBINATORICA
1999
54views more  COMBINATORICA 1999»
13 years 10 months ago
A Pushing-Pulling Method: New Proofs of Intersection Theorems
Rudolf Ahlswede, Levon H. Khachatrian
CORR
2010
Springer
57views Education» more  CORR 2010»
13 years 11 months ago
A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code
We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consid...
Elodie Leducq
ENTCS
2002
66views more  ENTCS 2002»
13 years 10 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel
JCT
2010
80views more  JCT 2010»
13 years 9 months ago
Shadows and intersections in vector spaces
We prove a vector space analog of a version of the Kruskal-Katona theorem due to Lov´asz. We apply this result to extend Frankl’s theorem on r-wise intersecting families to vec...
Ameera Chowdhury, Balázs Patkós
MP
2007
91views more  MP 2007»
13 years 10 months ago
Set Intersection Theorems and Existence of Optimal Solutions
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
Dimitri P. Bertsekas, Paul Tseng