Sciweavers

73 search results - page 5 / 15
» A Permutation Regularity Lemma
Sort
View
AML
2008
74views more  AML 2008»
13 years 6 months ago
Homogeneous iteration and measure one covering relative to HOD
Relative to a hyperstrong cardinal, it is consistent that measure one covering fails relative to HOD. In fact it is consistent that there is a superstrong cardinal and for every re...
Natasha Dobrinen, Sy D. Friedman
COMBINATORICS
2002
60views more  COMBINATORICS 2002»
13 years 6 months ago
Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
Catalin Zara
LATA
2009
Springer
14 years 1 months ago
On Extended Regular Expressions
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
Benjamin Carle, Paliath Narendran
JSYML
1998
41views more  JSYML 1998»
13 years 6 months ago
A Many Permutation Group Result for Unstable Theories
Abstract. We extend Shelah’s first many model result to show that an unstable theory has 2κ many non-permutation group isomorphic models of size κ, where κ is an uncountable ...
Mark D. Schlatter
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 1 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira