Related papers: A strong direct product theorem for two-way public…
We derive an expression for the 4-point conductance of a general quantum junction in terms of the density response function. Our formulation allows us to show that the 4-point conductance of an interacting electronic system possessing…
We examine the dispersion of Brownian particles in a symmetric two dimensional channel, this classical problem has been widely studied in the literature using the so called Fick-Jacobs' approximation and its various improvements. Most…
We study the inverse conductivity problem with discontinuous conductivities. We consider, simultaneously, a regularisation and a discretisation for a variational approach to solve the inverse problem. We show that, under suitable choices of…
This paper studies the joint data and semantics lossy compression problem, i.e., an extension of the hidden lossy source coding problem that entails recovering both the hidden and observable sources. We aim to study the nonasymptotic and…
We prove a biadjoint triangle theorem and its strict version, which are $2$-dimensional analogues of the adjoint triangle theorem of Dubuc. Similarly to the $1$-dimensional case, we demonstrate how we can apply our results to get the…
We study goodness-of-fit of discrete distributions in the distributed setting, where samples are divided between multiple users who can only release a limited amount of information about their samples due to various information constraints.…
High communication costs create a major bottleneck for distributed resource allocation over unbalanced directed networks. Conventional dual gradient tracking methods, while effective for problems on unbalanced digraphs, rely on periodic…
We obtain a family of strict $\hat G$-invariant products on the space of holomorphic functions on a semisimple coadjoint orbit of a complex connected semisimple Lie group $\hat G$. By restriction, we also obtain strict $G$-invariant…
The Paszkiewicz conjecture about a product of positive contractions asserts that given a decreasing sequence $T_1\ge T_2\ge \dots$ of positive contractions on a separable infinite-dimensional Hilbert space, the product $S_n=T_n\dots T_1$…
Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower…
The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of this phenomenon in two types of cut problems in directed…
A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a…
Given a consumer data-set, the axioms of revealed preference proffer a binary test for rational behaviour. A natural (non-binary) measure of the degree of rationality exhibited by the consumer is the minimum number of data points whose…
We derive new Heisenberg-type uncertainty relations for both joint measurability and the error-disturbance tradeoff for arbitrary observables of finite-dimensional systems. The relations are formulated in terms of a directly operational…
The indirect transactions between sectors of an economic system has been a long-standing open problem. There have been numerous attempts to conceptually define and mathematically formulate this notion in various other scientific fields in…
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
We are interested in the nonparametric estimation of the probability density of price returns, using the kernel approach. The output of the method heavily relies on the selection of a bandwidth parameter. Many selection methods have been…
We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the…
A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…
We prove the first rigidity and classification theorems for crossed product von Neumann algebras given by actions of non-discrete, locally compact groups. We prove that for arbitrary free probability measure preserving actions of connected…