Sciweavers

SIAMDM
2010
92views more  SIAMDM 2010»
13 years 3 months ago
On Face Vectors of Barycentric Subdivisions of Manifolds
Abstract. We study face vectors of barycentric subdivisions of simplicial homology manifolds. Recently, Kubitzke and Nevo proved that the g-vector of the barycentric subdivision of...
Satoshi Murai
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 3 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
SIAMDM
2010
110views more  SIAMDM 2010»
13 years 3 months ago
Embedding Spanning Trees in Random Graphs
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
Michael Krivelevich
SIAMDM
2010
74views more  SIAMDM 2010»
13 years 3 months ago
Dominating Subsets under Projections
Rom Pinchasi, Allan Pinkus
SIAMDM
2010
91views more  SIAMDM 2010»
13 years 3 months ago
Embedding into Bipartite Graphs
Abstract. The conjecture of Bollob
Julia Böttcher, Peter Heinig, Anusch Taraz
SIAMDM
2010
111views more  SIAMDM 2010»
13 years 3 months ago
Hopf Structures on the Multiplihedra
We investigate algebraic structures that can be placed on vertices of the multiplihedra, a family of polytopes originating in the study of higher categories and homotopy theory. Mo...
Stefan Forcey, Aaron Lauve, Frank Sottile
SIAMDM
2010
87views more  SIAMDM 2010»
13 years 3 months ago
On 3-Hypergraphs with Forbidden 4-Vertex Configurations
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
Alexander A. Razborov
SIAMDM
2010
87views more  SIAMDM 2010»
13 years 3 months ago
Set Systems without a Strong Simplex
A d-simplex is a collection of d + 1 sets such that every d of them have non-empty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of...
Tao Jiang, Oleg Pikhurko, Zelealem Yilma
SIAMDM
2010
101views more  SIAMDM 2010»
13 years 3 months ago
Vision-Based Pursuit-Evasion in a Grid
We revisit the problem of pursuit-evasion in a grid introduced by Sugihara and Suzuki in the lineof-sight vision model. Consider an arbitrary evader Z with the maximum speed of 1 ...
Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel ...