相关论文: For Distinguishing Conjugate Hidden Subgroups, the…

Localizable measurements are joint quantum measurements that can be implemented using only non-adaptive local operations and shared entanglement. We provide a protocol-independent characterization of localizable projection-valued measures…

We establish that temporal averaging over multiple observations is the degenerate case of algebraic group action with the trivial group $G=\{e\}$. A General Replacement Theorem proves that a group-averaged estimator from one snapshot…

A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…

Deep Gaussian Processes (DGPs) were proposed as an expressive Bayesian model capable of a mathematically grounded estimation of uncertainty. The expressivity of DPGs results from not only the compositional character but the distribution…

We continue our study of the well-posedness theory of a one-parameter family of coupled KdV-type systems in the periodic setting. When the value of a coupling parameter \alpha \in (0, 4) \setminus 1, we show that the Gibbs measure is…

We address the joint estimation of the two defining parameters of a displacement operation in phase space. In a measurement scheme based on a Gaussian probe field and two homodyne detectors, it is shown that both conjugated parameters can…

We define the optimal constant $Y ( p_1 , p_2 ; G )$ of Young's convolution inequality as \begin{align} Y ( p_1 , p_2 ; G ) := \sup \{ \| \phi_1 * ( \phi_2 \Delta^{1 / p_1'} ) \|_p \mid \phi_1 , \phi_2 \colon G \to \mathbb{C} , \; \| \phi_1…

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Group synchronization refers to estimating a collection of group elements from the noisy pairwise measurements. Such a nonconvex problem has received much attention from numerous scientific fields including computer vision, robotics, and…

We study the Densest Subgraph (DSG) problem under the additional constraint of differential privacy. DSG is a fundamental theoretical question which plays a central role in graph analytics, and so privacy is a natural requirement. All known…

We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily…

We study the fundamental problems of identity testing (goodness of fit), and closeness testing (two sample test) of distributions over $k$ elements, under differential privacy. While the problems have a long history in statistics, finite…

Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings. This problem is motivated by problems in chemical…

We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree d = (1/2+a)n. For any constant a > 0, we give an optimal answer in the following sense: let…

A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V\setminus D$ is a neighbor of some vertex of $D$. The domination number of $G$ is the minimum size of a dominating set of $G$ and it is denoted by…

The separation dimension of a hypergraph $G$ is the smallest natural number $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that any pair of disjoint edges is separated by some hyperplane normal to one of the axes. The…

This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most $d$ defective elements among a given set of $n$ elements using the fewest possible tests. Non-adaptive…

In this paper, the notion of proper proximality (introduced in [BIP18]) is studied and classified in various families of groups. We show that if a group acts non-elementarily by isometries on a tree such that for any two edges, the…

We introduce the notion of Bartlett spectral measure for isometrically invariant random measures on proper metric commutative spaces. When the underlying Gelfand pair corresponds to a higher-rank, connected, simple matrix Lie group with…