#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1975

2017

- This year (3)
- Last 5 years (5)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- René Schott, G. Stacey Staples
- Eur. J. Comb.
- 2008

- G S Staples
- Journal of neurosurgery
- 1979

- René Schott, G. Stacey Staples
- Ars Comb.
- 2011

While powers of the adjacency matrix of a finite graph reveal information about walks on the graph, they fail to distinguish closed walks from cycles. Using elements of an appropriate commutative, nilpotent-generated algebra, a " new " adjacency matrix can be associated with a random graph on n vertices and |E| edges of nonzero probability. Letting X k… (More)

A number of combinatorial problems are treated using properties of abelian nilpotent-and idempotent-generated subalgebras of Clifford algebras. For example, the problem of deciding whether or not a graph contains a Hamiltonian cycle is known to be NP-complete. By considering entries of Λ k , where Λ is an appropriate nilpotent adjacency matrix, the k-cycles… (More)

- René Schott, G. Stacey Staples
- Computers & Mathematics with Applications
- 2011

- Hugo Cruz-Sanchez, G. Stacey Staples, René Schott, Yeqiong Song
- GLOBECOM
- 2007

—An innovative minimal paths algorithm based on operator calculus in graded semigroup algebras is described. Classical approaches to routing problems invariably require construction of trees and the use of heuristics to prevent com-binatorial explosion. The operator calculus approach presented herein, however, allows such explicit tree constructions to be… (More)

- Bilel Nefzi, René Schott, Yeqiong Song, G. Stacey Staples, Evangelia Tsiontsiou
- MobiHoc
- 2015

Wireless sensor networks (WSN) are inherently multi - constrained. They need to preserve energy while offering reliable and timely data reporting for a non-negligible number of scenarios. This is particularly true when a node should decide which forwarder has to be chosen for routing a packet. Nevertheless, solving multi-constrained routing problems is… (More)

Questions about a graph's connected components are answered by studying appropriate powers of a special " adjacency matrix " constructed with entries in a commutative algebra whose generators are idempotent. The approach is then applied to the Erdös-Rényi model of sequences of random graphs. Developed herein is a method of encoding the relevant information… (More)

A combinatorial construction of the multiple stochastic integral is developed using sequences in Clifford (geometric) algebras. In particular, sequences of Berezin integrals in an ascending chain of geometric algebras converge in mean to the iterated stochastic integral. By embedding such chains within an infinite-dimensional Clifford algebra, an… (More)

- Zeon Roots, Lisa M. Dollar, Stacey Staples, G. Stacey Staples
- 2017

Zeon algebras can be thought of as commutative analogues of fermion algebras, and they can be constructed as subalgebras within Clifford algebras of appropriate signature. Their inherent combinatorial properties make them useful for applications in graph enumeration problems and evaluating functions defined on partitions. In this paper, kth roots of… (More)