English
Related papers

Related papers: Quantum jumps of normal polytopes

200 papers

A microscopic system under continuous observation exhibits at random times sudden jumps between its states. The detection of this essential quantum feature requires a quantum non-demolition (QND) measurement repeated many times during the…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…

Combinatorics · Mathematics 2023-02-06 Martina Juhnke-Kubitzke , Daniel Köhne

In the moduli space of degree d polynomials, the special subvarieties are those cut out by critical orbit relations, and then the special points are the post-critically finite polynomials. It was conjectured that in the moduli space of…

Number Theory · Mathematics 2016-03-18 Dragos Ghioca , Hexi Ye

Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…

Combinatorics · Mathematics 2024-05-16 Antonio Montero , Micael Toledo

Several central problems in quantum information theory (such as measurement compatibility and quantum steering) can be rephrased as membership in the minimal matrix convex set corresponding to special polytopes (such as the hypercube or its…

Quantum Physics · Physics 2024-01-23 Andreas Bluhm , Ion Nechita , Simon Schmidt

We show that Nichols algebras of most simple Yetter-Drinfeld modules over the projective special linear group over a finite field, corresponding to non-semisimple orbits, have infinite dimension. We spell out a new criterium to show that a…

Quantum Algebra · Mathematics 2018-06-01 Nicolás Andruskiewitsch , Giovanna Carnovale , Gastón Andrés García

We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…

Metric Geometry · Mathematics 2022-04-14 Antoine Deza , Jean-Baptiste Hiriart-Urruty , Lionel Pournin

Normally, in mathematics and physics, only point particle systems, which are either finite or countable, are studied. We introduce new formal mathematical object called regular continuum system of point particles (with continuum number of…

Mathematical Physics · Physics 2016-12-30 V. N. Chubarikov , A. A. Lykov , V. A. Malyshev

A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…

Quantum Physics · Physics 2015-06-04 A. Vourdas

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Computational Complexity · Computer Science 2017-04-24 Andrii Riazanov , Mikhail Vyalyiy

We study the extreme and the periodic $L_p$ discrepancy of point sets in the $d$-dimensional unit cube. The extreme discrepancy uses arbitrary sub-intervals of the unit cube as test sets, whereas the periodic discrepancy is based on…

Number Theory · Mathematics 2021-09-14 Ralph Kritzinger , Friedrich Pillichshammer

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

Combinatorics · Mathematics 2020-05-13 G. Longobardi , G. Lunardon , R. Trombetti , Y. Zhou

In the hierarchy of structural sophistication for lattice polytopes, normal polytopes mark a point of origin; very ample and Koszul polytopes occupy bottom and top spots in this hierarchy, respectively. In this paper we explore a simple…

Combinatorics · Mathematics 2016-05-10 Matthias Beck , Jessica Delgado , Joseph Gubeladze , Mateusz Michałek

The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…

Combinatorics · Mathematics 2026-05-14 Fedor Selyanin

We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…

Combinatorics · Mathematics 2013-02-07 Jaroslav Nesetril , Jan Hubicka

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

The neutrino dipole portal (NDP) is a minimal and predictive extension of the Standard Model, in which a transition magnetic moment operator couples an active neutrino to a heavy neutral lepton via the electromagnetic field. This…

High Energy Physics - Phenomenology · Physics 2025-10-22 Sin Kyu Kang , C. J. Ouseph