Convex polytopes and Gaussian covariances

1996 ◽  
Vol 28 (2) ◽  
pp. 343-343
Author(s):  
R. A. Vitale
Keyword(s):  
Convex Polytopes ◽  
Convex Geometry ◽  
Steiner Point ◽  
Euler Identity

Siegel (1993) presented a covariance identity involving normal variables that seems to flout notions of dependence. We show that it has an explanation from an unexpected quarter: convex geometry and the centroid known as the Steiner point. In the same geometric spirit, we introduce another identity for Gaussian covariances based on an Euler identity for the Steiner point.

The Convex Polytopes and Homogeneous Coordinate Rings of Bivariate Polynomials

2019 ◽  
Vol 16 (2) ◽  
pp. 1
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’Aini Aris ◽  
Azlina Jumadi
Keyword(s):  
Convex Polytopes ◽  
Polynomial Systems ◽  
Matrix Formulation ◽  
Bivariate Polynomials ◽  
Homogeneous Coordinates ◽  
The Matrix ◽  
Projective Vector ◽  
Coordinate Rings ◽  
Resultant Matrix ◽  
The Given

Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.

Bounds on the partition dimension of convex polytopes

2020 ◽  
Vol 23 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Faisal Nadeem ◽  
Mohammad Azeem
Keyword(s):  
Combinatorial Optimization ◽  
Computer Science ◽  
Facility Location ◽  
Robot Navigation ◽  
Convex Polytopes ◽  
Pharmaceutical Chemistry ◽  
Resolving Set ◽  
Minimum Number ◽  
Partition Dimension ◽  
Np Problem

Aims and Objective: The idea of partition and resolving sets plays an important role in various areas of engineering, chemistry and computer science such as robot navigation, facility location, pharmaceutical chemistry, combinatorial optimization, networking, and mastermind game. Method: In a graph to obtain the exact location of a required vertex which is unique from all the vertices, several vertices are selected this is called resolving set and its generalization is called resolving partition, where selected vertices are in the form of subsets. Minimum number of partitions of the vertices into sets is called partition dimension. Results: It was proved that determining the partition dimension a graph is nondeterministic polynomial time (NP) problem. In this article, we find the partition dimension of convex polytopes and provide their bounds. Conclusion: The major contribution of this article is that, due to the complexity of computing the exact partition dimension we provides the bounds and show that all the graphs discussed in results have partition dimension either less or equals to 4, but it cannot been be greater than 4.

scholarly journals A short note on extreme points of certain polytopes

2020 ◽  
Vol 8 (1) ◽  
pp. 36-39
Author(s):  
Lei Cao ◽  
Ariana Hall ◽  
Selcuk Koyuncu
Keyword(s):  
Short Proof ◽  
Convex Polytopes ◽  
Short Note ◽  
Convex Polytope ◽  
Extreme Points ◽  
Alternative Proof ◽  
Stochastic Matrices ◽  
Doubly Stochastic ◽  
Birkhoff's Theorem ◽  
Birkhoff’S Theorem

AbstractWe give a short proof of Mirsky’s result regarding the extreme points of the convex polytope of doubly substochastic matrices via Birkhoff’s Theorem and the doubly stochastic completion of doubly sub-stochastic matrices. In addition, we give an alternative proof of the extreme points of the convex polytopes of symmetric doubly substochastic matrices via its corresponding loopy graphs.

scholarly journals Quantum Polar Duality and the Symplectic Camel: A New Geometric Approach to Quantization

2021 ◽  
Vol 51 (3) ◽  
Author(s):  
Maurice A. de Gosson
Keyword(s):  
Uncertainty Principle ◽  
Convex Geometry ◽  
Geometric Approach ◽  
Point Of View ◽  
Reconstruction Problem ◽  
Orthogonal Projections ◽  
Topological Version ◽  
Mahler Conjecture ◽  
Quantum Indeterminacy ◽  
Dual Quantum

AbstractWe define and study the notion of quantum polarity, which is a kind of geometric Fourier transform between sets of positions and sets of momenta. Extending previous work of ours, we show that the orthogonal projections of the covariance ellipsoid of a quantum state on the configuration and momentum spaces form what we call a dual quantum pair. We thereafter show that quantum polarity allows solving the Pauli reconstruction problem for Gaussian wavefunctions. The notion of quantum polarity exhibits a strong interplay between the uncertainty principle and symplectic and convex geometry and our approach could therefore pave the way for a geometric and topological version of quantum indeterminacy. We relate our results to the Blaschke–Santaló inequality and to the Mahler conjecture. We also discuss the Hardy uncertainty principle and the less-known Donoho–Stark principle from the point of view of quantum polarity.

scholarly journals Continuous Maps from Spheres Converging to Boundaries of Convex Hulls

2021 ◽  
Vol 9 ◽  
Author(s):  
Joseph Malkoun ◽  
Peter J. Olver
Keyword(s):  
Convex Hull ◽  
Convex Geometry ◽  
Gauss Map ◽  
Parameter Family ◽  
Convex Hulls ◽  
Dimensional Sphere ◽  
Continuous Maps ◽  
Dimensional Boundary

Abstract Given n distinct points $\mathbf {x}_1, \ldots , \mathbf {x}_n$ in $\mathbb {R}^d$ , let K denote their convex hull, which we assume to be d-dimensional, and $B = \partial K $ its $(d-1)$ -dimensional boundary. We construct an explicit, easily computable one-parameter family of continuous maps $\mathbf {f}_{\varepsilon } \colon \mathbb {S}^{d-1} \to K$ which, for $\varepsilon> 0$ , are defined on the $(d-1)$ -dimensional sphere, and whose images $\mathbf {f}_{\varepsilon }({\mathbb {S}^{d-1}})$ are codimension $1$ submanifolds contained in the interior of K. Moreover, as the parameter $\varepsilon $ goes to $0^+$ , the images $\mathbf {f}_{\varepsilon } ({\mathbb {S}^{d-1}})$ converge, as sets, to the boundary B of the convex hull. We prove this theorem using techniques from convex geometry of (spherical) polytopes and set-valued homology. We further establish an interesting relationship with the Gauss map of the polytope B, appropriately defined. Several computer plots illustrating these results are included.

scholarly journals Translating between the representations of a ranked convex geometry

2021 ◽  
Vol 344 (7) ◽  
pp. 112399
Author(s):  
Oscar Defrain ◽  
Lhouari Nourine ◽  
Simon Vilmin
Keyword(s):  
Convex Geometry

scholarly journals A Gibbs Sampler for a Class of Random Convex Polytopes

2021 ◽  
pp. 1-12
Author(s):  
Pierre E. Jacob ◽  
Ruobin Gong ◽  
Paul T. Edlefsen ◽  
Arthur P. Dempster
Keyword(s):  
Gibbs Sampler ◽  
Convex Polytopes ◽  
Random Convex

scholarly journals Volume decay and concentration of high-dimensional Euclidean balls – a PDE and variational perspective

Analysis ◽  
2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Siran Li
Keyword(s):  
Banach Space ◽  
Discrete Geometry ◽  
Thin Shell ◽  
Euclidean Geometry ◽  
Convex Geometry ◽  
Regularity Theory ◽  
Elliptic Partial Differential Equations ◽  
High Dimensional ◽  
Space Theory ◽  
Elementary Calculus

AbstractIt is a well-known fact – which can be shown by elementary calculus – that the volume of the unit ball in \mathbb{R}^{n} decays to zero and simultaneously gets concentrated on the thin shell near the boundary sphere as n\nearrow\infty. Many rigorous proofs and heuristic arguments are provided for this fact from different viewpoints, including Euclidean geometry, convex geometry, Banach space theory, combinatorics, probability, discrete geometry, etc. In this note, we give yet another two proofs via the regularity theory of elliptic partial differential equations and calculus of variations.

scholarly journals Polyrun: A Java library for sampling from the bounded convex polytopes

SoftwareX ◽  
2021 ◽  
Vol 13 ◽  
pp. 100659
Author(s):  
Krzysztof Ciomek ◽  
Miłosz Kadziński
Keyword(s):  
Convex Polytopes ◽  
Bounded Convex ◽  
Java Library
Sign in / Sign up

Export Citation Format

Share Document