Deza, M.M.

Laurent, M.

Research Papers in Economics

English

0.787-approximation algorithms for MAX CUT and MAX ZSAT, in:

11 calcolo delle assicurazioni su grouppi di teste,

A bound on the k-gonality of the hypermetric cone and related complexity problems,

A combinatorial approach to the diagonal N-representability problem,

A cone of inhomogeneous second-order polynomials,

A convex set of second order inhomogeneous polynomials with applications to reduced density matrices, in:

A generalized cut condition for multiflows in matroids,

A survey of the known facets of the cut cone,

An application of combinatorial optimization to statistical physics and circuit layout design,

An inequality for probabilities,

An introduction to statistical data analysis Lr-norm based, in:

An Investigation of the Laws of Thought on which are Founded the Mathematical Theories of Logic and Probabilities

Applications of cut polyhedra ~

Best linear Bonferroni bounds,

Bonferroni inequalities,

Bounds for equidistant codes and projective planes, Discrete Math.

Calve, Li-embeddings of a data structure

Can quantum mechanical description of physical reality be considered complete?,

Classification of finite connected hypermetric spaces,

Closed form two-sided bounds for probabilities that at least r and exactly rout of n events occur,

Combinatorial approach to the N-representability of p-density matrices,

Combinatorial approaches to multiflow problems,

Combinatorial Integral Geometry

Compositions in the bipartite subgraph polytope,

Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman.

Correlation polytopes: their geometry and complexity,

Distances between populations of drosophila subobscura based on chromosome arrangement frequencies,

Eds., Density Matrices and Density Functionals (Reidel,

Eds., Reduced Density Operators with Applications to Physicat and Chemical Systems I, Queen’s Papers

Equiangular lines,

Experiments in quadratic O-l programming,

Extreme hypermetrics and L-polytopes, in: Sets, Graphs and Numbers,

Finding a maximum cut of planar graphs in polynomial time,

Flows in Networks

Generalized Radon transform and Levy’s Brownian motion I and II,

Graphs related to exceptional root systems, TH-report 76-WSK-05, Technical Univ.

Half-integral five-terminus flows,

Hierarchical clustering schemes,

How far apart can the group multiplication tables be?,

Hypermetric graphs,

L-polytopes and equiangular lines,

L1 -distances in statistical inference: comparison of topological functional and statistical properties, in:

Laplacian eigenvalues and the maximum cut problem.

Linear inequalities and the Pauli principle, in:

Linear inequalities for density matrices II,

Linear inequalities for density matrices,

Many-Particle Theory

Matroids and multicommodity flows,

Metrics and undirected cuts,

Metriques de formes et applications, in:

Necessary conditions for N-representability of reduced density matrices,

Nonpolyhedral relaxations of graph-bisection problems,

Note on exchange phenomena in the Thomas atom,

Nouvelles applications des paramitres continus g la thkorie des formes quadratiques,

On a certain distance of sets and the corresponding distance of functions,

On a system of flows in a network,

On an extension of the maximum-flow minimum-cut theorem to multicommodity flows,

On existence of multicommodity flows,

On feasibility conditions of multicommodity flows in networks,

On the cut polytope,

On the probability of the occurrence of at least m events among n arbitrary events,

One-third-integrality in the metric polytope, Report BS-R9209, Centrum voor Wiskunde en Informatica,

Polyhedra related to undirected multicommodity flows, Linear Algebra Appl.

Polyhedral and eigenvalue approximations of the max-cut problem, in: Sets, Graphs and Numbers,

private communication,

Probability Metrics and the Stability of Stochastic Models

Produit tensoriel, distances extremales et realisation de covariances,

Quantum probability - Quantum logic,

Quantum theory of many particles systems I, Physical interpretation by means of density matrices, natural spin-orbitals, and convergence problems in the method of configurational interaction,

Representability conditions, in:

Solving the max-cut problem using eigenvalues,

Sous espaces de L’ et inegalites hypermttriques,

Sphere Packings, Lattices and Groups,

Statistical Data Analysis Based on the L1-Norm and Related Methods (Elsevier,

Sums of cuts and bipartite metrics,

The convex structure of the set of N-representable reduced 2-matrices,

The cut cone, Li-embeddability, complexity and multicommodity flows,

The empty sphere,

The hypermetric cone is polyhedral,

The max-cut problem on graphs not contractible to Ks,

The role played by Lr in data analysis, in:

The structure of fermion density matrices -

Theory of Linear and Integer Programming

Two metrics for a graph-theoretical model of organic chemistry,

Une propritte extremale des plans projectifs finis dans une classe de codes equidistants,

Variety of hypercube embeddings of the equidistant metric and designs,

Weakly bipartite graphs and the max-cut problem.

White noise representation of some Gausian random fields,

Applications of cut polyhedra - II.

The hypermetric cone $\HYP_{n+1}$ is the parameter space of basic Delaunay
polytopes in n-dimensional lattice. The cone $\HYP_{n+1}$ is polyhedral; one
way of seeing this is that modulo image by the covariance map $\HYP_{n+1}$ is a
finite union of L-domains, i.e., of parameter space of full Delaunay
tessellations.
  In this paper, we study this partition of the hypermetric cone into
L-domains. In particular, it is proved that the cone $\HYP_{n+1}$ of
hypermetrics on n+1 points contains exactly {1/2}n! principal L-domains. We
give a detailed description of the decomposition of $\HYP_{n+1}$ for n=2,3,4
and a computer result for n=5 (see Table \ref{TableDataHYPn}). Remarkable
properties of the root system $\mathsf{D}_4$ are key for the decomposition of
$\HYP_5$.Comment: 20 pages 2 figures, 2 table