Related papers: Different Volume Computation Methods of Graph Poly…
PQ-type adjacency polytopes $\nabla^{\rm PQ}_G$ are lattice polytopes arising from finite graphs $G$. There is a connection between $\nabla^{\rm PQ}_G$ and the engineering problem known as power-flow study, which models the balance of…
In this note, a new method for deriving the volume of hypersphere is proposed by using probability theory. The explicit expression of the multiple times convolution of the probability density functions we should use is very complicated. But…
Analytic relations are derived for finite volume integrals over the radial distribution function of a fluid, so-called Kirkwood-Buff integrals. Closed form expressions are obtained for cubes and cuboids, the system shapes commonly employed…
We study the expected volume of random polytopes generated by taking the convex hull of independent identically distributed points from a given distribution. We show that for log-concave distributions supported on convex bodies, we need at…
Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…
Centered finite volume methods are considered in the context of Numerical Relativity. A specific formulation is presented, in which third-order space accuracy is reached by using a piecewise-linear reconstruction. This formulation can be…
In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a…
A straightforward and computationally efficient Consecutive Cubic Spline (CCS) iterative algorithm is proposed for positioning the planar interface of the unstructured geometrical Volume-of-Fluid method in arbitrarily-shaped cells. The CCS…
We define and study the dual mixed volume rational function of a sequence of polytopes, a dual version of the mixed volume polynomial. This concept has direct relations to the adjoint polynomials and the canonical forms of polytopes. We…
Compressible interfacial multiphase flows (CIMF) are essential to different applications, such as liquid fuel injection in supersonic propulsion systems. Since high-level details in CIMF are often difficult to measure in experiments,…
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…
This work presents the face-centred finite volume (FCFV) paradigm for the simulation of compressible flows. The FCFV method defines the unknowns at the face barycentre and uses a hybridisation procedure to eliminate all the degrees of…
The n'th Birkhoff polytope $B_n$ is the set of all doubly stochastic $n \times n$ matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A long-standing open problem is the…
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
The goal of the present paper is to understand the impact of numerical schemes for the reconstruction of data at cell faces in finite-volume methods, and to assess their interaction with the quadrature rule used to compute the average over…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…