Related papers: Free mutual information for two projections
Given two rational, properly parametrized space curves ${\mathcal C}_1$ and ${\mathcal C}_2$, where $\CCC_2$ is contained in some plane $\Pi$, we provide an algorithm to check whether or not there exist perspective or parallel projections…
Testing hypothesis of independence between two random elements on a joint alphabet is a fundamental exercise in statistics. Pearson's chi-squared test is an effective test for such a situation when the contingency table is relatively small.…
It is shown that given two copies of a q-ary input channel $W$, where q is prime, it is possible to create two channels $W^-$ and $W^+$ whose symmetric capacities satisfy $I(W^-)\le I(W)\le I(W^+)$, where the inequalities are strict except…
For $C^*$-algebras $A$ and $B$, we study the bi-continuity of the canonical embedding of $A^{**}\ot_{\gamma} B^{**}$ ($A^{**}\hat{\ot} B^{**}$) into $(A \ot_{\gamma} B)^{**}$ (resp. $(A \hat{\ot} B)^{**}$), and its isomorphism. Ideal…
We develop some tools for manipulating and constructing projections in C*-algebras. These are then applied to give short proofs of some standard projection homotopy results, as well as strengthen some fundamental classical results for…
In this paper, we study the complexity of answering conjunctive queries (CQ) with inequalities). In particular, we are interested in comparing the complexity of the query with and without inequalities. The main contribution of our work is a…
Let $G\in\{p,q\}^*$ be a finite group with trivial center, where $p,q\in\pi(G)$ and $p>q>5$. In the present paper it is proved that $|G|_{\{p,q\}}=|G||_{\{p,q\}}$; in particular $C_G(g)\cap C_G(h)=1$ for every $p$-element $g$ and every…
We present a new short proof of the explicit formula for the group of links (and also link maps) in the 'quadruple point free' dimension. Denote by $L^m_{p,q}$ (respectively, $C^{m-p}_p$) the group of smooth embeddings $S^p\sqcup S^q\to…
We present a very simple example of a theorem with constructive and non-constructive proofs: the equation c^2 x^2 - (c^2 + c)x + c = 0 has a solution.
Two words $p$ and $q$ are avoided by the same number of length-$n$ words, for all $n$, precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theorem use generating functions but do not provide an explicit…
The shuffle of a non-empty countable set $ S $ of linear orders is the (unique up to isomorphism) linear order $ \Xi(S) $ obtained by fixing a coloring function $ \chi: \mathbb{Q} \to S $ having fibers dense in $ \mathbb{Q} $ and replacing…
This note draws conclusions that arise by combining two recent papers, by Anuj Dawar, Erich Gr\"adel, and Wied Pakusa, published at ICALP 2019 and by Moritz Lichter, published at LICS 2021. In both papers, the main technical results rely on…
P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…
The double sum sum_(j=0)^m sum_(i=0)^j (-1)^(j-i) C(m,j) C(j,i) C(j+k+qi,j+k) with free nonnegative integer parameters k and q is rewritten as hypergeometric series. Efficient formulas to generate the C-finite ordinary generating functions…
Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…
Over an arbitrary field $\mathbb{F}$, let $p$ and $q$ be monic polynomials with degree $2$ in $\mathbb{F}[t]$. The free Hamilton algebra of the pair $(p,q)$ is the free noncommutative algebra in two generators $a$ and $b$ subject only to…
The closed one-sided ideals of a C*-algebra are exactly the closed subspaces supported by the orthogonal complement of a closed projection. Let A be a (not necessarily selfadjoint) subalgebra of a unital C*-algebra B which contains the unit…
We prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most…
We compute the Brown measure of the non-normal operators $X = p + i q$, where $p$ and $q$ are Hermitian, freely independent, and have spectra consisting of $2$ atoms. The computation relies on the model of the non-trivial part of the von…
Given a sequence of point and rational curve blow-ups blow-ups of smooth $3-$dimensional projective varieties $Z_{i}$ defined over an algebraically closed field $\mathit{k}$, $Z_{s}\xrightarrow{\pi_{s}}…