A note on the polynomial Freĭman–Ruzsa conjecture over ℤ

2017 ◽  
Vol 166 (2) ◽  
pp. 243-245
Author(s):  
FREDDIE MANNERS
Keyword(s):  
Convex Geometry ◽  
Equivalence Proof

AbstractThe polynomial Freĭman–Ruzsa conjecture over the integers is often phrased in terms of convex progressions. We give an alternative, apparently stronger formulation in terms of the more restrictive “ellipsoid progressions”, and show that these formulations are in fact equivalent. The key input to the equivalence proof comes from strong results in asymptotic convex geometry.

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 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 Erratum to: Quotient metrics with applications in convex geometry

2012 ◽  
Vol 53 (2) ◽  
pp. 579-580
Author(s):  
Agnieszka Bogdewicz ◽  
Irmina Herburt ◽  
Maria Moszyńska
Keyword(s):  
Convex Geometry

scholarly journals Decomposable Convexities in Graphs and Hypergraphs

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Francesco M. Malvestuto
Keyword(s):  
Convex Hull ◽  
Convex Sets ◽  
Nonempty Subset ◽  
Convex Set ◽  
Convex Geometry ◽  
Convexity Space ◽  
Vertex Set ◽  
Convex Geometries ◽  
Acyclic Hypergraph ◽  
Maximal Clusters

Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under intersection and every set in is connected in . The members of are called convex sets. The convex hull of a subset X of V is the smallest convex set containing X. By a cluster of we mean any nonempty subset of V in which every two vertices are separated by no convex set. We say that a convexity space on is decomposable if it satisfies the following three axioms: (i) the maximal clusters of form an acyclic hypergraph, (ii) every maximal cluster of is a convex set, and (iii) for every nonempty vertex set X, a vertex does not belong to the convex hull of X if and only if it is separated from X by a convex cluster. We prove that a decomposable convexity space on is fully specified by the maximal clusters of in that (1) there is a closed formula which expresses the convex hull of a set in terms of certain convex clusters of and (2) is a convex geometry if and only if the subspaces of induced by maximal clusters of are all convex geometries. Finally, we prove the decomposability of some known convexities in graphs and hypergraphs taken from the literature (such as “monophonic” and “canonical” convexities in hypergraphs and “all-paths” convexity in graphs).

scholarly journals REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

2017 ◽  
Vol 82 (2) ◽  
pp. 576-589 ◽  
Author(s):  
KOSTAS HATZIKIRIAKOU ◽  
STEPHEN G. SIMPSON
Keyword(s):  
Theorem Proving ◽  
Chain Condition ◽  
Reverse Mathematics ◽  
Partial Ordering ◽  
Young Diagrams ◽  
Equivalence Proof ◽  
Image Position ◽  
Countably Infinite ◽  
Infinite Set ◽  
Ascending Chain Condition

AbstractLetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$(or even over$RCA_0^{\rm{*}}$) to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

scholarly journals COMPRESSIONS, CONVEX GEOMETRY AND THE FREIMAN–BILU THEOREM

2006 ◽  
Vol 57 (4) ◽  
pp. 495-504 ◽  
Author(s):  
B. Green ◽  
T. Tao
Keyword(s):  
Convex Geometry
Sign in / Sign up

Export Citation Format

Share Document