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)

Friday 1 May

Optimization and Control · Cross-listed from cs.RO

Value Functions for Temporal Logic: Optimal Policies and Safety Filters

While Bellman equations for basic reach, avoid, and reach-avoid problems are well studied, the relationship between value optimality and policy optimality becomes subtle in the undiscounted infinite-horizon setting, particularly for more complicated tasks. Greedily maximizing the Q-function can produce policies that indefinitely defer task completion for reach-avoid problems, or equivalently, Until specifications, even when the value function is optimal. Building upon recent results decomposing the value function for temporal logic (TL) into a graph of constituent value functions, we construct non-Markovian policies based on state history that avoid this pathology and prove their optimality with respect to the quantitative robustness score for nested Until, Globally, and Globally-Until specifications. We further show how the Q function can serve as a safety filter for complex TL specifications, extending prior results beyond simple avoid or reach-avoid tasks.
Read the full abstract

All authors Oswin So, William Sharpless, Sylvia Herbert, Chuchu Fan

Differential Geometry · Cross-listed from cs.LO

Stokes' Theorem for Smooth Singular Cubes in Lean 4: True Pullback, Bridges to mathlib4, and Chain-Level d^2=0

We present a sorry-free Lean 4/mathlib4 formalization of Stokes' theorem for smooth singular cubes in arbitrary dimension, using true differential-form pullback via the Frechet derivative. The development also includes a bridge to mathlib4's abstract extDeriv, chain-level Stokes extended by Z-linearity, d^2=0 for singular cubical chains, box Stokes for axis-aligned cubes, dimensional specializations, and a structured comparison with Harrison's HOL Light formalization.
Read the full abstract

Geometric Topology

The geometry of branched coverings of hyperbolic manifolds

We discuss geometric properties of covers of closed hyperbolic manifolds of dimension $n\geq 3$, branched along a totally geodesic codimension two submanifold $\Sigma$. The results are mostly known to the experts but hard to find in the literature in this form.

Geometric Topology

A HOMFLYPT-type invariant for pseudo links via a resolution in Hecke algebras

Pseudo links generalize classical links by allowing crossings with missing over/under information, called pre-crossings. While the pseudo braid framework provides an algebraic description of pseudo links via a Markov-type theorem, the construction of polynomial invariants using Hecke algebra techniques is obstructed by the presence of the pseudo Reidemeister 1 move. In this paper, we construct a HOMFLYPT-type invariant for oriented pseudo links via the pseudo Hecke algebra of type \(A\). The construction is based on a resolution homomorphism that maps each pseudo generator to a linear combination of a braid generator and its inverse, interpreting pre-crossings as algebraic superpositions of classical crossings. Composing this map with the Ocneanu trace and applying a suitable normalization yields an invariant satisfying a natural pseudo skein relation. We further show that the invariant admits a state-sum formulation as a weighted sum of classical HOMFLYPT-type invariants over all classical resolutions of the pseudo crossings, as well as a skein-theoretic characterization in terms of its values on classical links and the pseudo skein relation.
Read the full abstract

Analysis of PDEs

Lifespan Lower Estimates for a Strongly Damped Semilinear Wave Equation

We consider a strongly damped semilinear wave equation with initial data prescribed as $(\varrho\phi,\varrho h)$, where the profiles are fixed and only the amplitude $\varrho>0$ is allowed to vary. The question addressed here is how this rescaling affects a guaranteed lower bound for the maximal existence time. We show that the solution exists at least on a time interval of length comparable to $\varrho^{-(p-2)}$. The proof is based on the growth of a quadratic phase-space norm: after the source term is estimated by the relevant Sobolev embedding, the problem reduces to a scalar differential inequality. The constants produced in the argument are independent of $\varrho$, so the dependence on the initial amplitude remains explicit throughout.
Read the full abstract

Dynamical Systems

Stability Theory for Local Iterated Function Systems

We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type and attractors with endpoints, leading to new mechanisms of instability. We first prove that concordant shadowing implies upper semicontinuity of the local attractor and persistence of the code space, yielding a criterion for combinatorial stability under perturbations. Under the open set condition, we establish a strong form of topological stability for combinatorially stable contractive local systems, and prove the converse implication on compact manifolds of dimension at least three. In particular, we show that contractive graph-directed IFSs are topologically stable. We also construct contractive local IFSs derived from beta-transformations that are combinatorially unstable. These results show that stability in the local setting is governed by the interplay between contraction and the combinatorial rigidity of the code space. Applications to graph-directed IFSs and pseudogroup actions are also given.
Read the full abstract

Rings and Algebras

Nonsymmetric versions of binary quadratic operads

In this paper, we study the white Manin product of the associative operad $\As$ with a binary quadratic operad $\Var$. We introduce the notion of a nonsymmetric version of $\Var$ and provide a criterion for determining when the operad $\As\circ\Var$ has this property. We illustrate the construction with several examples and counterexamples. Finally, for some operads admitting nonsymmetric versions, we describe their combinatorial properties.
Read the full abstract

Optimization and Control

Stackelberg-Nash controllability for a multi-objective Stefan problem

We investigate a hierarchical control problem for a one-dimensional Stefan system with localized distributed controls. The setting combines a Stackelberg strategy with a Nash equilibrium among multiple followers, yielding a multi-objective free-boundary problem. The interaction between the hierarchical control and the moving interface results in a nonlinear optimality system, and we show that the original problem reduces to the null controllability of this optimality system. Under suitable geometric conditions on the control regions, we establish a local null controllability result. The proof relies on an observability inequality for a linearized system, obtained through Carleman estimates adapted to the presence of a moving boundary. These results constitute, to the best of our knowledge, the first treatment of a Stefan system within a Stackelberg-Nash framework.
Read the full abstract

All authors Thiago C. A de Carvalho, Suerlan Silva, Gilcenio R. de Sousa-Neto, Franciane de B. Vieira

Probability

Asymptotic probability of a fixed edge being on the boundary of the convex hull of a random walk in $\mathbb{Z}^2$

A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary of the convex hull is investigated.

Combinatorics

Families without $s$-matchings: the other end

In this paper, we determine the largest family $\mathcal F \subset 2^{[n]}$ without $s$ pairwise disjoint sets, provided $n=ms+c$ for positive integers $m,c$, and $s \geq s_0(m, c)$. This result can be seen as a non-uniform analogue of the results on the Erd\H os Matching Conjecture in the regime when the clique is extremal.
Read the full abstract

Combinatorics · Cross-listed from cs.CC

On Sampling Lower Bounds for Polynomials

In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An $n$-tuple $P = (P_1,\dots, P_n)$ of functions $P_i \colon \mathbb{F}_2^m \to \mathbb{F}_2$ defines a distribution over $\{0,1\}^n$ in the natural way: draw $X$ uniformly at random from $\mathbb{F}_2^m$ and output $(P_1(X),\dots, P_n(X)) \in \{0,1\}^n$. We show that when $P$ is defined by polynomials of degree $d$, the total variation distance of $P$ from the product distribution $\mathrm{Ber}(1/3)^{\otimes n}$ is $1-o_n(1)$, where $o_n(1)$ is a vanishing function of $n$ for any constant degree $d$. For small values of $d$, we show the following concrete bounds. (i) For $d=1$ we have $\|P-\mathrm{Ber}(1/3)^{\otimes n}\|_{TV} \geq 1-\exp(-\Omega(n))$. (ii) For $d=2$ we have $\|P-\mathrm{Ber}(1/3)^{\otimes n}\|_{TV} \geq 1-\exp(-\Omega(\log(n)/\log\log(n)))$. (iii) For $d=3$ we have $\|P-\mathrm{Ber}(1/3)^{\otimes n}\|_{TV} \geq 1-\exp(-\Omega(\sqrt{\log\log(n)}))$. Our results extend the recent lower bound results for sampling distributions, which have mostly focused on local samplers, small depth decision trees, and small depth circuits. As part of our proof, we establish the following result, that may be of independent interest: for any degree-$d$ polynomial $P\colon\mathbb{F}_2^m \to \mathbb{F}_2$ it holds that $\Pr_X[P(X) = 1]$ is bounded away from $1/3$ by some absolute constant $\delta = \delta_d>0$. Although the statement may seem obvious, we are not aware of an elementary proof of this. The proof techniques rely on the structural results for low degree polynomials, saying that any biased polynomial of degree $d$ can be written as a function of a small number of polynomials of degree $d-1$.
Read the full abstract

Information Theory

Split and Aggregation Learning for Foundation Models Over Mobile Embodied AI Network (MEAN): A Comprehensive Survey

The rapid advancements in foundation models and sixth-generation (6G) wireless communication systems necessitate the development of efficient, scalable, and privacy-preserving machine learning approaches. For foundation models in 6G, split learning (SL) and aggregation learning (AL) have emerged as promising paradigms that address key challenges in distributed artificial intelligence (AI), such as communication efficiency, resource allocation, and data privacy. SL enables multiple entities to collaboratively train deep learning models by partitioning neural networks, while AL focuses on aggregating intermediate results or model updates from multiple participants, improving robustness, optimizing resource utilization, and mitigating data leakage risks. Specifically, SL is ideal for scenarios requiring strict data isolation (e.g., vertical collaborations), whereas AL suits homogeneous horizontal data settings; they can be combined to balance privacy and communication efficiency. This survey provides a comprehensive analysis of SL and AL in 6G communication systems, exploring their architectures, technical methodologies, and integration with AI-native 6G communication technologies. We examine different SL configurations, aggregation techniques, and their roles in optimizing distributed foundation models. Furthermore, we discuss their applications in emerging wireless networks, including semantic communication, reconfigurable intelligent surfaces (RIS), space-air-ground integrated networks (SAGINs), and quantum communication. By analyzing the impact of SL and AL, this survey provides insights into their role in shaping distributed AI-driven communication systems in the 6G era, focusing on efficiency, privacy preservation, and scalability.
Read the full abstract

All authors Qianzhou Chen, Siqi Sun, Minrui Xu, Sijie Ji, Jiawen Kang, Yijie Mao, Zhouxiang Zhao, Zhaohui Yang, Dusit Niyato

Dynamical Systems

Coupled Arnol'd cat maps on circulant graphs

This paper investigates the chaotic properties of Arnol'd cat maps (ACMs) coupled on the nodes of a circulant graph. By demanding that the system's evolution matrix be symplectic, we determine the coupling matrix, which is naturally interpreted as the adjacency matrix of a circulant graph. Specifically, the study analyses the system's Lyapunov spectra and Kolmogorov-Sinai (K-S) entropy. Numerical simulations yield the counterintuitive result that the entropy production does not increase as the connectivity of the graph increases, due to the translational symmetry of the circulant graph. Moreover, we analyse the spectra of the periods of the evolution matrix on a finite toroidal phase space of the dynamical system.
Read the full abstract

Combinatorics · Cross-listed from cs.GT

Induced Representations in Cooperative Games with Homogeneous Groups of Players

Oftentimes, the Shapley value, a measure of the contribution of a player to a game, becomes infeasible for games with many players. However, establishing symmetry allows for polynomial-time computation. To examine this reduction, we identify the spectrum of a homogeneous group game by using an induced representation from a Young subgroup. We prove that the depth of interaction of a two-group game is limited by the size of the minority group. Therefore, the algebraic structure of the game filters out a large space of irrelevant complexities. We then show that this filtration constrains any symmetric linear value to a specific subspace. This recovers the Shapley value uniquely for games consisting of exactly two homogeneous groups under standard axioms. Finally, we explore applications to the UN Security Council and complementary goods markets to illustrate the practical power of this approach.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

The Mesoscopic Partition Function:A Combined Spatial and Phase-Space Cell Structure

We develop a mesoscopic formulation of equilibrium statistical mechanics based on coarse-grained occupation-number sectors of one-particle phase space. A mesoscopic partition function is constructed by averaging the microscopic Hamiltonian over configurations compatible with a given occupation profile. The construction converges to the canonical Gibbs partition function in the fine-graining limit and remains compatible with interacting many-body systems. Within this framework, thermodynamic extensivity is shown to be equivalent to asymptotic factorisation of the mesoscopic partition function, while residual inter-cell correlations generate subextensive corrections. The resulting formalism provides a mathematically consistent bridge between microscopic Gibbs theory and mesoscopic thermodynamics.
Read the full abstract

Information Theory

Information Accessibility Limits in Structured NP Search

We study the problem of locating violating principal minors in matrix families lying near the boundary of P-matrices. Rather than viewing this search problem purely through computational complexity, we analyze it from an information-accessibility perspective. We show that, despite strong underlying algebraic structure, the location of a violating subset may remain difficult to infer through local queries. In the sparse-violation regime, local observations typically provide only weak eliminative power, and polynomially many queries accumulate only vanishing mutual information about the hidden witness under the induced oracle model. Using mutual information and Fano's inequality, we characterize the resulting limitation on information acquisition. The analysis highlights a conceptual distinction between structure and accessibility: a problem may possess rich underlying structure while the information required to identify a hidden witness remains weakly inferable from observable responses.
Read the full abstract

Number Theory

Monogenic Fields from Polynomial Compositions with Applications

A number field $K$ is called monogenic if its ring of integers $\mathbb{Z}_K$ can be expressed as a simple ring extension $\mathbb{Z}[\alpha]$ for some $\alpha \in \mathbb{Z}_K$. A monic irreducible polynomial $f(x)\in\mathbb{Z}[x]$ is said to be monogenic if one of its roots generates both the number field and its ring of integers. In this article, we establish the necessary and sufficient conditions for $[\mathbb{Z}_{K_i}:\mathbb{Z}[\alpha_i]]=1$, where $K_i=\mathbb{Q}(\alpha_i)$ and $\alpha_i$ is a root of the composed polynomial $f_i(x^k+b)$ for $i=1,2$. Here, $f_1(x)=x^n+c\sum_{j=1}^{n}(ax)^{n-j}\in\mathbb{Z}[x]$ and $f_2(x)=x^n+c\sum_{j=1}^{n}a^{j-1}x^{n-j}\in\mathbb{Z}[x]$ are irreducible polynomials of degree $n\ge 3$. In addition, we derive asymptotic estimates for the number of monogenic polynomials in these families under natural assumptions. As an application of our main results, we construct a class of polynomials with non-square-free discriminants. We also analyze the behavior of solutions to certain related differential equations.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design

Federated learning (FL) is fundamentally a distributed optimization problem executed by communicating agents with local data, local computation, and partial system visibility. Once FL is viewed through that lens, hierarchy is not merely a scalability mechanism. It becomes the natural place to rethink how distributed optimization should be organized over real multi-tier networks. This article argues that hierarchical federated learning (HFL) should move beyond its common framing as a communication-saving protocol and instead be viewed as an architecture-aware design framework for networked AI. The framework is organized around three coupled design axes: architectural parameters, layer-wise optimization decomposition, and layer-wise communication realization. The first axis determines the coordination geometry of learning through hierarchy depth, layer asymmetry, and layered connectivity. The second determines how the global FL objective is decomposed across layers and highlights modular multi-layer optimization as a major opportunity beyond one dominant method everywhere. The third determines how the distributed optimization is physically realized under heterogeneous communication regimes, from interference-limited lower tiers to reliable upper tiers. A central message is that, in HFL, convergence becomes architecture-dependent: it is directly shaped by the chosen hierarchy, the assigned optimization roles, and the communication mechanisms that connect them. We develop this viewpoint using large-scale wireless edge intelligence as a flagship networked AI setting, then provide a comparative perspective on flat FL, two-tier HFL, and deep HFL together with a regime-oriented design map. The resulting perspective positions HFL as a practical methodology for designing future networked AI systems.
Read the full abstract

Numerical Analysis

Reliability, Robustness, and Resilience Modeling for Surveillance System in Advanced Air Mobility Operations

Ensuring the safe and efficient operation of Advanced Air Mobility (AAM) in low-altitude airspace requires a reliable, robust, and resilient surveillance system capable of continuously detecting, identifying, and tracking aircraft under both normal and off-nominal conditions. To address this need, this study develops a comprehensive 3R modeling framework, reliability, robustness, and resilience, for the Surveillance for Advanced Air Mobility (SAM) system, with a focus on the optimal design and operation of a multi-type sensor network. Under normal operating conditions, the reliability model determines the baseline sensor types, quantities, and locations required to satisfy surveillance coverage and detection requirements. To address external perturbations, such as adverse weather conditions or sudden increases in AAM traffic demand, the robustness model identifies additional sensor requirements needed to maintain system performance. Furthermore, for surveillance outages caused by primary sensor failures, the resiliency model develops backup sensor deployment and dispatch strategies to provide temporary surveillance coverage, minimize operational disruptions, and support the safe continuation of AAM operations.
Read the full abstract

All authors Esrat Farhana Dulia, Caleb Adams, Syed Arbab Mohd Shihab, Ruben Del Rosario

Numerical Analysis · Cross-listed from cs.CE

HyCOP: Hybrid Composition Operators for Interpretable Learning of PDEs

We introduce HyCOP, a modular framework that learns parametric PDE solution operators by composing simple modules (advection, diffusion, learned closures, boundary handling) in a query-conditioned way. Rather than learning a monolithic map, HyCOP learns a policy over short programs - which module to apply and for how long - conditioned on regime features and state statistics. Modules may be numerical sub-solvers or learned components, enabling hybrid surrogates evaluated at arbitrary query times without autoregressive rollout. Across diverse PDE benchmarks, HyCOP produces interpretable programs, delivers order-of-magnitude OOD improvements over monolithic neural operators, and supports modular transfer through dictionary updates (e.g., boundary swaps, residual enrichment). Our theory characterizes expressivity and gives an error decomposition that separates composition error from module error and doubles as a process-level diagnostic.
Read the full abstract

All authors Jinpai Zhao, Nishant Panda, Yen Ting Lin, Eirik Valseth, Diane Oyen, Clint Dawson

Combinatorics

On the largest sum-free subset of the lattice cube

We determine the limiting density of the largest sum-free subset of the lattice cube $\{1,2,\ldots,n\}^d$ for all $d$, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices. Equivalently, we show that the largest measure of a sum-free subset of the hypercube $(0,1)^d\subset \mathbb{R}^d$ is attained by $\setcond{x\in (0,1)^d}{1\leq L(x)<2}$ for some linear map $L:\mathbb{R}^d\to \mathbb{R}$. It is natural to conjecture that the same phenomenon might hold if one replaces the hypercube by any convex set not containing the origin, but we give an example to show that for sufficiently large $d$ this is not the case.
Read the full abstract

Logic · Cross-listed from cs.LO

Univalence without function extensionality

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed by the universe is univalent, which we call categorical univalence. We show that categorical univalence does not imply function extensionality by an analysis of Von Glehn's polynomial model construction, which produces models of Martin-Löf type theory that always refute function extensionality. We find in particular that when the base model has a univalent universe, its polynomial model has a universe that is categorically univalent but lacks function extensionality.
Read the full abstract

Number Theory

Conjectural duality for iterated $q$-integrals on $\mathbb{P}^{1}$ minus four generic points

We propose a conjectural $q$-analogue of the classical duality for iterated integrals on $\mathbb{P}^{1}$ minus four points, arising from the involutive Möbius transformation which exchanges the four marked points in pairs. To this end, we introduce iterated $q$-integrals with position-dependent $q$-shifts of the parameters and define a functional on admissible words in the six pairwise letters. The conjecture states that this functional is invariant under a natural anti-automorphism of the word algebra. We relate the conjecture to Yamamoto's duality for one-variable multiple $q$-polylogarithms. Finally, we prove the conjecture in several special cases.
Read the full abstract

Group Theory

On the Schur multiplier of $p$-groups with abelianization $s$-elementary abelian

Let $p$ be an odd prime. We describe a method to compute the Schur multiplier of finite $p$-groups $G$ of nilpotency class $2$ such that $G/[G,G]$ is isomorphic to direct product of copies of $\mathbb{Z}_{p^s}$ for $s \in \mathbb{N}$, generalizing a method of Blackburn and Evens, who treated the case $s=1$. As an application, we investigate which abelian $p$-groups can occur as the Schur multiplier of a non-abelian $p$-group. We further introduce the notions of $s$-special $p$-groups of rank $k$ generalizing the notion of special $p$-groups of rank $k$. We study the structural properties, compute the Schur multipliers of $s$-special $p$-groups of rank $1$.
Read the full abstract

Analysis of PDEs

Smooth and stable Euler implosions

We construct a new class of self-similar implosion profiles for the multi-dimensional compressible Euler equations. These profiles are smooth, genuinely non-isentropic, radially/spherically symmetric, and have explicit (closed-form) similarity exponents. We prove that the exact Euler solution corresponding to the ground state implosion profile is stable to radially symmetric perturbations, as a solution to the full nonlinear compressible Euler equations, modulo a one-dimensional compatibility condition on the initial data. For perturbations of the Euler solution corresponding to the ground state implosion profile of a monatomic or diatomic gas, that do not obey any symmetry assumptions, we provide a complete characterization of the set of initial data that yield nonlinear stability.
Read the full abstract

Analysis of PDEs

Existence of dipoles of Klein-Gordon-Zakharov system

In this paper, we study the long time behavior of solutions of Klein-Gordon-Zakharov system. We show that there exists a solution with special characteristics, which we shall refer to as a dipole solution, that is, there exists a solution $\vec{u}$ such that $$\left\|\vec{u}(t)-\sum_{k=1}^{2}\vec{R}_{k}\right\|_{X} \to 0 \, \, \text{as}\, \, t\to \infty,$$ where $\vec{R}_{k}$ represents a solitary wave for each $k$, with a translation $z_k$ with respect to its position, satisfying that $$|z_1(t)-z_2(t)| \sim 2\log(t)\, \, \text{as} \, \, t\to \infty.$$ Our approach will initially focus on the spectral analysis of the Hamiltonian operator associated with our system. Subsequently, we aim to establish a coercivity estimate that will allow us to derive conditions ensuring the existence of our solution. It is important to note that, in this problem, our objective is to obtain approximate solutions by solving a final data problem. These approximate solutions will then be used, through uniform estimates and compactness results, to derive the desired conclusions via density arguments.
Read the full abstract

Analysis of PDEs

Compactness of weighted Sobolev trace operators and non-linear Steklov problems

We prove the compactness of weighted Sobolev trace operators in outward cuspidal domains by using composition operators on Sobolev spaces. This result allows us to formulate the non-linear Steklov problem in outward cuspidal domains in a correct functional setting and to establish the existence of its non-trivial solution.
Read the full abstract

Probability · Cross-listed from stat.ME

Recursive Maximum Likelihood Estimation for Interacting Particle Systems using Virtual Particles

We study recursive maximum likelihood estimation for stochastic interacting particle systems based on continuous observation of a single particle. In this regime, consistent estimation of the finite-particle log-likelihood is not possible, even in the limit as the number of particles $N\rightarrow\infty$ and the time horizon $t\rightarrow\infty$. We thus seek to optimise the stationary log-likelihood of the limiting mean-field system. We achieve this via a form of stochastic gradient estimate in continuous time, with stochastic gradient estimates computed using the continuous trajectory of the single observed particle, alongside a virtual interacting particle system and a virtual tangent interacting particle system, which are integrated with the online parameter estimate. For fixed numbers of real and virtual particles, we show that the resulting algorithms drive the gradient of a finite-particle surrogate objective to zero as $t\to\infty$. We then prove that, in the iterated limit $t\to\infty$ followed by $N,M\to\infty$, these surrogate gradients converge uniformly to the gradient of the stationary log-likelihood of the limiting mean-field system, yielding convergence to its stationary points. We illustrate the method on several numerical examples, including a model with quadratic confinement and interaction potentials, a model of interacting FitzHugh–Nagumo neurons, and a stochastic Kuramoto model.
Read the full abstract

Functional Analysis

The structure of gauge invariant Gaussian quantum operations on finite Fermion systems

Let ${\mathcal H}_1$ be a finite dimensional complex Hilbert space. Let $\psi\mapsto Z(\psi)$ be a canonical anti-commutation relations (CAR) field over ${\mathcal H}_1$ acting irreducibly on a Hilbert space ${\mathord{\mathscr K}}$. The $*$-algebra ${\mathscr A}_{{\mathcal H}_1}$ generated by the $Z(\psi)$, $\psi\in {\mathcal H}_1$, is simply all operators on ${\mathscr K}$. However, the CAR field endows ${\mathscr A}_{{\mathcal H}_1}$ with additional structure, and we are concerned with quantum operations acting in harmony with this structure. In particular, there is a "gauge" automorphism group generated by "second quantizing” $\psi \mapsto e^{it}\psi$. The fixed point algebra of the gauge group, ${\mathscr G}_{{\mathcal H}_1}$, is a sub-algebra of ${\mathscr A}_{{\mathcal H}_1}$ studied by Araki and Wyss. It contains the density matrices of an important class of states, the gauge invariant Gaussian states, ${\mathfrak S}_{GIG}$. Our focus is on semigroups $\{e^{t{\mathscr L}}\}_{t\geq 0}$ of quantum operations on ${\mathscr A}_{{\mathcal H}_1}$ that map ${\mathfrak S}_{GIG}$ into itself. Each $e^{t{\mathscr L}}$ is one-to-one, and our first main result is a structure theorem for such quantum operations on ${\mathscr G}_{{\mathcal H}_1}$ that map ${\mathfrak S}_{GIG}$ into itself. We apply this to study semigroups of quantum operations on ${\mathscr G}_{{\mathcal H}_1}$ that map ${\mathfrak S}_{GIG}$ into itself. Our second main result is a structure theorem showing that they are parameterized by pairs $(G,A)$ where $G$ is a contraction semigroup generator on ${\mathcal H}_1$, and $0 \leq A \leq -G -G^*$. We then show that each of these semigroups has a natural extension to the full CAR algebra ${\mathscr A}_{{\mathcal H}_1}$. Further results are obtained under further assumptions on the pair $(G,A)$.
Read the full abstract

Algebraic Topology

Unbounded Weight Structures: (Re)construction and Completion

We develop a theory of completeness for weight structures on stable categories, dual to the theory of complete $t$-structures. As in the bounded case, we show that complete weight structures are determined by their weight heart, giving rise to a universal construction $A \mapsto K(A)$ that assigns a complete weight category to an additive category and recovers classical examples such as homotopy categories of chain complexes. We also give a general construction of weight structures on presentable stable categories generated by a small set of objects, generalizing a result of Bondarko and Pauksztello. This recovers the standard weight structure on spectra and an exotic one related to Anderson duality. We identify their completions with modules over the (spectral) integral Steenrod algebra. To treat naturally occurring examples - such as derived categories of abelian categories and module categories over ring spectra - which are often only partially weight complete, we introduce the notion of weak $t$-structures. Within this framework, we prove that any stable category equipped with compatible weight and weak $t$-structures, and satisfying left weight completeness and right $t$-completeness, can be reconstructed from its heart via a two-step completion process $A \mapsto \widehat{K}(A)$.
Read the full abstract