Papers

We introduce an abstract neural flow framework for neural networks and neural operators. The framework contains two continuous-depth models, namely neural flows with composition and separation structures, and covers both finite-dimensional function approximation and infinite-dimensional operator approximation. We prove well-posedness and universal approximation properties for the corresponding neural flows, including, to the best of our knowledge, the first universal approximation result for flow-based models between infinite-dimensional spaces. We also obtain universal approximation results for convolutional neural flow models. Through suitable time discretizations, the composition structure recovers ResNet-type architectures, while the separation structure, via a splitting-based discretization, yields plain architectures. This gives a unified flow-based route to both residual and plain architectures for neural networks and neural operators with fully connected or convolutional linear layers.

We study symplectic and projective structures on small covers over products of polygons. We introduce the factor-compatible class for small covers over products of polygons and prove that every factor-compatible small cover admits a smooth projective model as a finite quotient of a product of curves. Furthermore, we show that the graded mod~$2$ cohomology ring determines the Hodge diamond of the associated projective model. We also prove that every factor-compatible small cover admits an iterated equivariant bundle structure.

A graph $G$ admits an $H$-tiling if it contains a collection of vertex-disjoint copies of $H$. In this paper, we confirm a conjecture proposed by Kühn, Osthus, and Treglown by showing that for any given graph $H$, there exists a constant $C(H)$ such that the following holds. If $G$ is a sufficiently large $n$-vertex graph satisfying $d(x) + d(y) \geq 2\left(1 - 1/\chi_{\text{cr}}(H)\right)n$ for all nonadjacent vertices $x, y \in V(G)$, then $G$ contains an $H$-tiling covering all but at most $C(H)$ vertices. Here $\chi_{\text{cr}}(H)$ denotes the critical chromatic number of $H$.

We consider the problem of minimizing the sum of a Lipschitz differentiable convex function $f$ and a proper closed convex function $h$ that admits efficient linear minimization oracles, subject to multiple smooth convex inequality constraints. We adapt the classical augmented Lagrangian (AL) method for these problems: in each iteration, our algorithm consists of one step of the conditional gradient (CG) method applied to the AL function, followed by an update of the dual variable as in classical AL methods with a diminishing dual stepsize. We study the convergence rate of our algorithm under two standard stepsize rules for the CG method, namely, an open-loop stepsize and the short stepsize, and obtain a convergence rate that matches the best-known complexity for this class of problems. We also establish accelerated rates when $h$ is the indicator function of a uniformly convex set.

We introduce algebroid desingularizable Poisson manifolds, those Poisson manifolds induced by a symplectic Lie algebroid with an almost-injective anchor. This class coincides with that of $E$-symplectic manifolds, and contains log-symplectic manifolds and $b^m$-symplectic manifolds. We give an infinitesimal obstruction to desingularizability: at a zero of the Poisson structure the isotropy Lie algebra must contain an abelian ideal of at least half the dimension of the manifold, so no Poisson structure with a semisimple isotropy Lie algebra can be desingularized. We then characterize the linear case, showing that the dual of a real $n$-dimensional Lie algebra $\mathfrak{g}$, equipped with the KKS Poisson structure, is desingularizable if and only if $\mathfrak{g}$ possesses an abelian ideal of dimension $n-r$, where $2r$ is the maximal coadjoint orbit dimension. In this case, we construct a desingularizing algebroid explicitly.

Using Jacobian Elliptic functions, we introduce a novel parametrization of a hyperbolic pencil of coaxal circles which reveals a remarkable group structure on the pencil. The geometric properties of the group elements lead to a new proof of of the general Poncelet theorems, which in turn leads to a proof of the so called closure theorem. In particular we prove: if $T$ and $% D $ are members of the pencil, then an interscribed $n$-gon to $T$ and $D$ exists, if and only if $D$, the inside circle, is an element of order $n$ in the group.

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a composable structure, where each polynomial \(f_i\) can be expressed as a composition \( f_i = h_i(g_1,\dots,g_n)\). Exploiting this structure allows us to reduce the original system to one in the \(g_j\) variables, thereby significantly improving the efficiency of symbolic solution algorithms. We present a probabilistic algorithm that computes all isolated regular solutions, with arithmetic complexity being polynomial in the input size and in the number of solutions. A first important application is when \(f_1, \dots, f_n\) belong to the subring \(k[g_1, \dots, g_n]\), where \(g_1, \dots, g_n\) are algebraically independent polynomials in \(k[X_1, \dots, X_n]\). Another important application is to systems of invariant polynomials under finite reflection groups, since by the Chevalley-Shephard-Todd theorem their invariant rings are polynomial algebras. Typical examples include the symmetric groups \(S_n\), the hyperoctahedral groups \(B_n\), the dihedral groups \(I_2(m)\), and the exceptional finite reflection groups \(E_6, E_7, E_8, F_4, H_3, H_4\).

In this paper, we consider the restricted $p$-Schatten class Grassmannian $\mathrm {Gr}_{{\rm res}, p}(\mathcal{H})$ consisting of infinite-dimensional and infinite codimensional subspaces $W$ of a polarized complex separable Hilbert space $\mathcal{H} = \mathcal{H}_+\oplus \mathcal{H}_-$ such that the orthogonal projection from $W$ onto $\mathcal{H}_+$ is Fredholm and the orthogonal projection from $W$ onto $\mathcal{H}_-$ is in the Schatten ideal $L_p$, $p\geq 1$. The aim of this paper is to show that, for $1\leq p\leq 2$, the restricted $p$-Schatten class Grassmannian $\mathrm {Gr}_{{\rm res}, p}(\mathcal{H})$ is an affine (co-)adjoint orbit of an infinite-dimensional restricted unitary group $\operatorname{U}_{{\rm res}, p}(\mathcal{H})$, and that it admits natural weak symplectic structures. These results follow from the fact that the Lie algebra of the restricted $p$-Schatten class unitary group $\operatorname{U}_{{\rm res}, p}(\mathcal{H})$ admits a non-trivial $2$-cocycle.

Fluid reconfigurable intelligent surfaces (FRIS) extend conventional reconfigurable intelligent surfaces (RIS) by adding spatial reconfigurability through switchable apertures, pattern-reconfigurable units, fluidic conductive materials, or movable surface elements. This article studies how FRIS can support index modulation (IM), where information bits select a surface configuration and the receiver detects the index from the induced receiver-side response. A key challenge is that many feasible FRIS layouts do not necessarily lead to many reliable spatial indices. After propagation, mutual coupling, hardware distortion, and receiver observation, different layouts may produce similar receiver-side responses and cause index-detection errors. To address this issue, we present a response-aware design view, in which FRIS spatial codebooks are selected according to response-domain separability rather than layout diversity alone. We also discuss actuation granularity as a practical design knob that balances spatial diversity, pilot overhead, coupling robustness, and hardware feasibility. The resulting workflow helps select compact, trainable, and controllable spatial-index codebooks from dense FRIS layouts, providing design guidance for future programmable wireless environments.

The exodromy correspondence of Barwick, Glasman, and Haine computes constructible sheaves of spaces on a scheme $X$ as an $\infty$-category of continuous functors from the profinite category $\operatorname{Gal}(X)$. Viewing $\operatorname{Gal}(X)$ instead as a condensed category, this was extended by Wolf to an exodromy correspondence for pro-étale sheaves. Using the condensed perspective from the outset, we give a quick and self-contained proof of the pro-étale exodromy theorem. This is used to extract an exodromy theorem for (Postnikov complete) étale sheaves that does not yet appear in the literature, which is closely related to Lurie's work on ultracategories. Finally, we use this to give a new proof of the constructible étale exodromy correspondence of Barwick, Glasman, and Haine. Without additional effort, our method removes the qcqs hypotheses on the schemes, and gives versions for sheaves with coefficients in more general $\infty$-categories. Finally, we refine the methods to obtain a $\kappa$-condensed statement for any uncountable cardinal $\kappa$ such that $\kappa > \lvert \mathcal O_X(U) \rvert$ for every affine open $U \subseteq X$.

Let X be a smooth projective variety over a field k. For k separably closed, we prove that the subgroup of unramified classes in the Milnor K-group $K^M_i(k(X))$ of the function field of X is contained in the subgroup of n-divisible elements of $K^M_i(k(X))$ for any integer n invertible in k. This generalizes to a statement for unramified motivic cohomology of arbitrary bidegree. We further show that whenever k is finite or separably closed and l is a prime invertible in k, then all but the last step in the Bloch–Ogus filtration of the motivic cohomology of X are l-divisible up to torsion. Generalizations of this last result to arbitrary quasi-projective k-schemes are also proven.

This paper studies the continuous-time dynamics generated by control-theoretic Lagrangian methods for equality-constrained optimization. In particular, we consider dynamics induced by proportional-integral and feedback linearization controllers, which have recently been proposed as alternatives to primal-dual gradient methods. Unlike global convergence results for these dynamics, which rely on strong convexity of the objective function or boundedness assumptions, we exploit the geometric structure induced by the constraints. Specifically, we show global exponential convergence for non-convex problems that satisfy a suitable convexity property when restricted to the constraint manifold.

We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay system with $k$ time delays, we establish the convergence of $k$th-order Runge-Kutta methods under a weak coupling condition. We develop the convergence analysis by adapting the Fourier stability and perturbation techniques of [Lubich, Ostermann, Math. Comp., 64(210):601–627, 1995]. The key tool is the generating function framework, in which the Runge-Kutta discretization is encoded through an operator-valued function. Stability estimates are then obtained via Parseval's identity on the unit circle. We further present convergence results for iterative (fixed-stress and undrained-split) higher-order Runge-Kutta schemes. Here, a spectral decomposition of the Schur complement operator is central. Finally, we provide numerical examples to verify the proven convergence results.

We prove density results for neural-network classes on compact sets \(K\subset X\), where \(X\) is a topological vector space whose continuous dual \(X^*\) separates points. Let \(\Psi:\mathbb R\to\mathbb R\) be a continuous squashing function. We show that the class \[ \Sigma_X(\Psi) = \left\{ \sum_{j=1}^{N}\omega_j\Psi(f_j(x)+b_j): N\in\mathbb N,\ \omega_j,b_j\in\mathbb R,\ f_j\in X^* \right\} \] is dense in \(C(K)\) with respect to the uniform norm. As a consequence, if \(\mu\) is a Radon probability measure supported on \(K\), then \(\Sigma_X(\Psi)\) is dense in \(L^p(K,\mu)\) for every \(1\le p<\infty\).

Backdoor poisoning attacks behave counter-intuitively in high dimensions: stronger training triggers can help the defender. We study regularised generalised linear models on Gaussian-mixture data in the proportional regime ($p/n \to \kappa$), varying the training trigger strength $\alpha$ against a fixed test trigger. Three phenomena emerge: (i) clean test accuracy increases with $\alpha$; (ii) attack success peaks at a finite $\alpha$ and then declines; and (iii) the most damaging trigger direction is the minimum eigenvector of the data covariance. We prove all three results in closed form for the squared loss, and extend (i) and (ii) to general convex GLM losses via a Gaussian-proxy fixed-point system. We identify a finite-sample noise floor proportional to $\kappa$ as the mechanism behind (i), invisible to classical $n \gg p$ analysis. Experiments on CIFAR-10 and Gaussian surrogates match the theory closely; ResNet-18 experiments show the same phenomena beyond the convex setting.

We introduce a mathematical and cryptographic framework for exact recovery of noisy hidden paths in high dimensional discrete path spaces. The work is inspired by the path integral viewpoint, where global quantities arise from contributions over many possible trajectories. Instead of approximating a global path sum, we study the inverse problem of recovering one exact hidden trajectory from incomplete, noisy, projected, and aggregated observables. The hidden object is a planted discrete path whose transitions may include macro steps, microscopic perturbations, and discrete noise. Public information is represented by large observable vectors rather than short hash digests, since excessive compression would bound the effective recovery problem by the digest size. We formalize several recovery notions, including planted exact recovery, arbitrary witness recovery, canonical recovery, quotient recovery, and recovery of derived encodings. The main distinction is that approximate reconstruction and exact recovery are fundamentally different tasks. A method may reveal coarse geometry or dominant regions without recovering the precise microscopic sequence defining the hidden path. We also discuss attack surfaces relevant to future cryptographic use, including linearization, lattice style recovery, dynamic programming, meet in the middle attacks, SAT and SMT formulations, approximation followed by rounding, witness collisions, and generic quantum search. This work does not claim a complete post quantum cryptosystem. It provides a formal framework for studying exact hidden path recovery as a possible foundation for future cryptographic constructions

Chapter $7$ of Langlands' monograph "On the functional equations satisfied by Eisenstein series" employs a sophisticated residue scheme to construct a portion of the discrete automorphic spectrum. We show, by examples, applications, and heuristics, that this construction is a straightforward regularization of cuspidal Eisenstein series at distinguished points, and that the regularization must track BOTH the zeros and the poles of these Eisenstein series. Unlike the one-variable case, the zero set and pole set of a several-complex-variable meromorphic function can intersect at a point. The distinguished points supporting the discrete spectrum are typically of this kind. The zeros of cuspidal Eisenstein series - largely invisible in the rank-one case - begin to play a starring role in higher rank situations, on equal footing with the poles. We redo Langlands' famous $G_{2}$ calculation and show that once zeros are tracked, the calculation reduces to elementary algebra. Drawing on rank-two examples, we introduce a program to re-think Langlands' construction from first principles, giving zeros and poles of cuspidal Eisenstein series equal standing from the very beginning. The program has the advantage of making the underlying phenomenon transparent, though carrying it out in full generality will require substantial further work.

We provide a new proof of Ishii's conjecture for any dihedral reflection group $G\subset GL_2(\mathbb{C})$ from the viewpoint of Bridgeland stability conditions. Our strategy is to reduce the problem, via the derived McKay correspondence, to a geometric construction of Bridgeland stability conditions on the root stack of the maximal resolution along the strict transform of the discriminant divisor.

The Lagrangian skeleton of the rational homology ball $B_{p,q}$, for $0<q<p$ coprime integers, is an immersed but not embedded Lagrangian, called a $(p,q)$-pinwheel. We show that any two embeddings of Lagrangian $(p,q)$-pinwheels in $B_{p,q}$ are related by a compactly supported Hamiltonian isotopy, establishing Arnold's nearby Lagrangian conjecture for this wide class of singular Lagrangians. Our proof has two largely independent parts: the first uses neck-stretching and the symplectic rational blow-up to understand embeddings of pinwheels up to symplectomorphism; the second computes that $\text{Symp}_c(B_{p,q})$ is generated by a twist about the pinwheel, which we call the pintwist $\tau_{p,q}$. We provide three applications of our methods: Gromov non-squeezing for pin-balls; a new proof of the local Lagrangian unknotting theorem of Eliashberg–Polterovich; and that the only Lagrangian $(n,m)$-pinwheel in $B_{p,q}$ is of type $(p,q)$.

We study the arithmetic and geometric iterated monodromy groups associated to the postcritically finite (PCF) quadratic rational function $f(x)=\frac{2}{(x-1)^2}$ defined over a number field $k$, whose critical points are both strictly pre-periodic. We give explicit recursive descriptions of the topological generators of the geometric iterated monodromy group of $f$ and show that the arithmetic iterated monodromy group has Hausdorff dimension zero. We describe an explicit criterion to determine the values $a \in k$ for which the associated arboreal Galois group achieves its maximum possible size. In particular, we show that maximality of the arboreal Galois group can already be verified at level four, which is computationally accessible. We also determine the normalizer of the geometric IMG of $f$ and show that the arithmetic IMG equals the normalizer if $\zeta_8$ is not contained in $k$. Finally, we show that when $k=\mathbb{Q}$, the constant field contains $\mathbb{Q}(\mu_{2^{\infty}})$, providing the first full study of a PCF quadratic map with non-abelian constant field.

We study rational Heron triangles with two marked square sides using elliptic curves and K3 surfaces. An explicit quartic-to-elliptic correspondence parametrizes marked similarity classes by rational points satisfying a positivity condition, modulo \((x,y)\sim(x,-y)\). We determine the generic Mordell–Weil group, prove that every \(k\in\mathbf Q\setminus\{0,\pm1\}\) supports infinitely many scalene classes with exactly two square sides, and construct a primitive family with \(N(X)\gg X^{1/4}\). Requiring the third side to be square gives a genus-three Ciani quartic whose Jacobian is \(\mathbf Q\)-isogenous to a product of three elliptic curves. Geometrically, the two constructions give inequivalent elliptic fibrations on a single singular K3 surface, with geometric Mordell–Weil ranks \(2\) and \(0\). The minimal resolution of the all-square locus is a surface of general type with invariants \((K^2,p_g,q)=(2,3,0)\). Assuming weak Bombieri–Lang, parameters yielding a nondegenerate all-square triangle form a thin subset of \(\mathbf P^1(\mathbf Q)\).

An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to determine the points of an equidistant set in general. Therefore, it is important to investigate some special cases. In the paper we investigate equidistant sets that can be given as the graph of a function. They are called equidistant functions. In the previously examined conceptual model, one of the focal sets is the horizontal hyperplane through the origin and the other one is the epigraph of a positive-valued, continuous function. The equidistant points form the graph of another function over the hyperplane. In a general situation, the hyperplane is the first-order (linear) approximation for one of the focal sets. A natural idea is to substitute the hyperplane by a circle (sphere) as a second-order (quadratic) approximation for one of the focal sets in more complicated cases. Such a generalization results in a new type of equidistant functions we are going to investigate in the present paper. Before considering the special cases in detail, we present some general observations: a necessary and sufficient condition for the existence of equidistant points along the vertical lines, upper/lower equidistant functions, equidistant functions, a necessary and sufficient condition for the existence of the equidistant function, equidistant functions and the minimum operator (a kind of commuting property).

A variant of the Falconer distance problem asks for fixed $k\geq 1$ and $d\geq k+1$, how large does the Hausdorff dimension of a Borel set $E\subset\mathbb{R}^d$ need to be to guarantee that there exist $x_0,\ldots,x_{k}\in E$ such that $\text{Vol}_{k+1}^{(x_0,\ldots,x_{k})}(E) = \lbrace \text{Vol}_{k+1}(x_0,\ldots,x_{k},x_{k+1}) : x_{k+1}\in E \rbrace$ has positive Lebesgue measure. Here $\text{Vol}_{k+1}(x_0,\ldots,x_{k},x_{k+1})$ denotes the $k+1$-volume of the $k+1$ simplex formed by $x_0,\ldots,x_{k},x_{k+1}$. Recently, Shmerkin and Yavicoli established a sharp dimensional threshold $k$ in the case when $d=k+1$. In this paper we extend their result to $k+1 \leq d \leq 2k$ and obtain a non-trivial dimensional threshold $d-k$ when $d>2k$. The result is motivated by ideas from Shmerkin and Yavicoli. A crucial part of the argument is an application of work by Bright, Ortiz and Zakharov on a continuum Beck-type theorem for hyperplanes as well as classic results of Marstrand on projections and slicing theorems. In addition, we investigate a more elementary approach under a condition called the Fubini property for Hausdorff dimension as introduced in the work of Héra, Keleti and Máthé.

Classical entropy regularization is poorly suited to continuous-time martingale transport, since relative entropy between diffusion laws typically forces their volatility characteristics to coincide. We introduce a specific-entropy framework based on Poisson jump approximations of continuous martingales. In the Gaussian-mark case, this yields explicit generalized specific entropy functionals on Wiener space, whose limiting costs depend not only on the limiting martingale laws but also on the microscopic approximation mechanism. This Poissonization approach avoids deterministic grid refinement and the associated high-dimensional multimarginal Sinkhorn problems, while allowing jump intensities to reflect local volatility. We prove weak convergence of the Poisson approximations and identify the limiting entropy functionals. For a trace-normalized Poisson scheme, the resulting cost defines a continuous-time specific-entropic martingale optimal transport problem, called SEMOT. This cost yields compactness, existence, and strong duality, and leads formally to a coupled Hamilton-Jacobi-Bellman/Fokker-Planck system. The resulting structure suggests Sinkhorn type numerical schemes, which we implement in one and two dimensions.

We establish the foundations of categorical weave calculus, developing the diagrammatic calculus of weaves and braid varieties within the study of Calabi-Yau triangulated categories and cluster tilting theory. This is achieved by associating a perverse sheaf of triangulated categories to each Demazure weave. A central contribution is the construction and study of the categorical Lusztig cycles and their duals, which we show form simple-minded and silting collections in the category of global sections of such a sheaf of categories. These categorical collections are built using the diagrammatics of weaves and we study their behavior under changes of weaves. For instance, we show that they undergo tilts under weave mutations. En route, we develop the study of categorical weighted braid words, as canonical rigid filtered dg modules over derived preprojective algebras, and the categorical incarnation of the tropical Lusztig rules, as a gluing mechanism for such filtered objects. Appendix A contains homological results, providing a novel construction of simple-minded and silting collections from full exceptional collections, and characterizing when these arise from a highest weight structure on an abelian category.

We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters $((4,q,2))_q$. Thus four physical qudits suffice to encode one logical qudit with distance two in the symmetric sector for every local dimension. We also show, using linear-programming constraints for permutation-invariant quantum codes, that no permutation-invariant code of dimension $q$ and distance at least $2$ exists in $\mathrm{Sym}^n(\mathbb{C}^q)$ for $n\leq 3$. Hence four qudits are necessary and sufficient. The construction has a simple representation-theoretic and combinatorial description. In the irreducible $\mathrm{SU}(q)$-module $\mathrm{Sym}^4(\mathbb{C}^q)$, the distance-two Knill-Laflamme conditions split into root and Cartan parts. By restricting supports to the even-entry occupation layer, all root-error conditions vanish automatically. The remaining Cartan conditions reduce to linear balancing constraints on packets of occupation vectors. These packets admit a natural graph-theoretic interpretation in terms of the vertices and edges of the complete graph $K_q$: for odd $q$, they are organized by the midpoint rule, while for even $q$, they are organized by a decomposition of $K_q$ into perfect matchings. In this way, the existence of minimal $((4,q,2))_q$ permutation-invariant codes is reduced to a parity-dependent edge-coloring problem on $K_q$.

We study the Lorentzian Wetterich Renormalization Group (RG) flow equation for interacting quantum fields on curved backgrounds within the framework of perturbative Algebraic Quantum Field Theory (pAQFT). Specifically, we consider two classes of models: two mutually interacting scalar fields on globally hyperbolic spacetimes without boundary and, under the further assumption that the underlying background is spin, self-interacting Dirac fields. In both cases, we derive the corresponding RG flow equations within a Local Potential Approximation and compute the beta functions for the relevant couplings. For the scalar model, we also discuss an asymmetric interaction potential which is formally reminiscent of the Martin-Siggia-Rose description of a stochastic dynamics, thereby indicating a possible connection between Lorentzian algebraic RG methods [DDP+24] and stochastic field-theoretic models, [Duc25]. In addition, we address the local well-posedness of the resulting flow equations. Adapting the strategy detailed in [DP23] and based on the the Nash-Moser theorem, we prove local existence and uniqueness of solutions for both the scalar and the Dirac models.

Given a minimal action $G\curvearrowright X$ of a countable group $G$ on a compact space $X$, we prove that if the reduced crossed product $G\ltimes_rC(X)$ is simple, then there exists a point whose stabilizer subgroup has trivial amenable radical. As a consequence, we give a complete characterization of the simplicity of the reduced crossed product of minimal actions of countable linear groups, hyperbolic groups, and, more generally, for groups with countably many amenable subgroups. This answers a question of Ozawa (2014) for these classes of groups. Furthermore, in the case of an infinite uniformly recurrent subgroup of a $C^*$-simple group, we prove that almost every subgroup has a trivial amenable radical, with respect to a fully supported, atomless probability measure.

Erasure codes are a critical component in reliable storage systems today, and many blockchain systems use consensus protocols that involve erasure codes to reduce their communication cost. Existing erasure codes rely on a threshold failure assumption, but recent blockchain systems have departed from this simple model and use generalized failure assumptions. This paper introduces monotone erasure codes that respect arbitrary trust assumptions on a set of nodes. The paper first describes a method for constructing a monotone erasure code from any access structure given by a monotone Boolean formula. Next, the relevant notion of a linear monotone erasure code is introduced, which works on vectors over a finite field and where the encoding is a linear operation. We then focus on constructing linear monotone erasure codes: We give an efficient algorithm to construct linear monotone erasure codes for any access structure, and we show how to efficiently construct linear monotone erasure codes for the special case of partitioned access structures with minimal storage overhead. Last but not least, this work also shows how to use monotone erasure codes to obtain a communication-efficient, generalized version of the well-known asynchronous verifiable information dispersal (AVID) primitive, which is a key building block for developing efficient reliable broadcast and consensus protocols.

We study long-range nonstabilizerness (LRN), namely the obstruction to remove nonstabilizerness with shallow-depth local quantum circuits. In one-dimensional settings, the mutual information between disconnected spatial regions has proven to be a powerful tool to diagnose LRN. In this work, we focus on encoded states of two-dimensional topologically-ordered systems, and explore the ability of the mutual information to serve as a diagnostic of LRN. Focusing on the concrete setting of lattice models defined on a torus, we show that information about LRN can be gained from the analysis of the mutual information between non-overlapping regions containing non-contractible loops, and of the change of such mutual information under modular real-space transformations. We exemplify this idea in the toric code and the non-abelian string-net model with doubled Fibonacci topological order. In the former case, we show that the mutual information provides a full classification, certifying LRN for all encoded non-stabilizer states. In the latter case, instead, our approach does not lead to a full classification, as it detects LRN for all states except from a finite subset with special transformation properties under the modular group. Finally, we discuss how our results on LRN constrain the logical gates that can be implemented fault-tolerantly on the torus.