Related papers: IDP for 2-Partition Maximal Symmetric Polytopes

We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associated polyhedron is non-degenerate. We also give sufficient…

We investigate in detail a homomorphism which we call the 2-Selmer signature map from the $2$-Selmer group of a number field $K$ to a nondegenerate symmetric space, in particular proving the image is a maximal totally isotropic subspace.…

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

This paper presents a bicomplex version of the Spectral Decomposition Theorem on infinite dimensional bicomplex Hilbert spaces. In the process, the ideas of bounded linear operators, orthogonal complements and compact operators on bicomplex…

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present polyhedral…

In this paper, we give an algorithm that finds an epsilon-approximate solution to a mixed integer quadratic programming (MIQP) problem. The algorithm runs in polynomial time if the rank of the quadratic function and the number of integer…

In this work, we study the space of complete embedded rotationally symmetric self-shrinking hypersurfaces in $\mathbb{R}^{n+1}$. First, using comparison geometry in the context of metric geometry, we derive explicit upper bounds for the…

Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…

Let $\mathcal{H}$ be a separable Hilbert space and $P$ be an idempotent on $\mathcal{H}.$ We denote by $$\Gamma_{P}=\{J: J=J^{\ast}=J^{-1} \hbox{ }\hbox{ and }\hbox{ } JPJ=I-P\}$$ and $$\Delta_{P}=\{J: J=J^{\ast}=J^{-1} \hbox{ }\hbox{ and…

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

For several decades the dominant techniques for integer linear programming have been branching and cutting planes. Recently, several authors have developed core point methods for solving symmetric integer linear programs (ILPs). An integer…

In this work, we investigate generic classical two-dimensional (2D) superintegrable Hamiltonian systems H, characterized by the existence of three functionally independent integrals of motion (I_0=H,I_1,I_2). Our main result, formulated and…

We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…

We introduce a symmetry class for higher dimensional partitions - fully complementary higher dimensional partitions (FCPs) - and prove a formula for their generating function. By studying symmetry classes of FCPs in dimension 2, we define…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and…