68 search results - page 13 / 14 » ejc 2010 |
EJC
2010
13 years 4 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 4 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 5 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
EJC
2010
13 years 5 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
EJC
2010
13 years 5 months ago
2010
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...