Mathematical Physics · Cross-listed from quant-ph
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 14 April
Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework for stabilizer codes that relaxes these constraints while preserving the symplectic commutation structure on the binary symplectic space $\mathbb{F}_{2}^{2}$. The approach permits controlled overlap between X- and Z-check supports, leading to quasi-orthogonal Pauli operators and a generalized notion of effective distance defined via induced anti-commutation with logical operators. This relaxation expands the stabilizer design space, enabling codes that approach the Gilbert-Varshamov regime with improved logical rates at moderate distances. Finite-length constructions, including quasi-orthogonal variants of the $[[8,3,\approx 3]]$, $[[10,4,\approx 3]]$, $[[13,1,5]]$, and $[[29,1,11]]$ codes, demonstrate consistent improvements over strictly orthogonal counterparts. Under depolarizing noise with error rates up to $p=0.30$, logical error rates, fidelities, and trace distances improve by up to two orders of magnitude. These improvements reflect the increased connectivity of the underlying stabilizer geometry while remaining compatible with standard decoding schemes. The proposed framework offers a principled extension of stabilizer code design through quasi-orthogonal geometric structures.
Algebraic Topology
Kahn-Priddy theorems via the norm
We revisit the Kahn-Priddy theorem from the perspective of modern equivariant homotopy theory. This allows for a short proof that may be applied in other settings with sufficiently robust analogues of multiplicative norms and the Adams isomorphism. We illustrate this by establishing new Kahn-Priddy theorems in $L_n$ and $L_n^f$-local homotopy theory, motivic homotopy theory, and synthetic homotopy theory.
Read the full abstract
Analysis of PDEs
Stability of the Sobolev–Escobar bridge inequality
We study the local stability of the bridge family \[ \Phi(T):=\inf_{u\in\mathcal A_T}\|\nabla u\|_{L^2(\mathbb R^n_+)}, \qquad T>0,\quad n\ge3, \] where \[ \mathcal A_T := \Bigl\{ u\in \dot H^1(\mathbb R^n_+): \|u\|_{L^{\frac{2n}{n-2}}(\mathbb{R}_{+}^n)}=1,\ \|u\|_{L^{\frac{2(n-1)}{n-2}}(\partial\mathbb{R}_{+}^n)}=T \Bigr\}, \] and \(\dot H^1(\mathbb R^n_+)\) is the completion of \(C_c^\infty(\overline{\mathbb R^n_+})\) in the norm \(\|\nabla \varphi\|_{L^2(\mathbb R^n_+)}\). Let \(\mathcal M_T\) denote the set of minimizers of \(\Phi(T)\). We prove that, for every \(T\neq T_E\), there exists \(\alpha_T>0\) such that \[ \|\nabla u\|_{L^2(\mathbb{R}_{+}^n)}^2-\Phi(T)^2 \ge \alpha_T\,d_T(u,\mathcal M_T)^2 +o\!\bigl(d_T(u,\mathcal M_T)^2\bigr) \qquad\text{for all }u\in\mathcal A_T, \] where \(T_E\) is the Escobar threshold and \(d_T\) is the distance in \(\dot H^1(\mathbb R^n_+)\).{for all }u\in\mathcal A_T, \] where \(T_E\) is the Escobar threshold and \(d_T\) is the distance in \(\dot H^1(\mathbb R^n_+)\).
Read the full abstract
Functional Analysis
The Dedekind completion of an Archimedean ordered vector space as a reflector
We consider the category $\mathbf{AOVS}$ of Archimedean ordered vector spaces with linear maps which preserve all existing suprema, and its full subcategories $\mathbf{DAOVS}$, $\mathbf{DVL}$ and $\mathbf{UVL}$, consisting of directed spaces, Dedekind complete vector lattices and universally complete vector lattices, respectively. We deduce from some results in the literature that $\mathbf{DVL}$ and $\mathbf{UVL}$ are reflective subcategories of $\mathbf{DAOVS}$, with the usual Dedekind completion being the reflector in $\mathbf{DVL}$. In contrast to these facts, we show that a non-directed Archimedean ordered vector space of dimension greater than $1$ has no reflector in either $\mathbf{DVL}$ or $\mathbf{UVL}$. In particular, there are no free Dedekind complete vector lattices over a set with more than one element. We also use the occasion to show that a free vector lattice with $\alpha$ generators embeds into a free vector lattice with $\beta$ generators if and only if $\alpha\le\beta$, and explore the concept of the free completion of an Archimedean vector lattice with a strong unit.
Read the full abstract
Optimization and Control
Data-driven Reachable Set Estimation with Tunable Adversarial and Wasserstein Distributional Guarantees
We study finite horizon reachable set estimation for unknown discrete-time dynamical systems using only sampled state trajectories. Rather than treating scenario optimization as a black-box tool, we show how it can be tailored to reachable set estimation, where one must learn a family of sets based on whole trajectories, while preserving probabilistic guarantees on future trajectory inclusion for the entire horizon. To this end, we formulate a relaxed scenario program with slack variables that yields a tunable trade-off between reachable set size and out-of-sample trajectory inclusion over the horizon, thereby reducing sensitivity to outliers. Leveraging the recent results in adversarially robust scenario optimization, we then extend this formulation to account for bounded adversarial perturbations of the observed trajectories and derive a posteriori probabilistic guarantees on future trajectory inclusion. When probability distribution shifts in the Wasserstein distance occur, we obtain an explicit bound on how gracefully the theoretical probabilistic guarantees degrade. For different geometries, i.e., $p$-norm balls, ellipsoids, and zonotopes, we derive tractable convex reformulations and corroborate our theoretical results in simulation.
Read the full abstract
Numerical Analysis
Sharp inf-sup estimate for the Stokes equation in tight domains with periodic pillars and some numerical implications
The predictive simulation of fluid dynamics in densely packed microfluidic devices, such as Deterministic Lateral Displacement (DLD) arrays, stagnates with standard iterative solvers. We show that this failure is not algorithmic but rooted in the pre-asymptotic degradation of the pressure-velocity coupling stability. For periodic pillar geometries in a generalized lattice framework, we prove that the continuous Ladyzhenskaya-Babuška-Brezzi (LBB) condition, also called the inf-sup constant, deteriorates exactly as $m^{-1}$ up to a positive multiplicative constant, where $m$ is the pillar density (the number of pillars per unit length). This induces a priori error amplification proportional to $m$ and a pressure Schur complement condition number scaling as $\mathcal{O}(m^2)$. To overcome this theoretical limit, we propose a parameter-free, adaptively scaled Augmented Lagrangian (AL) stabilization strategy with penalty $\gamma \propto m^2$. Numerical experiments on both standard square and asymmetric DLD arrays validate the theoretical bounds: the AL method reduces outer FGMRES iterations from 437 to 22 on a 1.85M-DoF square array and from 687 to 24 on a 1.77M-DoF DLD array.
Read the full abstract
Combinatorics
Induced poset saturation in the hypergrid
Set $[n]=\{1, 2, \ldots , n\}$. The hypergrid $[t]^n$ is the collection of functions $f: \ [n]\rightarrow [t]$. We equip it with the natural partial order by letting $f\leq g$ whenever $f(x)\leq g(x)$ holds for all $x\in [n]$. Given a poset $P$ which can be embedded as an induced subposet of $[t]^n$, the induced poset saturation function $\mathrm{sat}^{\star}([t]^n, P)$ denotes the minimum size of a subset of $[t]^n$ that is both induced $P$-free and induced $P$-saturated. We show that for all $t\geq 2$, $\mathrm{sat}^{\star}([t]^n, P)$ satisfies a dichotomy: for every poset $P$, either there exists a constant $C_P$ such that $\mathrm{sat}^{\star}([t]^n, P)=C_P$ for all $n$ sufficiently large, or $\mathrm{sat}^{\star}([t]^n, P)=\Omega(\sqrt{n})$. We also show chains fall in the former part of the dichotomy, while posets with the unique twin cover property fall in the latter part. These contributions generalize a number of results obtained by various authors in the hypercube ($t=2$) setting; the transition to the hypergrid setting provides novel challenges, however, and requires some new ideas.
Read the full abstract
Spectral Theory
Spectral pollution in substitution systems
We study spectral properties of Schrödinger operators associated with substitution dynamical systems in higher dimensions. Focusing on periodic approximations generated by iterating substitutions on initial configurations, we analyze how structural defects influence the limiting spectral behavior. In contrast to the one-dimensional setting, we show that such approximations may exhibit significant spectral pollution, including changes in the essential spectrum and the Lebesgue measure.
Read the full abstract
Optimization and Control
A Comparison of Reinforcement Learning and Optimal Control Methods for Path Planning
Path-planning for autonomous vehicles in threat-laden environments is a fundamental challenge. While traditional optimal control methods can find ideal paths, the computational time is often too slow for real-time decision-making. To solve this challenge, we propose a method based on Deep Deterministic Policy Gradient (DDPG) and model the threat as a simple, circular `no-go' zone. A mission failure is claimed if the vehicle enters this `no-go' zone at any time or does not reach a neighborhood of the destination. The DDPG agent is trained to learn a direct mapping from its current state (position and velocity) to a series of feasible actions that guide the agent to safely reach its goal. A reward function and two neural networks, critic and actor, are used to describe the environment and guide the control efforts. The DDPG trains the agent to find the largest possible set of starting points (“feasible set”) wherein a safe path to the goal is guaranteed. This provides critical information for mission planning, showing beforehand whether a task is achievable from a given starting point, assisting pre-mission planning activities. The approach is validated in simulation. A comparison between the DDPG method and a traditional optimal control (pseudo-spectral) method is carried out. The results show that the learning-based agent may produce effective paths while being significantly faster, making it a better fit for real-time applications. However, there are areas (“infeasible set”) where the DDPG agent cannot find paths to the destination, and the paths in the feasible set may not be optimal. These preliminary results guide our future research: (1) improve the reward function to enlarge the DDPG feasible set, (2) examine the feasible set obtained by the pseudo-spectral method, and (3) investigate the arc-search IPM method for the path planning problem.
Read the full abstract
Combinatorics
On the rainbow Cameron-Erdős problem with respect to generalized Sidon sets of multidimensional grids
For positive integers $n$, $d$, $k$ and $h$, let $[n]^d$ be the $d$-dimensional grid of order $n$, and we refer to the equation $\sum_{i=1}^{h}x_{1,i}=\cdots =\sum_{i=1}^{h}x_{k,i}$ as the {\it $B_{k,h}$-equation}, where $x_{1,1}, \ldots, x_{1,h}, \ldots, x_{k,1}, \ldots, x_{k,h}$ are $kh$ points in $[n]^d$. In this paper, we study the rainbow Cameron-Erdős problem with respect to the $B_{k,h}$-equation. We obtain the asymptotic number of $r$-colorings of $[n]^d$ without rainbow solutions to the $B_{k,h}$-equation, and we show that the typical colorings with this property are $(kh-1)$-colorings. We also prove that among all subsets of $[n]^d$, $[n]^d$ is the unique subset admitting the maximum number of $r$-colorings without rainbow solutions to the $B_{k,h}$-equation. The case $d=1$ and $k=h=2$ of our result confirms a conjecture on Sidon sets by Lin, Wang and Zhou~[European J. Combin., 2022]; the case $d=1$, $k=2$ and $h\geq 2$ of our result partly solves a problem concerning linear equations proposed by Cheng, Jing, Li, Wang and Zhou~[J. Combin. Theory Ser. A, 2023]; the case $d\geq 2$ and $k=h=2$ corresponds to colorings without rainbow (possibly degenerate) parallelograms, and this geometric perspective might be of independent interest. Our proof combines the hypergraph container method with a stability analysis and a deviation gain argument.
Read the full abstract
Combinatorics
Noncommutative Abel-like identities
We generalize the Abel–Hurwitz identities to an almost entirely noncommutative setting. Namely, let $V$ be a finite set of size $n$, and let $\mathbb{L}$ be any noncommutative ring. For each $s\in V$, let $x_{s}\in\mathbb{L}$. Set $x\left( S\right) :=\sum_{s\in S}x_{s}$ for any $S\subseteq V$. Let $X$ and $Y$ be two elements of $\mathbb{L}$ such that $X+Y$ lies in the center of $\mathbb{L}$. Then, we show that% \begin{align*} & \sum_{S\subseteq V}\left( X+x\left( S\right) \right) ^{\left\vert S\right\vert }\left( Y-x\left( S\right) \right) ^{n-\left\vert S\right\vert }=\sum_{\substack{i_{1},i_{2},\ldots,i_{k}\in V\text{ distinct}% }}\left( X+Y\right) ^{n-k}x_{i_{1}}x_{i_{2}}\cdots x_{i_{k}};\\ & \sum_{S\subseteq V}X\left( X+x\left( S\right) \right) ^{\left\vert S\right\vert -1}\left( Y-x\left( S\right) \right) ^{n-\left\vert S\right\vert }=\left( X+Y\right) ^{n};\\ & \sum_{S\subseteq V}X\left( X+x\left( S\right) \right) ^{\left\vert S\right\vert -1}\left( Y-x\left( S\right) \right) ^{n-\left\vert S\right\vert -1}\left( Y-x\left( V\right) \right) =\left( X+Y-x\left( V\right) \right) \left( X+Y\right) ^{n-1}. \end{align*} (Negative powers are understood to be cancelled by other factors.)
Read the full abstract
Combinatorics
A recursive construction of an acyclic matching on the independence complex of a graph with a simplicial vertex
We provide a recursive construction of an acyclic matching (also known as a gradient vector field, an equivalent notion to a discrete Morse function) on the independence complex of a graph with a simplicial vertex using given acyclic matchings on the independence complexes of specific subgraphs. As an application, we determine the homotopy type of the independence complexes of the family of chordal graphs and of a class of graphs generalising the comparability graphs of grid posets in an algorithmic and combinatorial manner via discrete Morse theory, some of which were previously obtained by sophisticated homotopy theoretic techniques. Even when the homotopy type is not easily determinable, our construction may be applied to obtain a pre-processing framework for efficient homology computation.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CV
Spatial-Spectral Adaptive Fidelity and Noise Prior Reduction Guided Hyperspectral Image Denoising
The core challenge of hyperspectral image denoising is striking the right balance between data fidelity and noise prior modeling. Most existing methods place too much emphasis on the intrinsic priors of the image while overlooking diverse noise assumptions and the dynamic trade-off between fidelity and priors. To address these issues, we propose a denoising framework that integrates noise prior reduction and a spatial-spectral adaptive fidelity term. This framework considers comprehensive noise priors with fewer parameters and introduces an adaptive weight tensor to dynamically balance the fidelity and prior regularization terms. Within this framework, we further develop a fast and robust pixel-wise model combined with the representative coefficient total variation regularizer to accurately remove mixed noise in HSIs. The proposed method not only efficiently handles various types of noise but also accurately captures the spectral low-rank structure and local smoothness of HSIs. An efficient optimization algorithm based on the alternating direction method of multipliers is designed to ensure stable and fast convergence. Extensive experiments on simulated and real-world datasets demonstrate that the proposed model achieves superior denoising performance while maintaining competitive computational efficiency.
Read the full abstract
Analysis of PDEs
Doubly Nonlinear Diffusion Equations on Metric Graphs
In this paper we study existence and uniqueness of solutions for a very general class of doubly nonlinear diffusion equations on metric graphs, which provide the appropriate mathematical framework to describe complex tubular networks in which axial diffusion is the main focus. Some important particular cases covered in our study are the Porous Medium Equation and the evolution equation for the $p$-Laplacian, but we also consider the case in that diffusion changes from one edge to another, which takes into account the influence of the properties of the tubules forming the network on axial diffusion. Furthermore, the problem is studied under non-homogeneous Neumann-Kirchhoff conditions on the vertices of the graph.
Read the full abstract
Algebraic Topology
Pullbacks of Sphere Fibrations over Connected Sums
We prove conditions under which the total space of the pullback of a sphere fibration over a connected sum is homotopy equivalent to a connected sum with a gyration. Existing results of this type often depend on geometric methods. We develop new methods based only on homotopy theory, allowing for generalisations from manifolds to Poincaré Duality complexes and from integral settings to local ones. Several applications are given.
Read the full abstract
Information Theory
On Secure Gradient Coding with Uncoded Groupwise Keys
This paper considers a new secure gradient coding problem with uncoded groupwise keys, formalized as a (K, N, N_r, M, S) secure gradient coding model, where a user aims to compute the sum of the gradients from K datasets with the assistance of N distributed servers. We consider arbitrary heterogeneous data assignment, where each dataset is assigned to at least M servers. The user should recover the sum of gradients from the transmissions of any N_r servers. The security constraint guarantees that even if the user receives the transmitted messages from all servers, it cannot obtain any other information about the datasets except the sum of gradients. Compared to existing secure gradient coding works, we introduce a practical constraint on secret keys, namely uncoded groupwise keys, where the keys are mutually independent and each key is shared by precisely S servers. An achievable secure gradient coding scheme with uncoded groupwise keys is proposed, which is then proven to be optimal if S > M and to be order optimal within a factor of 2 otherwise.
Read the full abstract
Classical Analysis and ODEs
Parabolic weak porosity and parabolic Muckenhoupt distance functions
We develop the parabolic weak porosity to characterize the parabolic Muckenhoupt $A_1$ weights with time-lag. Our main result shows that a nonempty closed set is parabolic weakly porous if and only if the parabolic distance function of the set to a negative power is in the parabolic Muckenhoupt $A_1$ class. We apply a novel stopping time argument in combination with the translation and doubling results for the parabolic weakly porous sets.
Read the full abstract
Combinatorics
On the number of missing integers in partitions
In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied its generalizations, analogues and the like but also connected the mex to several important partition statistics. In the present paper, we study the set of missing positive integers as a whole, in two different classes of partitions, namely, unrestricted partitions and overpartitions. To be precise, a $missing \ integer$ is a positive integer that is less than the largest part of a partition and which does not occur as a part. In particular, we examine the number of partitions with a given number of missing integers, determine congruences for two pairs of functions associated to them, and propose three bias type inequality conjectures for these functions.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Distributionally Robust Stochastic MPC under Disturbance-Affine Feedback Policies
This study addresses the stochastic Model Predictive Control (MPC) problem for linear time-invariant systems subjected to unknown disturbance distributions. By leveraging the most recent disturbance data, we construct a set of distributions with similar statistical properties contained within a Wasserstein ball, thereby accounting for the worst-case impacts on constraint satisfaction. Numerous MPC strategies, particularly tube-based approaches, have been extensively studied under the Wasserstein ambiguity set, but these methods often introduce conservatism and can limit control performance. Unlike tube-based approaches, we adopt a disturbance-affine control strategy, which introduces additional control degrees of freedom. We begin by developing the Disturbance-Affine Distributionally Robust (DA-DR) MPC framework, subsequently reformulating the control problem into a tractable quadratic programming formulation. Furthermore, we establish the recursive feasibility and stability of the proposed MPC scheme. Finally, we present comprehensive theoretical analysis and simulation results, demonstrating the superiority of the DA-DR MPC over tube-based MPC in initial feasible sets, average performance, and state variance control.
Read the full abstract
Quantum Algebra
A Quasi-Pentagon Equation for a Heisenberg Double of a Quasi-Hopf Algebra
For a finite-dimensional Hopf algebra $H$, the canonical elements of the Heisenberg doubles $\mathcal{H}(H^\ast)$ and $\mathcal{H}(H)$ satisfy the pentagon and Hopf equations, respectively. In this paper we construct quasi-Hopf analogues of these structures. For a finite-dimensional quasi-Hopf algebra $H$, we consider natural quasi-Hopf analogues $\mathcal{H}_1(H^\ast)$ and $\mathcal{H}_1(H)$ of $\mathcal{H}(H^\ast)$ and $\mathcal{H}(H)$. Although their canonical elements are defined just as in the Hopf algebra case, they need not be invertible. We prove that there nevertheless exist natural inverse-like elements. In $\mathcal{H}_1(H^\ast)$, the canonical element satisfies a quasi-pentagon equation and its inverse-like element satisfies a quasi-Hopf equation, while in $\mathcal{H}_1(H)$ the roles are reversed.
Read the full abstract
Group Theory
A note on the horizontal class transposition group
Let $n$ be an integer with $n > 1$. For every $r$ satisfying the inequalities $0 \leq r < n$, the residue class modulo $n$ is defined as $r(n)=\{r + kn | k \in Z\}$, where $Z$ is the set of all integers. Then for $0 \leq r_1\neq r_2 < n$, the horizontal class transposition $\tau_{r_1(n), r_2(n)}$ is an involution that interchanges $r_1 + kn$ and $r_2 + kn$ for each integer $k$ and fixes everything else. The horizontal class transposition group $CT_n$ is generated by all horizontal class transposition $\tau_{r_1(n), r_2(n)}$. Let $N$ be the least common multiple of the numbers $2, 3, . . . , n$ and $CT_{(n)}=\langle CT_2,CT_3,...,CT_n\rangle$. In this note, we prove that for $n>3$, $CT_{(n)}\cong S_N$, where $S_N$ is the symmetric group of degree $N$. Thus, we solve a conjecture proposed by Bardakov and Iskra, which has been included in the kourovka notebook: Unsolved problems in group theory, Novosibirsk, 2026.
Read the full abstract
Representation Theory
On irreducible representations of quandles
We consider irreducible representations of finite quandles over $\mathbb{C}$. For $Q$ a finite quandle whose inner automorphism group $Inn(Q)$ have trivial Schur multipliers, we prove that the irreducible representations of $Q$ can be constructed out of what we call characters of $Q$ and irreducible linear represenations of the group $Inn(Q)$. For $G$ a finite groiup having trivial Schur multiplier or being a Schur cover of another group, we show that the irreducible representations of the conjugacy quandle $Conj(G)$ can be constructed out of characters of $Conj(G)$ and irreducible linear representations of the group $G$. In both cases, the finite unitary irreducible representations can be determined from the results. For instance, these results allow to solve the problem of constucting irreducible represenations of the conjugacy quandles of dihedral groups and generalised quaternion groups. In general, we relate the irreducible representations of a finite quandle $Q$ to irreducible projective representations of $Inn(Q)$ and prove that the irreducible representations of $Q$ can be in theory constructed out of characters of $Q$ and irreducible representations of a finite quotient of the enveloping group $G(Q)$. The quotient is a stem extensions of $Inn(Q)$ with nucleus a finite subgroup of the center of $G(Q)$. This allows, using a result from the litterature, to show that the irreducible quandle representations of $Conj(S_n)$ ($S_n$ the symmetric group) can be constructed out of characters of the corresponding quandle and irreducible linear group representations of the symmetric group.
Read the full abstract
Combinatorics
Maximal size of irreducible $\lambda$-quiddities over polynomial and formal power series rings
The study of the combinatorics of the modular group and of Coxeter's friezes naturally leads to the investigation of a matrix equation, sometimes referred to as the Conway-Coxeter equation. The solutions of size $n$ of this equation, called $\lambda$-quiddities, are $n$-tuples of elements of a given ring $B$. A detailled understanding of these objects relies on the notion of irreducible solutions, from which all $\lambda$-quiddities can be reconstructed. One of the central questions that naturally arises in this context is whether the irreducible $\lambda$-quiddities over $B$ have bounded size, and, if so, how to determine such a bound. In this paper, we aim to list results that address this question in the case of polynomial rings $A[X]$ and $\mathbb{K}[X]$, where $A$ is a finite commutative unitary ring and $\mathbb{K}$ is a commutative field. Moreover, the stated results will also make it possible to treat easily many situations in which $A$ is infinite. Finally, we shall give a complete answer to the initial question for all rings of formal power series.
Read the full abstract
Algebraic Geometry
Exotic Hopf maps, weight shifting and applications to vector bundles
Using motivic homotopy theory we produce several explicit polynomial representatives of the suspension of the Hopf map defined over the integers. We derive from this computation an explicit rank 2 vector bundle on the Jouanolou device of the projective space of dimension 3 over the integers.
Read the full abstract
Differential Geometry
Transversely Kähler almost contact metric Lie algebras
We study transversely Kähler almost contact metric Lie algebras $(\mathfrak{g},\varphi,\xi,\eta,g)$ such that the structure $1$-form $\eta$ is a contact form. They include both quasi Sasakian and anti-quasi-Sasakian Lie algebras of maximal rank. In the case where the center of the Lie algebra is nontrivial, they are $1$-dimensional central extensions of Kähler Lie algebras via a symplectic form. We investigate the $5$-dimensional case, obtaining a classification of $\eta$-Einstein transversely Kähler almost contact metric Lie algebras of maximal rank. If the center is trivial, the structure is always $\alpha$-Sasakian. If the center is nontrivial and the Kähler quotient $\mathfrak{g}/\mathfrak{z(g)}$ is not abelian, the structure is quasi Sasakian; it is $\alpha$-Sasakian on central extensions of Kähler-Einstein $4$-dimensional Lie algebras, and not conversely. Up to isomorphisms, the Heisenberg Lie algebra $\mathfrak{h}_5$ is the only $5$-dimensional Lie algebra admitting $\eta$-Einstein transversely Kähler structures which are not quasi Sasakian, including anti-quasi-Sasakian structures. In fact, we show that any $5$-dimensional anti-quasi-Sasakian Lie algebra is isomorphic to $\mathfrak{h}_5$.
Read the full abstract
Algebraic Geometry
Supersingular elliptic surfaces and Infinitesimal Torelli
In 1981 Katsura presented a classification of non-rational Jacobian elliptic surfaces which admit a base change which is rational. In 2004 we presented a classification of Jacobian regular elliptic surfaces which do not satisfy infinitesimal Torelli. These classifications of quite different properties turn out to be very similar. In this paper we use an argument exploiting the product-quotient structure of these examples to prove simultaneously that Katsura's examples are Artin supersingular, and to give a new proof that our examples do not satisfy infinitesimal Torelli.
Read the full abstract
Operator Algebras
A universal coefficient theorem for actions of finite cyclic groups of square-free order on C*-algebras
We prove a Universal Coefficient Theorem for objects in the bootstrap class in the equivariant Kasparov category for a finite cyclic group of square-free order.
Information Theory
On Decentralized Sum-Rate Maximization with Successive Interference Cancellation
Successive Interference Cancellation (SIC) is a powerful technique for managing interference in wireless networks, yet its optimal deployment in decentralized environments remains a challenge. This study investigates joint power and rate allocation in a two-user Gaussian interference channel incorporating SIC at the receivers. We characterize the global optimal solutions of the problem, and recognizing the limitations of centralized coordination, we introduce a novel decentralized algorithm for a symmetric channel configuration. Numerical results demonstrate that even without global Channel State Information, our proposed algorithm significantly outperforms traditional benchmarks, such as Orthogonal Access which suffers from temporal underutilization or greedy strategies that fail to exploit SIC gains.
Read the full abstract
Operator Algebras
Simplicity of action-based $C^{*}$-algebras from hyperbolic actions
We study the simplicity of $C^{*}$-algebras built from group actions. For a faithful isometric action of a group $G$ on a countable metric space $X$, we use the associated action representation on $\ell^2(X)$ to define the action-based $C^{*}$-algebra $C^{*}_{X}G$. We define generalized versions of the properties $P_{\mathrm{naive}}$ and $P_{\mathrm{analytic}}$ relative to this action and show that the naive form implies the analytic form. We also prove that $P_{\mathrm{analytic}}$ associated with a coefficient-separating action representation ensures the simplicity of the action-based $C^*$-algebra. As an application, for every connected orientable boundaryless infinite type surface containing a connected nondisplaceable finite type subsurface, we deduce that its mapping class group satisfies the properties $P_{\mathrm{naive}}^{\mathbb{X}}$ and $P_{\mathrm{analytic}}^{\mathbb{X}}$ for one fixed hyperbolic space $\mathbb X$.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems
Recent work established a generalized-Fano framework for lower bounding prior-predictive (Bayesian) CVaR in interactive statistical decision making. In this paper, we show how to instantiate that framework in concrete interactive problems and derive explicit Bayesian CVaR lower bounds from its abstract corollaries. Our approach compares a hard model with a reference model using squared Hellinger distance, and combines a lower bound on a reference hinge term with a bound on the distinguishability of the two models. We apply this approach to canonical examples, including Gaussian bandits, and obtain explicit bounds that make the dependence on key problem parameters transparent. These results show how the generalized-Fano Bayesian CVaR framework can be used as a practical lower-bound tool for interactive learning and risk-sensitive decision making.