Related papers: A State Polytope Decomposition Formula
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…
We present a graphical approach to understanding the degeneracy, density of states, and cumulative state number for some simple quantum systems. By taking advantage of basic computing operations we define a straightforward procedure for…
In comparing the behavior of an energy spectrum to the predictions of random matrix theory one must transform the spectrum such that the averaged level spacing is constant, a procedure known as unfolding. Once energy spectrums belong to an…
The reduction criterion is a well known necessary condition for separable states, and states violating this condition are entangled and also 1-distillable. In this paper we introduce a new set of necessary conditions for separability of…
Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…
The decomposition theorem is deduced from local purity.
A classification of discrete polymatroids whose independence polytopes are reflexive will be presented.
We propose a method for obtaining the Schmidt decomposition of bipartite systems with continuous variables. It approximates the modes to the prescribed accuracy by well known orthogonal functions. We give some criteria for the control of…
One-loop integrands can be written in terms of a simple, process-independent basis. We show that a similar basis exists for integrands of phase-space integrals for the real-emission contribution at next-to-leading order. Our demonstration…
I. Raptis and R. Zapatrin in the quant-ph/0010104 show possibility to express general state of $l$-qubits quantum register as sum at most $2^l-l$ product states. In the comment is suggested more simple construction with possibility of…
We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…
It is shown that the SPOCK equation of state is equivalent to the Variable Polytrope Index equation of state.
We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…
In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
In this paper, we obtain a restricted decomposition formula for interpolated multiple zeta values using t-stuffle product. We then derive a recursive formula of t-stuffle product, which also provides a route to the same formula. In both…
A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…