Related papers: Different Volume Computation Methods of Graph Poly…
It is proven that the volume of an infinitesimally flexible polyhedron in $R^3$ is a multiple root of its volume polynomial.
Purpose: This study aims to assess the robustness and accuracy of the face-centred finite volume (FCFV) method for the simulation of compressible laminar flows in different regimes, using numerical benchmarks. Design/methodology/approach:…
Computational fluid dynamics (CFD) is a branch of fluid mechanics that uses numerical methods to solve fluid flows. The finite volume method (FVM) is an important one. In FVM, space is discretized to many grid cells. When the number of grid…
Affine su(3) and su(4) fusion multiplicities are characterised as discretised volumes of certain convex polytopes. The volumes are measured explicitly, resulting in multiple sum formulas. These are the first polytope-volume formulas for…
We study the classic matrix cross approximation based on the maximal volume submatrices. Our main results consist of an improvement of the classic estimate for matrix cross approximation and a greedy approach for finding the maximal volume…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
We define a Bowen-Series like map for every geometric presentation of a co-compact surface group and we prove that the volume entropy of the presentation is the topological entropy of this particular (circle) map. Finally we find the…
We show how to compute vacuum expectation values from derivative expansions of the vacuum wave functional. Such expansions appear to be valid only for slowly varying fields, but by exploiting analyticity in a complex scale parameter we can…
We compute the volumes of convex bodies that are given by inequalities of concave polynomials. These volumes are found to arbitrary precision thanks to the representation of periods by linear differential equations. Our approach rests on…
In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
We compute the canonical form of the cosmological polytope for any graph in terms of the dual of the shifted cosmological polytope in two different ways. On the way, we provide an explicit coordinate description of the dual of the…
A new finite volume (FV) discretisation method for the Lattice Boltzmann (LB) equation which combines high accuracy with limited computational cost is presented. In order to assess the performance of the FV method we carry out a systematic…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We show that the volume of the inner $r$-neighborhood of a polytope in the $d$-dimensional Euclidean space is a pluri-phase Steiner-like function, i.e. a continuous piecewise polynomial function of degree $d$, proving thus a conjecture of…
We give a very simple approach to the computation of tube volumes of self-similar sprays using a functional equation satisfied by them.
Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5…
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…
Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…