Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 5 May

Analysis of PDEs

Linear instability of a Burgers–Hilbert traveling wave

We study the stability of traveling wave solutions to the Burgers–Hilbert equation on $\mathbb{T}$ in the regime of small frequency $\omega$ and large wave speed $c$. For $\omega = 3$ and $c \approx 1.1$, we show that the linearized operator around these solutions has an eigenvalue with negative real part, indicating spectral instability. Our approach is computer-assisted: we reduce the problem to a finite-dimensional system and solve it rigorously using interval arithmetic. The Burgers–Hilbert equation arises as a quadratic approximation of the vortex patch problem for the two-dimensional Euler equations. In this setting, our results point to the instability of threefold symmetric V-states.
Read the full abstract

Classical Analysis and ODEs

Exact ReLU realization of tensor-product refinement iterates

We study scalar dyadic refinement operators on R^2 of the form (Vf)(x,y) = sum_{(j,k) in Z^2} c_{j,k} f(2x-j, 2y-k), where only finitely many mask coefficients c_{j,k} are nonzero. Under a fixed support-window hypothesis, we prove that for every compactly supported continuous piecewise linear seed g:R^2->R, the iterates V^n g admit exact ReLU realizations of fixed width and depth O(n). This gives a first genuinely two-dimensional extension of the exact realization theory for refinement cascades. Using the one-dimensional exact loop-controller framework, the proof transports the tensor-product residual dynamics exactly on the product of two polygonal loops and reduces the remaining seam ambiguity to a final readout and selector step. The matrix cascade is then handled by a fixed-depth recursive block, and general compactly supported continuous piecewise linear seeds are reduced to a finite decomposition together with exact clamped gluing on the support window. This identifies the tensor-product dyadic case as a natural first multivariate instance of the loop-controller method for refinement iterates.
Read the full abstract

Combinatorics

Lattice characterization of cyclic interval hypergraphic posets

Hypergraphic polytopes $\Delta_{\mathbb{H}}$ arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph $\mathbb{H}$. Orienting the $1$-skeleton of such a polytope by a certain generic linear functional gives rise to the hypergraphic poset $P_{\mathbb{H}}$. Hypergraphic posets include the weak order for the permutahedron and the Tamari lattice for the associahedron. This motivates the problem of determining when $P_{\mathbb{H}}$ is a lattice. In this paper, we give a complete lattice characterization for cyclic interval hypergraphs, extending the result of Bergeron and Pilaud for interval hypergraphs, and the result of Adenbaum et al. for the complete cyclic interval hypergraph.
Read the full abstract

Combinatorics

Packing chromatic critical graphs with radius at most 2

For a graph $G$ with vertex set $V(G)$ and a positive integer $i$, an $i$-packing in $G$ is a subset $X$ of $V(G)$ such that the distance between any two distinct vertices of $X$ is greater than $i$. The packing chromatic number of $G$, denoted by $\chi_{\rho}(G)$, is the smallest positive integer $k$ for which there exists a partition $X_1, X_2, \ldots, X_k$ of $V(G)$ such that $X_i$ is an $i$-packing in $G$ for every $i \in [k]$. A graph $G$ is called $\chi_\rho$-critical if $\chi_\rho(H) < \chi_\rho(G)$ holds for every proper subgraph $H$ of $G$. In this paper, we provide a structural characterization of $\chi_{\rho}$-critical graphs with radius $1$, and completely determine the $\chi_{\rho}$-critical cactus graphs with radius $2$ and diameter $2$ or $3$.
Read the full abstract

Probability

Bundles of Probability Schemes

We study finite probability through a category whose objects are finite probability schemes and whose morphisms are probability-preserving maps, called bundles. A bundle simultaneously records a quotient of a sample space, the corresponding algebra of random variables, and the conditional schemes on its fibers. The pullback, transfer, and fiberwise averaging maps associated with a bundle give a functorial construction of conditional expectation and its projection properties. This recovers serveral fundamental results in elementary probability. Fiber products of bundles encode conditional independence, and iterated fiber products describe finite Markov chains from their adjacent-pair distribution schemes. Finally, the transfer map is identified with a relative trace, so the projection formula and base-change identity become instances of Frobenius reciprocity and Beck–Chevalley condition.
Read the full abstract

2605.03902 · 5 May · 20 pages; no figures. Replaces the previous version with revised exposition, clarified fiber-product notation and associativity, expanded Markov-chain applications, and a new appendix on relative trace, Frobenius reciprocity, and Beck–Chevalley base change

Probability

Dimer models on astroidal zig-zag graphs

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are encoded by the inverse of the so-called Kasteleyn matrix; for a large graph, typically taken as a finite domain in a periodic graph, this inverse matrix is known explicitly only for a handful of examples. In all previously known examples, the Newton polygon – a convex lattice polygon that classifies periodic graphs up to local moves – is either a triangle or a quadrilateral. Our main results are the following. For any (minimal) periodic planar bipartite graph, we construct an $(n-3)$-dimensional family of finite subgraphs for which we obtain an explicit inverse Kasteleyn matrix; here $n$ is the number of sides of the Newton polygon. Their boundaries are formed by zig-zag paths and their overall shape is reminiscent of an astroid; we call them astroidal zig-zag graphs (AZ graphs). If the Newton polygon is the unit square then the corresponding AZ graph is the celebrated Aztec diamond with its size as the parameter. Our inverse Kasteleyn matrices are given by a double contour integral on the corresponding spectral curve for any Fock weighting of the graph. This includes, in particular, all periodic weightings. For periodic weightings, we asymptotically analyze the resulting inverse Kasteleyn matrices. We establish a phase separation in large AZ graphs into asymptotically frozen, rough (liquid), and smooth (gaseous) regions, and obtain an explicit parametrization of the `arctic curve'. We also compute the deterministic limit of the height function, known as the limit shape, and prove the convergence of the local dimer correlations to the translation-invariant Gibbs measure of the slope predicted by the limit shape.
Read the full abstract

Algebraic Topology

Quasimonophobic graphs and degree spectral sequences in discrete cubical homology

We introduce the degree filtration on the discrete cubical chain complex of a graph, defined in terms of the maximal injective dimension of the facets of singular $n$-cubes, and study the degree spectral sequence which arises from this filtration. This spectral sequence interpolates between the discrete cubical homology of a graph $H_n(G)$ and the injective homology $H_n^{inj}(G)$, a variant of the discrete cubical homology based on injective singular cubes. Building on the work of Greene and the first author, we introduce the combinatorial condition of quasimonophobicity on graphs, and show quasimonophobicity implies both the vanishing of the degree spectral sequence in certain bidegrees, and implies $H_n^{inj}(G)$ is isomorphic to the homology of the CW complex obtained by “filling in” subcubes of the graph. These results are applied to compute $H_2(G_n^{sph})$ for the Greene sphere graphs $G^{sph}_n$.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs

We study the problem of efficiently finding large common induced subgraphs of two independent Erdős–Rényi random graphs $G_1, G_2 \sim \mathbb{G}(n,1/2)$. Recently, Chatterjee and Diaconis showed that the largest common induced subgraph of $G_1$ and $G_2$ has size $(4-o(1))\log_2 n$ with high probability. We first show that a simple greedy online algorithm finds a common induced subgraph of $G_1$ and $G_2$ of size $(2-o(1)) \log_2 n$ with high probability. Our main result shows that no online algorithm can find a common induced subgraph of $G_1$ and $G_2$ of size at least $(2+\varepsilon) \log_2 n$ with probability bounded away from $0$ as $n \to \infty$. Together, these results provide evidence that this problem exhibits a computation-to-optimization gap. To prove the impossibility result, we show that the solution space of the problem exhibits a version of the (multi) overlap gap property (OGP), and utilize an interpolation argument recently developed by Gamarnik, Kizildağ, and Warnke that connects OGP and online algorithms.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.str-el

Parameterized Families of Toric Code Phase: $em$-duality family and higher-order anyon pumping

Within the toric-code phase, we study parameterized families of topologically ordered states. We construct $1$- and $2$-parameter families of local Hamiltonians and confirm their non-triviality via topological pumping. For the $1$-parameter family, we show that the $em$-exchange defect is pumped into the bond Hilbert space of a tensor-network representation. For the $2$-parameter case, we construct a “pump of a pump” that transports an $S^1$-family of a system in one lower spatial dimension. Using similar methods, we also present a $1$-parameter family with a higher-order anyon pump that produces corner-localized anyon modes. These constructions provide explicit lattice realizations and concrete diagnostics of family-level topology. We use recently developed boundary algebra methods to study the non-triviality of these families.
Read the full abstract

Algebraic Geometry

Equivariant intermediate Jacobians and intersections of two quadrics

We present a short proof of the following theorem of Hassett and Tschinkel: for every finite group $G$, a $G$-equivariant smooth complete intersection of two quadrics in $\mathbb{P}^5_{\mathbb{C}}$ is projectively $G$-linear if and only if it contains a $G$-invariant line.

Statistics Theory · Cross-listed from stat.CO

More Permutations Do Not Always Increase Power: Non-monotonicity in Monte Carlo Permutation Tests

Monte Carlo permutation tests are a cornerstone of valid, model-free statistical inference. A widely held practical intuition is that increasing the number of sampled permutations improves test performance, in particular that statistical power tends to increase with the Monte Carlo budget. In this paper, we show that these intuitions are false in general. Leveraging the saw-toothed structure of power arising from distributional discreteness, we provide a simple structural explanation for why power can decrease as the number of sampled permutations increases, and we prove that such decreases occur infinitely often as the Monte Carlo budget grows.
Read the full abstract

All authors Suman Cha, Seongchan Lee, Antonin Schrab, Ilmun Kim

Optimization and Control · Cross-listed from cs.LG

On Adaptivity in Zeroth-Order Optimization

We investigate the effectiveness of adaptive zeroth-order (ZO) optimization for memory-constrained fine-tuning of large language models (LLMs). Contrary to prior claims, we show that adaptive ZO methods such as ZO-Adam offer no convergence advantage over well-tuned ZO-SGD, while incurring significant memory overhead. Our analysis reveals that in high dimensions, ZO gradients lack coordinate-wise heterogeneity, rendering adaptive mechanisms memory inefficient. Leveraging this insight, we propose MEAZO, a memory-efficient adaptive ZO optimizer that tracks only a single scalar for global step size adaptation. We support our method with theoretical convergence guarantees under standard assumptions. Experiments across multiple LLM families and tasks demonstrate that MEAZO matches ZO-Adam's performance with the memory footprint of ZO-SGD. Additional experiments on synthetic quadratic problems and LLM fine-tuning further demonstrate MEAZO's enhanced robustness to step size choices, particularly in grouped or block-structured optimization settings.
Read the full abstract

All authors Hassan Dbouk, Nidham Gazagnadou, Matthias Reisser, Christos Louizos

Logic

A Foundation for the Core Mathematician

The foundations of mathematics have long been considered settled by the Zermelo-Fraenkel-Choice axioms. But set theory abounds in models with different truths and even classical questions such as the measurability of projective sets can vary between models. The core of mathematics resides in the study of structures built from the set R of real numbers. This paper proposes a foundation for core mathematics, with both a system of axioms and a definite model of those axioms, in which essentially all core mathematics is incorporated. This definite model delivers a definite truth-value, either true or false, to any core mathematical assertion.
Read the full abstract

Functional Analysis

Geometric Perspective on Concentration Phenomena in Frame Theory

Parseval and equal-norm frames play a fundamental role in frame theory and signal processing. It is known that a random frame, with unit vectors drawn independently from the uniform distribution on the sphere, will be nearly Parseval with high probability; asymptotic results go back at least to Goyal, Vetterli, and Thao and a non-asymptotic error bound was proved more recently by Kwok, Lau, and Ramachandran. In this work, we prove a dual result, which shows that random Parseval frames, with respect to the Haar measure, are nearly equal-norm with high probability. Our proofs are geometric in nature, and rely on general measure concentration principles in Riemannian manifolds. Using these techniques, we also give a novel probabilistic upper bound for the Paulsen problem.
Read the full abstract

Numerical Analysis

A Recursive Polynomial Chaos Evolution Method for Stochastic Differential Equations

Numerical simulation of stochastic differential equations over long time intervals poses significant computational challenges. In this paper, we propose a novel recursive polynomial chaos evolution method that achieves model reduction without sampling by exploiting the Markov property to maintain a fixed low-dimensional representation throughout the time evolution. At each time step, we construct orthogonal polynomial bases adapted to the current probability measure, and project the one-step-ahead solution onto this new basis together with the new Brownian increments. This dynamic updating strategy effectively reduces the dimension of the random variables during long-time evolution. Under appropriate assumptions, we prove the convergence of the method, specifically that the distributions generated by the method preserve convergence in the Wasserstein-1 distance. We present numerical results demonstrating that the method can accurately capture complex dynamical behaviors with high accuracy and low computational cost.
Read the full abstract

All authors Guillaume Bal, Shengbo Ma, Su Zhang, Zhiwen Zhang

Differential Geometry

Holomorphically parallelizable solvmanifolds with special metrics and their deformations

We investigate the existence of strong Kähler with torsion metrics along deformations of the Iwasawa manifold and of the holomorphically parallelizable Nakamura manifold. We also show that the class of deformations of the holomorphically parallelizable Nakamura manifold yielding a non-left-invariant complex structure admits a balanced metric but does not admit any strong Kähler with torsion metric. We then construct the Kuranishi space of a $4$-dimensional holomorphically parallelizable solvmanifold and study whether small deformations of such a manifold admit SKT metrics. Finally, we provide some results concerning the existence of metrics satisfying $\partial \bar{\partial} \omega = 0$, $\partial \bar{\partial} \omega^2 = 0$ on a particular class of $2$-step nilpotent nilmanifolds.
Read the full abstract

Probability

The Relay Random Tree: A Stochastic Geometry Approach of Multihop Relay in an Urban Visibility Setting

In a recent work (Lee, Baccelli $'25$), a one dimensional stochastic geometry model was introduced to study Line of Sight (LoS) connections using Reconfigurable Intelligent Surfaces (RIS), in the context of non terrestrial networks. In this model, signal can be propagated in a urban environment, with buildings acting as obstacles with RIS (which, for the scope of this present article can essentially be thought of as relays) on their rooftops, relaying the connection. The present paper extends this model by both allowing arbitrary distributions for the buildings heights, and considering multi-hop connections. Those generalities also lead to considering structural problems linked to the total load of a relay. Furthermore, studying this Line of Sight connection geometry at the light of geometric random graph theory, we show that it constitutes a computationally well understood example that highlights the different classes of the Eternal Family Trees (EFTs) classification.
Read the full abstract

Probability · Cross-listed from cs.DS

On Computing Total Variation Distance Between Mixtures of Product Distributions

We study the problem of approximating the total variation distance between two mixtures of product distributions over an $n$-dimensional discrete domain. Given two mixtures $\mathbb{P}$ and $\mathbb{Q}$ with $k_1$ and $k_2$ product distributions over $[q]^n$, respectively, we give a randomized algorithm that approximates $d_{\mathrm{TV}}\left({\mathbb{P}},{\mathbb{Q}}\right)$ within a multiplicative error of $(1\pm \varepsilon)$ in time $\mathrm{poly}((nq)^{k_1+k_2},1/\varepsilon)$. We also study the special case of mixtures of Boolean subcubes over $\{0,1\}^n$. For this class, we give a deterministic algorithm that exactly computes the total variation distance in time $\mathrm{poly}(n,2^{O(k_1+k_2)})$, and show that exact computation is $\#\mathsf{P}$-hard when $k_1+k_2=\Theta(n)$.
Read the full abstract

All authors Weiming Feng, Yucheng Fu, Minji Yang, Anqi Zhang

Algebraic Geometry

Birational Classification of Orbifold Compactified Jacobians

We study the equivariant orbifold birational classification problem for families of toroidal compactifications of a group $G$ over a toroidal base, in the cases where $G$ is an algebraic torus or a semiabelian scheme. The classification is reduced to the problem of finding the minimal orbifold toroidal compactifications of $G$ in the world of logarithmic geometry, which is shown to be a combinatorial problem. We solve the problem for families of algebraic tori, Jacobians of families of nodal curves, and semiabelian schemes with abelian generic fiber. The general semiabelian case is reduced to an open conjecture. These results generalize and geometrically interpret recent results of Schmitt.
Read the full abstract

Geometric Topology

Large genus asymptotics for frequency of non-simple curves

We give an expression for the frequency of non-simple curves in closed surfaces and exploit it to study relative frequencies of such curves in large genus. This extend to the case of non-simple curves Mirzakhani's expressions of frequencies in terms of Konsevitch polynomials and Delecroix-Goujard-Zograf-Zorich large genus asymptotics for those frequencies. In particular, with K fixed, we identify which types of curves with K intersections are most common.
Read the full abstract

All authors Mingkun Liu, Kasra Rafi, Juan Souto, Marie Trin

Logic

A Topological Rainbow Ramsey Theorem

We show that it is consistent relative to the existence of suitable large cardinals that for any countable-to-one coloring $c: [\omega_2]^2\to \omega_2$, there exists a closed subset $A\subseteq \omega_2$ of order type $\omega_1$ such that $c\restriction [A]^2$ is injective. This theorem simultaneously strengthens two theorems, one by Abraham, Cummings and Smyth and another one by Garti and Zhang, as well as answers a question raised by Garti and Zhang. New combinatorial principles involving towers of countable elementary submodels, games concerning regressive functions and variants of strong Chang's conjecture, which are key elements of the proof, are investigated.
Read the full abstract

Combinatorics

A generalization of Erdős-Hajnal problem on paths with equal-degree endpoints

Erdős and Hajnal proposed a problem that: is it true that every $(2n+1)$-vertex graph with $n^2+n+1$ edges contains two vertices of equal degree connected by a path of length three? The edge bound is sharp by the complete bipartite graph $K_{n,n+1}$. Recently, Chen and Ma [Journal of Combinatorial Theory, Series B, 179:1-18, 2026] answered this problem affirmatively for every $n \ge 600$. In the same paper, they further conjectured that for sufficiently large $n$, the statement is true if we replace the path of length three by a path of fixed odd length. In this paper, we confirm their conjecture.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Realizable Bayes-Consistency for General Metric Losses

We study strong universal Bayes-consistency in the realizable setting for learning with general metric losses, extending classical characterizations beyond $0$-$1$ classification (Bousquet et al., 2020; Hanneke et al., 2021) and real-valued regression (Attias et al., 2024). Given an instance space $(X,\rho)$, a label space $(Y,\ell)$ with possibly unbounded loss, and a hypothesis class $H \subseteq Y^{X}$, we resolve the realizable case of an open problem presented in Tsir Cohen and Kontorovich (2022). Specifically, we find the necessary and sufficient conditions on the hypothesis class $H$ under which there exists a distribution-free learning rule whose risk converges almost surely to the best-in-class risk (which is zero) for every realizable data-generating distribution. Our main contribution is this sharp characterization in terms of a combinatorial obstruction: Similarly to Attias et al. (2024), we introduce the notion of an infinite non-decreasing $(\gamma_k)$-Littlestone tree, where $\gamma_k \to \infty$. This extends the Littlestone tree structure used in Bousquet et al. (2020) to the metric loss setting.
Read the full abstract

Dynamical Systems · Cross-listed from physics.app-ph

Data-driven Initial Gap Identification of Piecewise-linear Systems using Sparse Regression and Universal Approximation Theorem

This paper proposes a method for identifying an initial gap in piecewise-linear systems from data. Piecewise-linear systems appear in many engineered systems such as degraded mechanical systems and infrastructures, and are known to show strong nonlinearities. To analyze the behavior of such piecewise-linear systems, it is necessary to identify the initial gap, at which the system behavior switches. The proposed method identifies the initial gap by discovering the governing equations using sparse regression and calculating the gap based on the universal approximation theorem. A key step to achieve this is to approximate a piecewise-linear function by a finite sum of piecewise-linear functions in sparse regression. The equivalent gap is then calculated from the coefficients of the multiple piecewise-linear functions and their respective switching points in the obtained equation. The proposed method is first applied to a numerical model to confirm its applicability to piecewise-linear systems. Experimental validation of the proposed method has then been conducted with a simple mass-spring-hopping system, where the method successfully identifies the initial gap in the system with high accuracy.
Read the full abstract

Optimization and Control

Ball-proximal point method on a Hadamard Manifolds

We consider the problem of minimizing a proper, lower semicontinuous, geodesically convex function on a Hadamard manifold. Building on ball-proximal (broximal) ideas in the Euclidean setting, viewed as an abstract proximal-type algorithm, we propose and analyze a Riemannian ball-proximal point method (RB-PPM) whose basic step consists of minimizing the objective function over a metric ball centred at the current iterate. We first introduce the Riemannian broximal map, prove existence and uniqueness of broximal points on Hadamard manifolds, and derive a KKT-type characterization involving a scalar parameter and the Riemannian subdifferential. We then show that RB-PPM enjoys a strict decrease of the squared distance to the solution set whenever the current ball does not contain a minimizer. This leads to quasi-Fejér monotonicity, finite termination for constant radii, and a product-form linear decay of the objective values up to the hitting time of the solution set. We also obtain nonasymptotic complexity bounds for the norms of suitable subgradients and for the function values, including a linear rate in the number of iterations under constant radii. Finally, we establish an asymptotic dichotomy, if the sum of the radii diverges, then the objective values converge to the optimal value, and, when the solution set is nonempty, the entire sequence of iterates converges to a minimizer. The resulting scheme provides a geometry-aware, ball-based analog of classical Riemannian proximal point methods.
Read the full abstract

All authors F. Babu, O. P. Ferreira, L. F. Prudente, Jen-Chih Yao, Xiaopeng Zhao

Commutative Algebra

Epsilon multiplicity, multiplicity=volume formula and analytic spread of family of ideals

In an analytically unramified local ring $(R,\mathfrak m)$ of dimension $d\geq 1$, for a filtration of ideals $\mathfrak {I}=\{I_m\}_{m\in\mathbb N}$ satisfying $\mathfrak A(r)$ condition and for any $\mathfrak m$-primary ideal $K$, it is shown in $[18]$ that the epsilon multiplicity of the weakly graded family of ideals $\{(I_m:K)\}_{m\in\mathbb N}$ exists as a limit and it is bounded above by the epsilon multiplicity of $\mathfrak I$, $\epsilon(\mathfrak I)$. In this article, we first show that $\epsilon(\mathfrak I)$ coincides with the epsilon multiplicity of $\{(I_m:K)\}_{m\in\mathbb N}$ and this leads to the following: $(a)$ an expression for $\epsilon(\mathfrak I)$ as a limit of the epsilon multiplicities of other graded families of ideals and $(b)$ a multiplicity=volume formula for the epsilon multiplicity of an ideal $I$ in $R$. In the final part of the article, we investigate the maximality of the analytic spread of filtrations of ideals.
Read the full abstract

Commutative Algebra

Large homomorphisms on the homotopy lie coalgebra

We introduce and study a notion of large homomorphisms on the homotopy lie coalgebra; these homomorphisms are a variant of the large homomorphisms of Levin. As a consequence of our work, we establish new cases of a homotopy lie coalgebra analog of a conjecture of Quillen as proposed by Briggs.
Read the full abstract

Differential Geometry

Partial Regularity of Stable Stationary Harmonic Maps into Certain Lie Groups

Let $M$ be a compact Riemannian manifold, and let $G$ be a compact simple Lie group with bi-invariant metric that is not $\operatorname{Sp}(n)$ for $n \geq 8$, $E_{8}$, $F_{4}$, or $G_{2}$. We show that the singular set of any stable stationary harmonic map $u : M \to G$ has Hausdorff codimension at least four. We also find examples of maps into these manifolds with codimension four singularities to show that we cannot reduce the dimension of the singular set any further.
Read the full abstract

Information Theory

Complex Analysis of Channel Polarization on Discrete BMS Channels

We develop component evolution (CE), a framework based on complex function theory for finite-blocklength channel polarization on discrete binary-input memoryless output-symmetric (BMS) channels. In this view, the Bhattacharyya parameter is treated as a real-valued instance of a broader class of complex-valued channel functionals. CE systematically derives analytic expressions for the Bhattacharyya parameters of the bit-channels of a given discrete BMS channel at arbitrary polarization levels. CE also enables structural analysis, providing new evidence of extremality of the binary erasure channel (BEC) and binary symmetric channel (BSC), and revealing new channel-dependent recursions for a class of BSC bit-channels.
Read the full abstract