Sciweavers

1139 search results - page 146 / 228
» Bounded Ideation Theory
Sort
View
COMBINATORICS
2004
76views more  COMBINATORICS 2004»
13 years 7 months ago
Geometrically Constructed Bases for Homology of Partition Lattices
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
Anders Björner, Michelle L. Wachs
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
JAL
2002
99views more  JAL 2002»
13 years 7 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
MOC
1998
65views more  MOC 1998»
13 years 7 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya
TGIS
2002
137views more  TGIS 2002»
13 years 7 months ago
Spatio-Temporal Object-Oriented Data Model for Disaggregate Travel Behavior
The research field of transportation demand forecasting has started to focus on disaggregate travel behavior and micro-simulation models. To create data infrastructure, disaggrega...
Ali Frihida, Danielle J. Marceau, Marius Thé...