EJC
2010
12 years 11 months ago
2010
As a computational model of natural language communication, Database Semantics1 (DBS) includes a hearer mode and a speaker mode. For the content to be mapped into language expressi...
EJC
2010
12 years 11 months ago
2010
We all use our associative memory constantly. Words and concepts form paths that we can follow to find new related concepts; for example, when we think about a car we may associate...
EJC
2010
13 years 1 months ago
2010
EJC
2010
13 years 1 months ago
2010
EJC
2010
13 years 1 months ago
2010
EJC
2010
13 years 2 months ago
2010
The Rogers-Ramanujan Identities have many natural and significant generalizations. The generalization presented in this note was first studied by D. Bressoud, by considering the...
EJC
2010
13 years 2 months ago
2010
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent po...
EJC
2010
13 years 4 months ago
2010
3 For d, k N with k 2d, let g(d, k) denote the infimum density of binary4 sequences (xi)iZ {0, 1}Z which satisfy the minimum degree condition d j=1 (xi+j +5
EJC
2010
13 years 4 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
EJC
2010
13 years 4 months ago
2010
We prove that for any fixed r 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the...