Sciweavers

300 search results - page 33 / 60
» Extension of a theorem of Whitney
Sort
View
JCT
2007
90views more  JCT 2007»
13 years 7 months ago
Overpartitions, lattice paths, and Rogers-Ramanujan identities
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
Sylvie Corteel, Olivier Mallet
DCC
2008
IEEE
14 years 7 months ago
The trace of an optimal normal element and low complexity normal bases
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
Maria Christopoulou, Theodoulos Garefalakis, Danie...
ECOOP
1998
Springer
14 years 1 days ago
A Study of The Fragile Base Class Problem
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System d...
Leonid Mikhajlov, Emil Sekerinski
JANCL
2008
170views more  JANCL 2008»
13 years 7 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
JSYML
2008
72views more  JSYML 2008»
13 years 7 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson