It is mentioned [here](https://mathoverflow.net/questions/65424/determinant-of-sum-of-positive-definite-matrices/172884#172884) that if $A, B, C\in M\_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from [this article](http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol27_pp332-341.pdf)) and the special case ($C=\bf 0$) $$\det (A+B)\ge \det (A)+\det (B).$$
The latter one has many proofs. The proof of the former one given in the paper uses tensor products which are decomposed into parts that mostly vanish due to orthogonality. It is valid not only for determinants, but for all *generalized matrix functions* (a.k.a. immanents). 


Now: I have numerical evidence that a sharper [Hlawka inequality](http://www.uni-graz.at/jens.schwaiger/ISFE49/talks/thursday/fechner.pdf) $$\det (A+B+C)+\det (A)+\det (B)+\det (C)\ge \det (A+B)+\det (A+C)+\det (B+C)$$ also holds. But this one becomes wrong if determinants are replaced by permanents (and supposedly for the other immanents, too). This makes me think that the decomposition of the corresponding tensor products can very probably *not* be used to prove this one.  

Note the formal similarity with [Popoviciu's inequality](http://en.wikipedia.org/wiki/Popoviciu%27s_inequality), though I don't think that is of any help. 



> 
> **Is there a way to prove the Hlawka inequality for determinants?** 
> 
> 
> 


EDIT: (to include my comment from below) **More generally, if $A\_1,...,A\_r\in M\_{n}(\mathbb C)$ are psd matrices and $\chi\vdash n$ (or even: $\chi$ is an irreducible character of a subgroup of $S\_n$), define for $k=1,...,r$ $$s\_k:=\sum\_{i\_1<\cdots<i\_k}Imm\_\chi(A\_{i\_1}+\cdots+A\_{i\_k}).$$ Then I conjecture** $$s\_r+s\_{r-2}+\cdots\ge s\_{r-1}+s\_{r-3}+\cdots.$$


***FINAL EDIT: Since then, Suvrit and myself have proved an even more general result. It is published in [Linear Algebra and its Applications](http://www.sciencedirect.com/science/article/pii/S0024379515004966).*** 



Hlawka inequality for determinants of positive definite matrices
My previous answer mis-attributed a claim to the paper of Paksoy, Turmen, and Zhang (also cited in the OP). Their claim is indeed strictly weaker than the inequality conjectured by Wolfgang. The details are slightly messy to type up, but they follow from the following more general *operator Hlawka inequality*



> 
> **Theorem.** Let $A, B, C$ be positive definite operators. Then, for each integer $k \ge 1$, we have
>  \begin{equation\*}
>  \otimes^k(A+B+C) + \otimes^k A + \otimes^k B + \otimes^k C \ge \otimes^k(A+B) + \otimes^k(A+C) + \otimes^k(B+C).
> \end{equation\*}
> 
> 
> 


From this operator inequality, using "standard" arguments, we obtain the following result.



> 
> **Corollary.** Let Let $G$ be a subgroup of the symmetric group $S\_n$, and $\chi$ is an irreducible character for $G$. Define the $G$-immanant of an arbitrary complex matrix
>  \begin{equation\*}
>  d\_{\chi}(X) := \sum\_{\sigma \in G}\chi(\sigma)\prod\_{i=1}^n x\_{i,\sigma(i)}.
> \end{equation\*}
>  Then, for psd matrices $A, B, C$ it holds that
>  \begin{equation\*}
>  d\_\chi(A+B+C) + d\_\chi(A)+d\_\chi(B) + d\_\chi(C) \ge d\_\chi(A+B) + d\_\chi(A+C) + d\_\chi(B+C).
> \end{equation\*}
> 
> 
> 


We can use induction to generalize this claim to $n$ matrices. The conjecture mentioned by Wolfgang in the comments should also hold, though I haven't had time to think about it yet.


The details of the above results can be found here: [PDF of the proof](https://www.dropbox.com/s/jho5436w495k7po/hlawka.pdf?dl=0)


