Related papers: A strong direct product theorem for two-way public…
We consider bicrossed products obtained by twisting compact semi-direct products by a suitable finite subgroup. Under some restriction, we give a practical criterion for the discrete dual of such bicrossed products to have the rapid decay…
Nonuniqueness of semidirect decompositions of groups is an insufficiently studied question in contrast to direct decompositions. We obtain some results about semidirect decompositions for semidirect products with factors which are…
Using an inequality due to Ricard and Xu, we give a different proof of Paul Skoufranis's recent result showing that the strong convergence of possibly non-commutative random variables $X^{(k)}\to X$ is stable under reduced free product with…
We derive novel conditions that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages. The computational…
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…
In Direct Sum problems [KRW], one tries to show that for a given computational model, the complexity of computing a collection of finite functions on independent inputs is approximately the sum of their individual complexities. In this…
We study the problem of discrete distribution testing in the two-party setting. For example, in the standard closeness testing problem, Alice and Bob each have $t$ samples from, respectively, distributions $a$ and $b$ over $[n]$, and they…
We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…
A unitary interaction coupling two parties enables quantum communication in both the forward and backward directions. Each communication capacity can be thought of as a tradeoff between the achievable rates of specific types of forward and…
It is shown that, if $R$ is either an Artin algebra or a commutative noetherian domain of Krull dimension $1$, then infinite direct products of $R$-modules resist direct sum decomposition as follows: If $(M_n)_{n \in \Bbb N}$ is a family of…
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical model, our bound extends the well known upper bound of Kremer, Nisan and…
In this paper, we first provide three general norm inequalities, which are used to give new uncertainty relations of any finite observables and quantum channels via metric-adjusted skew information. The results are applicable to its special…
Let $\F$ be a collection of subsets of $\Z_+$ and $(X,T)$ be a dynamical system. $x\in X$ is $\F$-recurrent if for each neighborhood $U$ of $x$, $\{n\in\Z_+:T^n x\in U\}\in \F$. $x$ is $\F$-product recurrent if $(x,y)$ is recurrent for any…
We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$_1$-factors named $\mathcal{C}_{\rm Rigid}$. For von Neumann algebras in this class we show a unique…
The system of undetermined coefficients of a bifurcation problem G[z]=0 in Banach spaces is investigated for proving the existence of families of solution curves by use of the implicit function theorem. The main theorem represents an…
We study a strongly coupled system consisting of a parabolic equation and a singular Hamilton-Jacobi equation in one space dimension. This system describes the dynamics of dislocation densities in a material submitted to an exterior applied…
I give a simple proof of a tight communication lower bound for pointer chasing.
We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…
The effective, fast transport of matter through porous media is often characterized by complex dispersion effects. To describe in mathematical terms such situations, instead of a simple macroscopic equation (as in the classical Darcy's…
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^{1}$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…