Normal polytopes: Between discrete, continuous, and random
نویسندگان
چکیده
The first three sections of this survey represent an updated and much expanded version the abstract my talk at FPSAC'2010: new results are incorporated several concrete conjectures on interactions between perspectives normal polytopes in title proposed. last section outlines challenges general convex polytopes, motivated by study polytopes.
منابع مشابه
Random Walks on Discrete and Continuous Circles
We consider a large class of random walks on the discrete circle Z/(n), defined in terms of a piecewise Lipschitz function, and motivated by the “generation gap” process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z/(n) with a random walk on the...
متن کاملRandom Walks on Discrete and Continuous
We consider a large class of random walks on the discrete circle Z=(n), deened in terms of a piecewise Lipschitz function, and motivated by the \generation gap" process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z=(n) with a random walk on the ...
متن کاملNormal polytopes
In Section 1 we overview combinatorial results on normal polytopes, old and new. These polytopes represent central objects of study in the contemporary discrete convex geometry, on the crossroads of combinatorics, commutative algebra, and algebraic geometry. In Sections 2 and 3 we describe two very different possible ways of advancing the theory of normal polytopes to next essential level, invo...
متن کاملRandom polytopes
We prove the central limit theorem for the volume and the f -vector of the random polytope Pn and the Poisson random polytope Πn in a fixed convex polytope P ⊂ IR. Here Pn is the convex hull of n random points in P , and Πn is the convex hull of the intersection of a Poisson process X(n), of intensity n, with P . A general lower bound on the variance is also proved. ∗Supported by Hungarian Nati...
متن کاملContinuous Petri nets and polytopes
This article addresses the problem of the computation of instantaneous firing speed in Invariant Behavior state (IB-state) of Constant speed Continuous Petri Net (CCPN) with presence of actual conflicts. The adopted approach is based on polyhedral computations applied to specify an area of possible instantaneous firing speed. If the actual conflicts are resolved by global priorities, the instan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2023
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2022.107187