Related papers: A Basis for Slicing Birkhoff Polytopes
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
We apply an algorithm for measuring the volume of polytopes described by Jim Lawrence to polytropes. By using a tropical form of Cramer's rule, we found an efficient way to find all pseudovertices which are necessary for computing the…
We propose a divide-and-conquer algorithm to find recursively the Scattering matrix of general tight-binding structures. The Scattering matrix allows a direct calculation of transport properties in mesoscopic systems by using the Landauer…
Associated to Birkhoff orthogonality, we study Birkhoff angles in a normed space and present some of their basic properties. We also discuss how to decide whether an angle is more acute or more obtuse than another. In addition, given two…
We tackle the problem of efficiently approximating the volume of convex polytopes, when these are given in three different representations: H-polytopes, which have been studied extensively, V-polytopes, and zonotopes (Z-polytopes). We…
A mixed basis approach based on density functional theory is employed for low dimensional systems. The basis functions are taken to be plane waves for the periodic direction multiplied by B-spline polynomials in the non-periodic direction.…
We study a special class of (real or complex) robust Hadamard matrices, distinguished by the property that their projection onto a $2$-dimensional subspace forms a Hadamard matrix. It is shown that such a matrix of order $n$ exists, if…
We consider free and proper cotangent-lifted symmetries of Hamiltonian systems. For the special case of G = SO(3), we construct symplectic slice coordinates around an arbitrary point. We thus obtain a parametrisation of the phase space…
The simplest version of the Spin-polynomial invariants of the underlying differentiable structures of algebraic surfaces were considered and the simplest arguments were used in order to distinguish the underlying smooth structures of…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
The Birkhoff's theorem states that any doubly stochastic matrix lies inside a convex polytope with the permutation matrices at the corners. It can be proven that a similar theorem holds for unitary matrices with equal line sums for prime…
This paper constructs polynomial bases that capture the structure of the de Rham complex with boundary conditions in disks and cylinders (both periodic and finite) in a way that respects rotational symmetry. The starting point is explicit…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We give in this note a weighted version of Brianchon-Gram's decomposition for a simple polytope. This weighted version is a direct consequence of the ordinary Brianchon-Gram formula.
My main results are simple formulas for the surface area of d-dimensional lattice polytopes using Ehrhart theory.
In this paper, we provide three different ways to partition the polytope of doubly substochastic matrices into subpolytopes via the prescribed row and column sums, the sum of all elements and the sub-defect respectively. Then we…
The Birkhoff polytope $\mathcal{B}_d$ consisting of all bistochastic matrices of order $d$ assists researchers from many areas, including combinatorics, statistical physics and quantum information. Its subset $\mathcal{U}_d$ of…
We suggest an algorithm allowing to obtain some new integral-geometric formulae from the existing formulae of Crofton type. These new formulae are applied to get smooth versions of BKK theorem. The algorithm is based on the calculations in…
In this paper we present a first approach toward a \texttt{SAGBI} bases theory of skew Poincar\'e-Birkhoff-Witt extensions, and investigate the problem of polynomial composition for \texttt{SAGBI} bases of subalgebras of these extensions.