85 citations
- University of California, BerkeleyUS2 papers
- Center for Mathematical ModelingCL1 paper
- Centre de Recherche en Mathématiques de la DécisionFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Dartmouth CollegeUS1 paper
- Dartmouth HospitalGB1 paper
- Delhi Integrated Multi-Modal Transit SystemIN1 paper
- Duke UniversityUS1 paper
- East Tennessee State UniversityUS1 paper
- Emory UniversityUS1 paper
- Howard UniversityUS1 paper
- Laboratoire de Mathématiques Jean LerayFR1 paper
14 papers
Domination Cover Pebbling: Structural Results
Nathaniel G. Watson, Carl R. Yerger
This paper continues the results of "Domination Cover Pebbling: Graph Families." An almost sharp bound for the domination cover pebbling (DCP) number for graphs G with specified di…
Stochastic Transition States: Reaction Geometry amidst Noise
Thomas Bartsch, Rigoberto Hernandez, T. Uzer
Classical transition state theory (TST) is the cornerstone of reaction rate theory. It postulates a partition of phase space into reactant and product regions, which are separated…
On Extensions of a Theorem of Baxter
J. S. Geronimo, A. Martinez-Finkelshtein
We combine the Riemann-Hilbert approach with the techniques of Banach algebras to obtain an extension of Baxter's Theorem for polynomials orthogonal on the unit circle. This is acc…
Some Remarks on the Jacobian Conjecture and Connections with Hilbert's Irreducibility Theorem
Richard J. Lipton, Evangelos Markakis
We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our firs…
Inferring AS Relationships: Dead End or Lively Beginning?
Xenofontas Dimitropoulos, Dmitri Krioukov, Bradley Huffaker +2
Recent techniques for inferring business relationships between ASs have yielded maps that have extremely few invalid BGP paths in the terminology of Gao. However, some relationship…
Domination Cover Pebbling: Graph Families
James Gardner, Anant P. Godbole, Alberto Mokak Teguia +3
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of thes…