Sciweavers

Share
JCSS
2011
107views more  JCSS 2011»
9 years 5 months ago
The isomorphism conjecture for constant depth reductions
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
Manindra Agrawal
MLQ
2007
73views more  MLQ 2007»
9 years 10 months ago
Existence of EF-equivalent non-isomorphic models
Abstract. We prove the existence of pairs of models of the same cardinality λ which are very equivalent according to EF games, but not isomorphic. We continue the paper [4], but w...
Chanoch Havlin, Saharon Shelah
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
9 years 10 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
9 years 10 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
Martin Klazar
GC
2007
Springer
9 years 10 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen
JCT
2008
68views more  JCT 2008»
9 years 10 months ago
Pseudo 2-factor isomorphic regular bipartite graphs
A graph is pseudo 2
Marien Abreu, A. A. Diwan, Bill Jackson, Domenico ...
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
9 years 10 months ago
On Self-Complementary Cyclic Packing of Forests
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
TLCA
2009
Springer
10 years 5 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
books