Related papers: A property of the Birkhoff polytope
Let $\Sigma_{g,n}$ be the orientable genus $g$ surface with $n$ punctures, where $2-2g-n<0$. Let $$\rho: \pi_1(\Sigma_{g,n})\to GL_m(\mathbb{C})$$ be a representation. Suppose that for each finite covering map $f: \Sigma_{g', n'}\to…
In a 2018 paper, Davis and Sagan studied several pattern-avoiding polytopes. They found that a particular pattern-avoiding Birkhoff polytope had the same normalized volume as the order polytope of a certain poset, leading them to ask if the…
The ordinary Bondi-Metzner-Sachs (BMS) group B is the common asymptotic symmetry group of all asymptotically flat Lorentzian space-times. As such, B is the best candidate for the universal symmetry group of General Relativity. However, in…
We study a class of bistochastic matrices generalizing unistochastic matrices. Given a complex bipartite unitary operator, we construct a bistochastic matrix having as entries the normalized squares of Frobenius norm of the blocks. We show…
Let $G=(V, E)$ be an undirected graph. The spanning trees polytope $P(G)$ is the convex hull of the characteristic vectors of all spanning trees of $G$. In this paper, we describe all facets of $P(G)$ as a consequence of the facets of the…
Every representation of the Cuntz algebra $\mathcal{O}_n$ leads to a unitary representation of the Higman-Thompson group $V_n$. We consider the family $\{\pi_x\}_{x\in [0,1[}$ of permutative representations of $\mathcal{O}_n$ that arise…
Birkhoff's theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.…
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…
Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…
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…
Generalized permutahedra are a family of polytopes with a rich combinatorial structure and strong connections to optimization. We prove that they are the universal family of polyhedra with a certain Hopf algebraic structure. Their antipode…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
Lorentz's group represented by the hypercomplex system of numbers, which is based on dirac matrices, is investigated. This representation is similar to the space rotation representation by quaternions. This representation has several…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
Let $P$ be a compact hyperbolic Coxeter truncation polytope of dimension $d\ge 3$, and let $\Gamma$ be the orbifold fundamental group of the associated Coxeter orbifold $\mathcal{O}_P$. Let $\mathscr{G}(\Gamma,G)$ be the geometric component…
In this paper, we classify all the hyperbolic non-compact Coxeter polytopes of finite volume combinatorial type of which is either a pyramid over a product of two simplices or a product of two simplices of dimension greater than one.…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…