Results 1 to 10 of about 6,993 (154)
Dynamic programming for graphs on surfaces [PDF]
, 2010 We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
B. Courcelle +15 more
core +5 more sources
The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective [PDF]
European Journal of Operational Research, 2020 In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu. We prove that the problem is well-defined and (weakly) polynomial when (i) there is a way to reach the target state from any initial
Guillot, Matthieu, Stauffer, Gautier
openaire +3 more sources
Ricci Curvature on Polyhedral Surfaces via Optimal Transportation
Axioms, 2014 The problem of correctly defining geometric objects, such as the curvature, is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs.
Benoît Loisel, Pascal Romon
doaj +1 more source
Polyhedral computational geometry for averaging metric phylogenetic trees [PDF]
, 2014 This paper investigates the computational geometry relevant to calculations of the Frechet mean and variance for probability distributions on the phylogenetic tree space of Billera, Holmes and Vogtmann, using the theory of probability measures on spaces ...
Miller, Ezra +2 more
core +3 more sources
Polyhedral combinatorics of UPGMA cones
Advances in Applied Mathematics, 2013 Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm.
Davidson, Ruth, Sullivant, Seth
openaire +2 more sources
Moment-angle manifolds and Panov's problem [PDF]
, 2015 We answer a problem posed by Panov, which is to describe the relationship between the wedge summands in a homotopy decomposition of the moment-angle complex corresponding to a disjoint union of k points and the connected sum factors in a diffeomorphism ...
Theriault, Stephen
core +1 more source
Vertices of Gelfand-Tsetlin Polytopes [PDF]
, 2003 This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory $\mathfrak{gl}_n \C$ and algebraic combinatorics.
De Loera, Jesús A. +1 more
core +1 more source
A curvature theory for discrete surfaces based on mesh parallelity
, 2009 We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces' areas and mixed areas.
Bobenko, Alexander I. +2 more
core +4 more sources
Leggett-Garg inequalities and the geometry of the cut polytope [PDF]
, 2010 The Bell and Leggett-Garg tests offer operational ways to demonstrate that non-classical behavior manifests itself in quantum systems, and experimentalists have implemented these protocols to show that classical worldviews such as local realism and ...
Avis, David +2 more
core +3 more sources
Group field theories for all loop quantum gravity
, 2015 Group field theories represent a 2nd quantized reformulation of the loop quantum gravity state space and a completion of the spin foam formalism. States of the canonical theory, in the traditional continuum setting, have support on graphs of arbitrary ...
Oriti, Daniele +2 more
core +1 more source