8810 search results - page 467 / 1762 » Openness |
158
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we...
178
click to vote
JSYML
2002
15 years 6 months ago
2002
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symb...
175
click to vote
TCS
1998
15 years 6 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pe...
136
click to vote
MLQ
2007
15 years 6 months ago
2007
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...