Sciweavers

7796 search results - page 190 / 1560
» On Generalized Schur Numbers
Sort
View
JCT
2006
64views more  JCT 2006»
15 years 6 months ago
Inequalities between Littlewood-Richardson coefficients
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded ...
François Bergeron, Riccardo Biagioli, Merce...
GC
2007
Springer
15 years 6 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
TCS
2008
15 years 6 months ago
Constructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
Arnon Avron
JALC
2007
84views more  JALC 2007»
15 years 6 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 6 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley