More Like this

1. Characterizing Schwarz maps by tracial inequalities

   https://doi.org/10.1007/s11005-023-01636-4  

   Carlen, Eric; Müller-Hermes, Alexander (February 2023, Letters in Mathematical Physics)

   Abstract Let$$\phi $$ $\varphi$be a positive map from the$$n\times n$$ $n\times n$matrices$$\mathcal {M}_n$$ $M_n$to the$$m\times m$$ $m\times m$matrices$$\mathcal {M}_m$$ $M_m$. It is known that$$\phi $$ $\varphi$is 2-positive if and only if for all$$K\in \mathcal {M}_n$$ $K\in M_n$and all strictly positive$$X\in \mathcal {M}_n$$ $X\in M_n$,$$\phi (K^*X^{-1}K) \geqslant \phi (K)^*\phi (X)^{-1}\phi (K)$$ $\varphi \left(K^{\ast }{X}^{-1}K\right)⩾\varphi {\left(K\right)}^{\ast }\varphi {\left(X\right)}^{-1}\varphi \left(K\right)$. This inequality is not generally true if$$\phi $$ $\varphi$is merely a Schwarz map. We show that the corresponding tracial inequality$${{\,\textrm{Tr}\,}}[\phi (K^*X^{-1}K)] \geqslant {{\,\textrm{Tr}\,}}[\phi (K)^*\phi (X)^{-1}\phi (K)]$$ $\text{Tr}\left[\varphi \left(K^{\ast }{X}^{-1}K\right)\right]⩾\text{Tr}\left[\varphi {\left(K\right)}^{\ast }\varphi {\left(X\right)}^{-1}\varphi \left(K\right)\right]$holds for a wider class of positive maps that is specified here. We also comment on the connections of this inequality with various monotonicity statements that have found wide use in mathematical physics, and apply it, and a close relative, to obtain some new, definitive results. 

   more » « less
2. Finding solutions with distinct variables to systems of linear equations over $$\mathbb {F}_p$$

   https://doi.org/10.1007/s00208-022-02391-y  

   Sauermann, Lisa (April 2022, Mathematische Annalen)

   Abstract Let us fix a primepand a homogeneous system ofmlinear equations$$a_{j,1}x_1+\dots +a_{j,k}x_k=0$$ $a_{j,1}{x}_1+\cdots +a_{j,k}{x}_k=0$for$$j=1,\dots ,m$$ $j=1,\cdots ,m$with coefficients$$a_{j,i}\in \mathbb {F}_p$$ $a_{j,i}\in F_p$. Suppose that$$k\ge 3m$$ $k\ge 3m$, that$$a_{j,1}+\dots +a_{j,k}=0$$ $a_{j,1}+\cdots +a_{j,k}=0$for$$j=1,\dots ,m$$ $j=1,\cdots ,m$and that every$$m\times m$$ $m\times m$minor of the$$m\times k$$ $m\times k$matrix$$(a_{j,i})_{j,i}$$ ${\left(a_{j,i}\right)}_{j,i}$is non-singular. Then we prove that for any (large)n, any subset$$A\subseteq \mathbb {F}_p^n$$ $A\subseteq F_p^n$of size$$|A|> C\cdot \Gamma ^n$$ $\left|A\right|>C·{\Gamma }^n$contains a solution$$(x_1,\dots ,x_k)\in A^k$$ $(x_1,\cdots ,x_k)\in A^k$to the given system of equations such that the vectors$$x_1,\dots ,x_k\in A$$ $x_1,\cdots ,x_k\in A$are all distinct. Here,Cand$$\Gamma $$ $\Gamma$are constants only depending onp,mandksuch that$$\Gamma $\Gamma <p$. The crucial point here is the condition for the vectors$$x_1,\dots ,x_k$$ $x_1,\cdots ,x_k$in the solution$$(x_1,\dots ,x_k)\in A^k$$ $(x_1,\cdots ,x_k)\in A^k$to be distinct. If we relax this condition and only demand that$$x_1,\dots ,x_k$$ $x_1,\cdots ,x_k$are not all equal, then the statement would follow easily from Tao’s slice rank polynomial method. However, handling the distinctness condition is much harder, and requires a new approach. While all previous combinatorial applications of the slice rank polynomial method have relied on the slice rank of diagonal tensors, we use a slice rank argument for a non-diagonal tensor in combination with combinatorial and probabilistic arguments. 

   more » « less
3. An optimal approximation problem for free polynomials

   https://doi.org/10.1090/proc/16474  

   Arora, Palak; Augat, Meric; Jury, Michael; Sargent, Meredith (November 2023, Proceedings of the American Mathematical Society)

   Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$in $d$freely noncommuting arguments, find a free polynomial $p_n$, of degree at most $n$, to minimize $c_n≔\Vert <\#comment/>p_{n}f-<\#comment/>1{\Vert <\#comment/>}^2$. (Here the norm is the ${\mathrm{\ell <\#comment/>}}^2$norm on coefficients.) We show that $c_n\to <\#comment/>0$if and only if $f$is nonsingular in a certain nc domain (the row ball), and prove quantitative bounds. As an application, we obtain a new proof of the characterization of polynomials cyclic for the $d$-shift. 

   more » « less
4. Restricted spaces of holomorphic sections vanishing along subvarieties

   https://doi.org/10.1007/s00209-025-03706-w  

   Coman, Dan; Marinescu, George; Nguyên, Viêt-Anh (May 2025, Mathematische Zeitschrift)

   Abstract LetXbe a compact normal complex space of dimensionnandLbe a holomorphic line bundle onX. Suppose that$$\Sigma =(\Sigma _1,\ldots ,\Sigma _\ell )$$ $\Sigma =({\Sigma }_1,\dots ,{\Sigma }_{\ell })$is an$$\ell $$ $\ell$-tuple of distinct irreducible proper analytic subsets ofX,$$\tau =(\tau _1,\ldots ,\tau _\ell )$$ $\tau =({\tau }_1,\dots ,{\tau }_{\ell })$is an$$\ell $$ $\ell$-tuple of positive real numbers, and let$$H^0_0(X,L^p)$$ $H_0^0(X,L^p)$be the space of holomorphic sections of$$L^p:=L^{\otimes p}$$ $L^p:=L^{\otimes p}$that vanish to order at least$$\tau _jp$$ ${\tau }_{j}p$along$$\Sigma _j$$ ${\Sigma }_j$,$$1\le j\le \ell $$ $1\le j\le \ell$. If$$Y\subset X$$ $Y\subset X$is an irreducible analytic subset of dimensionm, we consider the space$$H^0_0 (X|Y, L^p)$$ $H_0^0\left(X\right|Y,L^p)$of holomorphic sections of$$L^p|_Y$$ $L^p{|}_Y$that extend to global holomorphic sections in$$H^0_0(X,L^p)$$ $H_0^0(X,L^p)$. Assuming that the triplet$$(L,\Sigma ,\tau )$$ $(L,\Sigma ,\tau )$is big in the sense that$$\dim H^0_0(X,L^p)\sim p^n$$ $dim{H}_0^0(X,L^p)\sim p^n$, we give a general condition onYto ensure that$$\dim H^0_0(X|Y,L^p)\sim p^m$$ $dim{H}_0^0\left(X\right|Y,L^p)\sim p^m$. WhenLis endowed with a continuous Hermitian metric, we show that the Fubini-Study currents of the spaces$$H^0_0(X|Y,L^p)$$ $H_0^0\left(X\right|Y,L^p)$converge to a certain equilibrium current onY. We apply this to the study of the equidistribution of zeros inYof random holomorphic sections in$$H^0_0(X|Y,L^p)$$ $H_0^0\left(X\right|Y,L^p)$as$$p\rightarrow \infty $$ $p\to \infty$. 

   more » « less
5. On a Traveling Salesman Problem for Points in the Unit Cube

   https://doi.org/10.1007/s00453-024-01257-w  

   Balogh, József; Clemen, Felix Christian; Dumitrescu, Adrian (September 2024, Algorithmica)

   Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ ${[0,1]}^k$where$$k \ge 2$$ $k\ge 2$. According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ $x_1,x_2,\dots ,x_n$through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}\le c_k$, where$$|x-y|$$ $|x-y|$is the Euclidean distance betweenxandy, and$$c_k$$ $c_k$is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ $x_{n+1}\equiv x_1$. From the other direction, for every$$k \ge 2$$ $k\ge 2$and$$n \ge 2$$ $n\ge 2$, there existnpoints in$$[0,1]^k$$ ${[0,1]}^k$, such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}=2^{1/k}·\sqrt{k}$. For the plane, the best constant is$$c_2=2$$ $c_2=2$and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=9{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$for every$$k \ge 3$$ $k\ge 3$and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ $c_k=2^{1/k}·\sqrt{k}$, for every$$k \ge 2$$ $k\ge 2$. Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=3\sqrt{5}{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ $c_k=2.91\sqrt{k}(1+o_k\left(1\right))$. Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ $c_3\ge 2^{7/6}$, which disproves the conjecture for$$k=3$$ $k=3$. Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. 

   more » « less