Related papers: Bernoulli Correlations and Cut Polytopes

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

Let $\mathbf{g}$ be a pseudo--Riemanian metric of arbitrary signature on a manifold $\mathbf{V}$ with conventional $n+n$ dimensional splitting, $\ n\geq 2,$ determined by a nonholonomic (non--integrable) distribution $\mathcal{N}$ defining…

The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…

In this note, we study asymptotic zero distribution of multivariable full system of random polynomials with independent Bernoulli coefficients. We prove that with overwhelming probability their simultaneous zeros sets are discrete and the…

Let $\mathcal{P}$ and $\mathcal{P}'$ be finite partitions of the set $V$. Finding good correspondences between the parts of $\mathcal{P}$ and those of $\mathcal{P}'$ is helpful in classification, pattern recognition, and network analysis.…

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…

We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie…

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several…

We consider the detection of multivariate spatial clusters in the Bernoulli model with $N$ locations, where the design distribution has weakly dependent marginals. The locations are scanned with a rectangular window with sides parallel to…

The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\'asz and Plummer developed a decomposition theory for graphs with perfect…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

Let M be a simply connected Riemannian symmetric space, with at most one flat direction. We show that every Riemannian (or unitary) vector bundle with parallel curvature over M is an associated vector bundle of a canonical principal bundle,…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Let $\{P_n \}_{n\ge0}$ be a sequence of monic orthogonal polynomials with respect to a quasi--definite linear functional $u$ and $\{Q_n \}_{n\ge0}$ a sequence of polynomials defined by $$Q_n(x)=P_n(x)+s_n P_{n-1}(x)+t_n P_{n-2}(x),\quad…

Using the normalized B-bases of vector spaces of trigonometric and hyperbolic polynomials of finite order, we specify control point configurations for the exact description of higher dimensional (rational) curves and (hybrid) multivariate…

Let $\mathcal{M}_{2N}(\delta_1, \delta_2,\dots, \delta_N)$ be the moduli space of centrally symmetric convex polyhedral surfaces with $2N$ labeled vertices and prescribed cone-deficits $\delta_1$, $\delta_2$, $\dots$, $\delta_N$. We show…