Sciweavers

173 search results - page 5 / 35
» A Proof of the Two-path Conjecture
Sort
View
JGT
2010
103views more  JGT 2010»
13 years 5 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
CMA
2010
68views more  CMA 2010»
13 years 4 months ago
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
Sandi Klavzar, Khaled Salem, Andrej Taranenko
CADE
2012
Springer
11 years 9 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Fractional generalizations of Young and Brunn-Minkowski inequalities
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
Sergey Bobkov, Mokshay M. Madiman, Liyao Wang
CADE
2007
Springer
14 years 1 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak