相关论文: Local Equivalence of Metrics for Multiparameter Pe…
Let $E_i$ be an oriented circle bundle over a closed oriented aspherical $n$-manifold $M_i$ with Euler class $e_i\in H^2(M_i;\mathbb{Z})$, $i=1,2$. We prove the following: (i) If every finite-index subgroup of $\pi_1(M_2)$ has trivial…
We study the properties of `infinite-volume mixing' for two classes of intermittent maps: expanding maps $[0,1] \longrightarrow [0,1]$ with an indifferent fixed point at 0 preserving an infinite, absolutely continuous measure, and expanding…
We connect the mixing behaviour of random walks over a graph to the power of the local-consistency algorithm for the solution of the corresponding constraint satisfaction problem (CSP). We extend this connection to arbitrary CSPs and their…
This paper explores persistence modules for circle-valued functions, presenting a new extension of the interleaving and bottleneck distances in this setting. We propose a natural generalisation of barcodes in terms of arcs on a geometric…
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable. Due to the requirement of a very large distance the associated tensor products could be applied only over…
The output of physical systems is often accessible by measurements such as the 3D position of a robotic arm actuated by many actuators or the speckle patterns formed by shining the spot of a laser pointer on a wall. The selection of the…
Bounded-rate multi-mode systems are hybrid systems that can switch among a finite set of modes. Its dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given bounded sets. Given…
We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…
As modern engineering systems grow in complexity, attitudes toward a modular design approach become increasingly more favorable. A key challenge to a modular design approach is the certification of robust stability under uncertainties in…
We define two notions. The first one is a $rank\ compression\ system$ $\xi$ for a finite poset $\mathbf{P}$ that assigns each interval subposet $I$ to an order-preserving map $\xi_I \colon I^{\xi} \to \mathbf{P}$ satisfying some conditions,…
Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is…
The problem of identifiability of finite mixtures of finite product measures is studied. A mixture model with $K$ mixture components and $L$ observed variables is considered, where each variable takes its value in a finite set with…
One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…
Spatially coupled codes have been shown to universally achieve the capacity for a large class of channels. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is…
In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…
We deal with the boundedness of the multilinear fractional integral operator $I_{\gamma,m}$ from a product of weighted Lebesgue spaces into adequate weighted Lipschitz spaces. Our results generalize some previous estimates not only for the…
We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of…
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets…