Information Theory · Cross-listed from quant-ph
Networked Realization of Quantum LDPC Codes
Swayangprabha Shaw and Narayanan Rengaswamy
Quantum low-density parity-check (QLDPC) codes with good parameters are promising candidates for low-overhead fault-tolerant
quantum computing, but their non-local stabilizers require long-range connectivity and frequent
qubit movement, introducing practical challenges. Prior work has studied the networked implementation of topological codes, where each node only holds one or a few
qubits of the entire code, and demonstrated competitive performance under practical constraints such as the quality of network-provided
entanglement. However, since these codes are already geometrically local, such a networked setting might not be essential. In this work, we propose and study the networked implementation of better QLDPC codes, specifically bivariate bicycle codes due to their similarity to surface codes and the controlled amount of long-range connections in their stabilizers. We begin by recreating networked surface codes in Stim, with one code
qubit per node, and provide additional insights into their
circuit-level noise performance. We then extend this approach to bipartitions of bivariate bicycle codes, using balanced min-cut partitioning on their combined X-Z Tanner graph to identify optimal
qubit splits. For stabilizers spanning nodes, we implement teleported CNOTs and vary the Bell pair fidelity enabling these gates. Through
circuit-level noise simulations with BP-OSD decoding, we provide the first insights into networked realizations of these codes and compare their performance with monolithic implementations. We conclude by outlining advantages, limitations, and future directions.
Read the full abstract ▾
Differential Geometry
Mohammad Ghomi, Joseph Ansel Hoisington, Matteo Raffaelli et al. (+1 more)
We show that closed surfaces with minimal total absolute
curvature in Cartan-Hadamard 3-
manifolds bound flat convex bodies. This generalizes Chern-Lashof's
theorem for surfaces in Euclidean space and solves a problem posed by Gromov in 1985. Our proof is based on an isometric
embedding construction via holonomy, and uses Pogorelov's theory of surfaces with bounded extrinsic
curvature. Along the way, we obtain a regularity result for convex hulls and a Schur-type comparison
theorem for curves in Cartan-Hadamard
manifolds.
Read the full abstract ▾
All authors Mohammad Ghomi, Joseph Ansel Hoisington, Matteo Raffaelli, John Ioannis Stavroulakis
Algebraic Geometry
The Mukai conjecture via Cox rings for smooth canonical ambient embeddings
Heath Pearson
We prove the Mukai
conjecture on the characterisation of powers of projective spaces among smooth Fano varieties $n+\rho-i\rho\ge0$ for a class of locally factorial Fano varieties naturally defined in terms of their Cox rings. Recall that all klt Fano varieties $X$ embed into a projective toric variety $Z$ via their Cox ring, where $Z$ is uniquely determined up to isomorphism by the isomorphism class of $X$. We prove the Mukai
conjecture when the ambient $Z$ is smooth, where we prove the stronger result $n+\rho-i\rho\ge n+\rho-\sum a_i \ge 0$, where $\sum a_i D_i$ is a distinguished anticanonical divisor supported on the Cox ring divisors of $X$. Importantly, this replicates the same stronger lower bound as proved in the case of spherical varieties. Here we are able to interpret the terms in the Mukai
conjecture: $i\rho$ in terms of the geometry of the moment polytope of $Z$, and $n+\rho$ as an upper bound on the sum of coefficients in a decomposition of the anticanonical divisor into the Cox ring divisors. This decomposition is obtained by passing to a positive characteristic reduction of the Cox ring, where we obtain the coefficients from strong $F$-regularity, and the upper bound on the coefficient sum from the $F$-pure threshold.
Read the full abstract ▾
Differential Geometry
PINNs in More General Geometry
Edward Hirst
Neural architectures trained with losses inspired by differential conditions are the basis for PINN models. Since many constructions in differential geometry may be framed as minimisation of a differential functional, these functionals can be coded as loss functions to align the AI loss-minimisation goal with that of solving the
geometric problem. This contribution to the Recent Progress in Computational String Geometry workshop proceedings introduces the PINN architecture defining principles, motivates how they are well suited for problems in differential geometry, and demonstrates their use via summaries of three works at this intersection.
Read the full abstract ▾
Number Theory
Ramanujan, the taxicab problem for polynomials, and the abc-conjecture
Katalin Gyarmati
Starting with Ramanujan's famous taxicab problem, we can study the solvability of the equations $p^n+q^n=r^n+s^n$ and, more generally, $p_1^{k_1}+\dots+p_m^{k_m}=0$ among
polynomials.
Mathematical Physics · Cross-listed from astro-ph.SR
The Singular Behaviour of Ambipolar Diffusion Revealed by 1D Cartesian Solutions
F. Moreno-Insertis, E. R. Priest and D. Nóbrega-Siverio
Aims. We seek to (a) study 1D Cartesian ambipolar
diffusion near null points; (b) characterise the nonlinear eigenmodes for ambipolar
diffusion; (c) propose tests for ambipolar
diffusion solvers in MHD codes. Methods. (a) Direct analysis is used to find analytical solutions for ambipolar
diffusion. (b) To study the eigenmodes, we solve the ODE for self-similar solutions of the 1D ambipolar
diffusion equation using phase-plane techniques. We also solve the general time-dependent 1D problem for initial conditions of interest. (c) We test the Bifrost code by trying to reproduce the behaviour of the eigenmodes. Results. (a) A stagnation-point flow solution was found with a uniform flux transfer rate across three regions: an external advection region; an internal ambipolar
diffusion region with
magnetic profile B propto x**(1/3); and an innermost Ohmic region with B propto x; in the latter, flux annihilation occurs at a rate imposed by the advection. (b) Both symmetric and antisymmetric eigenmode solutions to the ambipolar
diffusion problem are found with sharp current sheets at the internal nulls. The time
evolution of the eigenmodes (pure or perturbed) is probed, showing how higher-order eigenmodes, or perturbed ones, evolve in time towards the lowest-order allowable eigenmodes. (c) The Bifrost code reproduces the behaviour of the eigenmodes with excellent accuracy. Conclusions. Stagnation-point configurations exist with ambipolar
diffusion carrying
magnetic flux in an inner layer and serving as an intermediary between the external advection and an Ohmic-
diffusion core around the null. Our tests are compatible with the hypothesis that zero-flux higher harmonics of the self-similar equation evolve toward either the first symmetric or antisymmetric harmonic. The self-similar solutions can serve as strong tests for ambipolar
diffusion solvers in general MHD codes.
Read the full abstract ▾
Optimization and Control
A Constraint-Lifting Framework for Safe and Stable Nonlinear Control
Jhon Manuel Portella Delgado and Ankit Goel
This paper presents a constraint-lifting control framework for designing stabilizing controllers that guarantee the forward invariance of a prescribed safe set. State-of-the-art safety-enforcing methods, such as control barrier functions (CBFs) and model predictive control (MPC), typically rely on solving constrained optimization problems in real time and therefore may not yield an explicit control law that guarantees constraint satisfaction under all conditions. In contrast, the proposed approach develops an explicit control law for a class of nonlinear systems that ensures both asymptotic stabilization of a desired
equilibrium and safety preservation of a user-defined set. The central idea is to lift the constrained state space into an unbounded domain using a sigmoid-based diffeomorphic mapping, synthesize the controller in the transformed coordinates, and then map it back to the original coordinates. To address numerical conditioning near constraint boundaries, a special class of Lyapunov candidate functions, called sigmoid integral functions, is introduced. A rigorous stability analysis, based on the Barbashi-Krasovskii-LaSalle invariance principle, establishes asymptotic convergence and safety guarantees. The efficacy of the proposed controller is demonstrated through a safe attitude-control problem.
Read the full abstract ▾
Analysis of PDEs
Pollicott-Ruelle Resonances on Flag Manifolds
Alessandro Morescalchi
We study the resonance spectrum of the multiflow induced on a flag
manifold by the action, through multiplication by the exponential map, of the Cartan subalgebra of the underlying Lie group. We give a definition of joint resonance for the flow, then prove its discreteness and existence of resonant states. We conclude by explicit characterization of the spectrum in the special cases of Projective spaces and
manifolds of full flags.
Read the full abstract ▾
Algebraic Topology
Rational Sp(2)-equivariant cohomology theories I: dominant subgroups
John Greenlees
We give a general description of the spectral space of conjugacy classes of subgroups of Sp(2): it is a disjoint union of finitely many blocks, each dominated by a subgroup: of these blocks, 26 are of dimension 1, 6 are of dimension 2 and the remainder are isolated points. On each of these blocks there is a sheaf of
polynomial rings and a component structure. These are the ingredients for constructing an abelian category A(Sp(2)) designed to reflect the structure of rational Sp(2)-equivariant
cohomology theories. We assemble the results from earlier papers in the series to show that the category of rational Sp(2)-spectra is Quillen equivalent to the category of differential graded objects of A(Sp(2)). In the sequel we will make the fine structure of A(Sp(2)) explicit, and make calculations based upon it.
Read the full abstract ▾
Numerical Analysis
Cylindrical Projections of Occupied Diffusions
Valentin Tissot-Daguette and Xin Zhang
Occupied
diffusions offer a Markovian framework for path-dependent dynamics by lifting the state space with a flow of occupation measures. Because this additional feature is infinite-dimensional, the simulation of these processes remains computationally intractable. We address this by introducing cylindrical projections, which approximate the occupation flow via a finite-dimensional system. We establish the strong convergence of this approximation to the initial process and derive corresponding convergence rates. The method is validated through Euler–Maruyama simulations of self-interacting
diffusions and an application to the Local Occupied
Volatility (LOV) model in finance. Finally, we provide a weak error analysis and explore its consequences for Monte Carlo methods and derivatives pricing.
Read the full abstract ▾
Classical Analysis and ODEs · Cross-listed from physics.soc-ph
Relocation without preference: A destination-agnostic Schelling-type metapopulation model
Fei Cao and Roberto Cortez
In this work, we propose and analyze a novel Schelling-type metapopulation model that examines how random relocations of families between neighborhoods can lead to segregation. The model consists of a large number of houses organized into $N$ neighborhoods with $L$ houses each, without any spatial structure. Houses can be occupied by either a blue or a red family, and families relocate – to an empty house selected uniformly at random – at a rate that depends only on the number of families of the other type within the same neighborhood. We study two mean-field regimes: the large $N$ limit with fixed $L$, and the large $L$ limit with fixed $N$. The associated mean-field systems of ODEs are derived, and their long-time behavior is investigated. As is often the case with Schelling-type models, we find a rich interplay between the model parameters and the social structure of the
equilibrium distribution, which exhibits segregation in some parameter ranges. Our work demonstrates that segregation patterns can emerge even when the relocation mechanism is destination-agnostic.
Read the full abstract ▾
Optimization and Control
State-Constrained Control of Discrete-Time Nonlinear Systems via Constraint Lifting
Jhon Manuel Portella Delgado and Ankit Goel
This paper presents a constraint-enforcing control framework for a class of discrete-time strict-feedback nonlinear systems. The objective is to guarantee closed-loop stability while ensuring forward invariance of a prescribed safe set defined by state constraints. The proposed approach transforms the constrained control problem into an equivalent unconstrained one through smooth constraint-lifting mappings constructed using strictly increasing sigmoid functions. Controller synthesis is then performed in the lifted coordinates, enabling recursive backstepping design while preserving the admissibility of the constrained states. Conditions on the controller gains are derived to guarantee both asymptotic stability of the closed-loop system and forward invariance of the admissible domain of the lifting functions. The analysis also establishes a conditional deadbeat property for the second backstepping step once the system trajectory enters a region in which the lifting-domain admissibility conditions are satisfied. Numerical simulations of a constrained double-integrator system demonstrate the effectiveness of the proposed method in enforcing state constraints while tracking a reference command.
Read the full abstract ▾
Algebraic Topology
Koszul modules, holonomy Lie algebras, and resonance of groups and CDGAs
Alexander I. Suciu
We develop a Koszul-theoretic framework for comparing classical Alexander-type invariants with infinitesimal invariants arising from finite-type commutative differential graded
algebra models. The central mechanism is Koszul linearization, which replaces nonlinear equivariant constructions with functorial algebraic objects defined from a CDGA. To a connected CDGA $(A,d)$ with finite-dimensional $H^1(A)$ we associate Koszul modules $\mathcal{B}_i(A)$ over the symmetric
algebra on $H_1(A)$. We prove that the first Koszul module $\mathcal{B}_1(A)$ is isomorphic to the infinitesimal Alexander invariant of the holonomy Lie
algebra $\mathfrak{h}(A)$, yielding explicit formulas for holonomy Chen ranks. We establish a tangent cone
theorem for resonance varieties, showing that
cohomology controls their first-order behavior at the origin. For finitely generated groups admitting 1-finite 1-models, we prove that classical Alexander invariants agree with Koszul invariants after completion and passage to associated graded objects, and that Chen ranks are determined by the model. Applications include Chen rank computations for 2-step nilpotent Lie
algebras and pure
elliptic braid groups, partial formality results for Sasakian
manifolds, and a general framework for detecting non-formality of spaces, groups, and maps.
Read the full abstract ▾
Optimization and Control
Adaptive Constraint-Lifting Control with Stability and Invariance Guarantees
Jhon Manuel Portella Delgado and Ankit Goel
This paper develops an adaptive tracking controller for a class of nonlinear systems with parametric uncertainty subject to state constraints. The system is characterized by a strict-feedback structure with unknown parameters entering both the drift and input channels. The objective is to design a control law, without knowledge of the unknown parameters, that guarantees closed-loop stability, achieves desired tracking performance, and ensures forward invariance of a prescribed safe set. An adaptive constraint-lifting framework is developed that transforms the constrained control problem into an equivalent unconstrained representation, enabling recursive controller synthesis in lifted coordinates. The proposed design integrates parameter estimation with constraint enforcement without requiring online optimization. A Lyapunov-based stability analysis, combined with the Barbashin-Krasovskii-LaSalle invariance principle, establishes boundedness of all closed-loop signals, asymptotic convergence of the system states to the desired
equilibrium, and forward invariance of the safe set under uncertainty. In particular, the analysis characterizes the largest invariant set of the closed-loop system and guarantees convergence despite unknown parameters. The effectiveness of the proposed approach is demonstrated on a DC motor system with uncertain parameters, illustrating accurate tracking performance and safe operation.
Read the full abstract ▾
History and Overview of Mathematics
The history of three wrong definitions
Harold P. Boas
The topic is the history of the concepts of equivalence relation, Cauchy sequence, and metric space. The thesis is that disused definitions of these notions could profitably be revived.
Mathematical Physics · Cross-listed from gr-qc
Toller matrices and the Feynman $i\varepsilon$ in spinfoams
Eugenio Bianchi, Chaosong Chen and Mauricio Gamonal
We study the analytic properties and three equivalent representations of the Toller
matrices $T^{(\pm)}$ which appear in the causal formulation of spinfoam transition amplitudes for 4d Lorentzian
quantum gravity. These are polynomially bounded functions on the Lorentz group which satisfy the relation $T^{(+)}+T^{(-)}=D$, where the Wigner
matrix $D$ provides a
unitary irreducible representation of $SL(2,C)$. Ruhl's definition of $T^{(\pm)}$ in terms of analyticity and asymptotic properties is shown to be equivalent to the recently introduced Feynman $i\varepsilon$ prescription in spinfoams. We show that, equivalently, they can be represented as an integral over
eigenvalues of the boost operator, which results in a sum over residues. The latter reproduces the Wick rotation relating Euclidean $Spin(4)$ to Lorentzian $SL(2,C)$ spinfoams studied by Dona, Gozzini and Nicotra. We provide explicit expressions in terms of hypergeometric functions and specialize them to the $\gamma$-simple representations relevant for spinfoams.
Read the full abstract ▾
Logic
Carnapian Frameworks and Categoricity of Arithmetic via Inferential $\omega$-logics
John T. Baldwin and Constantin C. Brîncuş
We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique countable model in each case, e.g. first order PA is categorical in our first logic. The 2-sorted case interprets $L_{\omega_1,\omega}$. In this paper, we discuss two philosophical problems raised by Button and Walsh \cite{ButtonWalshbook} concerting the identification of a unique isomorphism class. First, we argue that the doxological challenge (on referential determinacy) gets a clear answer if placed in an appropriate (Carnapian) linguistic framework and is meaningless otherwise. To clarify this approach, we address Button-Walsh's dismissal of concepts-modelism by developing the notion of cognitive modelism, according to which classical mathematics is a complex process of constructing and developing a distinctive class of concepts. Second, we argue that the inferential $\omega$-logics, that are much weaker than second order logic, do not appeal to the arithmetical concepts that the categoricity
theorems proved within these logics aim to secure.
Read the full abstract ▾
Dynamical Systems · Cross-listed from eess.SY
Interval Observer Design Using Observability Decomposition for Detectable Linear Systems
Gia Quoc Bao Tran, Thach Ngoc Dinh and Zhenhua Wang
We provide a systematic interval observer design method for detectable linear time-invariant (LTI) systems, where a part of the state is observable from the measured output. An observability-based invertible LTI transformation decomposes the state into two parts. The first part is decoupled from the other and observable from the output, while the second is affected by the first, does not appear in the output, but is detectable. A Sylvester-based LTI interval observer is designed for the first part. For the second part, a Jordan-based linear time-varying interval observer is built, treating the interaction from the first part as inputs with known bounds. The intervals in the original coordinates are constructed either by inverting the decomposition online for the intervals in the transformed coordinates or by directly implementing the observer written in the original coordinates. Academic examples illustrate the interest of our approach.
Read the full abstract ▾
Analysis of PDEs
Flow Decomposition, Green Testing, and Lane–Emden Inequalities on Weighted Graphs
Qingsong Gu, Lu Hao, Xueping Huang et al. (+1 more)
We study positive solutions of the superlinear Lane–Emden inequality \[ -\Delta u\ge \sigma u^q,\qquad q>1, \] on infinite locally finite weighted graphs and connected domains. When the Dirichlet Green function is finite, the existence of a positive solution is equivalent to \[ G_\Omega\bigl(\sigma g_\Omega(o,\cdot)^q\bigr)(x) \le C g_\Omega(o,x) \] for some pole \(o\in\Omega\). Under Green function estimates, this yields sharp existence criteria and the Serrin-type exponents on \(\mathbb Z^d\) and orthant domains. For nonexistence, the principal method is flow decomposition. Its basic estimate bounds Green energy from below in terms of the relative capacities of intrinsic balls. %It yields annular conductance, capacity-to-infinity, and Nash–Williams cut-resistance criteria. For \(\sigma>0\), set \(\nu=\sigma\mu\). We show that if \(d_\rho\) is a complete \(\nu\)-adapted path metric and \[ \int_1^\infty \frac{r^{2q-1}}{\nu(B_{d_\rho}(o,r))^{q-1}}\,dr=\infty, \] then every nonnegative solution is identically zero. The proof combines a flow decomposition of the acyclic Green current, a pathwise Hardy estimate, and a relative capacity estimate. It requires none of (VD), (PI), (P$_0$), or the (3G) condition.
Read the full abstract ▾
All authors Qingsong Gu, Lu Hao, Xueping Huang, Yuhua Sun
Information Theory
Fourier-Curve Constellations under Tangential Perturbation: Covariance-Aware Soft Demapping on Coded Links
Bin Han, Muxia Sun, H. Vincent Poor et al. (+1 more)
A
Fourier-curve constellation places $M$ points on a closed curve through $k$ complex slots. A Gaussian perturbation along the curve's tangent, whether injected as artificial noise or arising from first-order jitter of the curve parameter, gives every symbol an observation with a symbol-dependent rank-one covariance, and the maximum-likelihood symbol metric differs from the Euclidean rule by one rank-one correction per candidate. We realize this metric as a max-log soft demapper beside a Euclidean correlator bank at $2kM$ additional multiply–accumulate operations per symbol. On a regular $(3,6)$ LDPC-coded link at $(k,M){=}(20,64)$ it recovers $5.1$\,dB of the Euclidean mismatch at BLER${=}10^{-1}$ under natural labeling and $1.1$\,dB under Gray labeling, of which an average-covariance receiver recovers $0.7$\,dB and nothing measurable, respectively, and it makes the tangential perturbation $0.2$ to $1.0$\,dB cheaper than white noise of the same power on the same codebook. The per-tone phase orientation of the curve acts as an orthogonal rotation, so these results hold at every orientation, and the demapper decodes at the level of an exactly oriented receiver up to $0.2$\,rad of orientation error per component. A bit-interleaved coded-modulation achievable rate corroborates the ordering, a Woodbury extension keeps the rank-one structure under per-tone Rician fading, and $6$-bit lookup-table quantization costs no measurable degradation.
Read the full abstract ▾
All authors Bin Han, Muxia Sun, H. Vincent Poor, Hans D. Schotten
Dynamical Systems
Inverse Problems for the Return Map in the Class ( $\mathcal{O}_C$ ): Reconstruction and Identifiability
Mohamed El Morsalani and Mohammed Barkatou
We study the inverse problem associated with the return map $F$ on the boundary of a convex core $C$. By decomposing the return displacement into tangential and normal components, we derive an exact nonlinear reconstruction system for the unknown thickness $d$, yielding one-point uniqueness. Analyzing the linearization at fixed points introduces an operator $Q_*$: when $Q_* \neq 0$, the thickness and outer shape are uniquely recoverable via global propagation. In the degenerate regime $Q_* = 0$, local ambiguity is resolved using nonlinear Ehresmann-type transport and holonomy maps along closed paths. Finally, we establish conditional realizability and identify key topological and dynamical quantities from the return data, characterizing the commuting regime as a singular limit.
Read the full abstract ▾
Probability
SPDEs with time-independent Lévy colored noise
Raluca M. Balan and Jinxin Wang
In this article, we introduce a time-independent version of the Lévy colored noise considered in Balan (2015) and Balan and Jiménez (2026). We study the existence of the solution of a linear
stochastic partial differential equation with this type of noise, and we identify some necessary conditions which guarantee that the solution has finite $p$-th order moments. Using tools from Malliavin calculus, we investigate the existence of the solution for the equation with multiplicative noise. As examples, we consider the
stochastic heat and wave equations in any dimension $d \geq 1$.
Read the full abstract ▾
Numerical Analysis
Digital Twins in Coronary Artery Disease: A Mathematical Roadmap
Alessandro Veneziani, Annalisa Quaini, Marco Tezzele et al. (+2 more)
The combination of data and models, enhanced by AI methodologies, leads to the paradigm called Digital Twins. This concept is expected to bring unprecedented support to personalized medicine. The combination of mathematical and numerical models with diagnostic devices that provide patient-specific knowledge in a bidirectional framework can be a formidable decision support for clinicians. In this paper, we consider some mathematical aspects of constructing a Digital Twin to prevent and treat Coronary Artery Disease. The keywords for the bidirectional communication between twins in our system are (i) Data Assimilation and (ii) Probabilistic Graphic Models. In particular, a quantity of paramount interest in the evaluation and prognosis of Coronary Artery Disease is the Wall Shear Stress, i.e., the tangential component of normal stress on the arterial wall. By considering steps for the personalization and the synthesis of Wall Shear Stress estimation, we propose a mathematical roadmap for constructing a Digital Twin system that could help prevent infarcts, one of the most lethal diseases in the world.
Read the full abstract ▾
All authors Alessandro Veneziani, Annalisa Quaini, Marco Tezzele, Omer San, Traian Iliescu
Statistics Theory · Cross-listed from econ.EM
Inference for Linear Systems with Unknown Coefficients
Yuehao Bai, Kirill Ponomarev, Andres Santos et al. (+3 more)
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system of equations, including the slope coefficients, to be unknown. For this reason, we describe the linear system as having unknown (as opposed to known) coefficients. This hypothesis testing problem arises naturally when constructing confidence sets for possibly partially identified parameters in the analysis of nonparametric instrumental variables models, treatment effect models, and random coefficient models, among other settings. To rule out certain instances in which the testing problem is impossible, in the sense that the power of any test will be bounded by its size, we begin our analysis by characterizing the closure of the null hypothesis with respect to the total variation distance. We then use this characterization to develop novel testing procedures based on sample-splitting. We establish the validity of our testing procedures under weak and interpretable conditions on the linear system. An important feature of these conditions is that they permit the dimensionality of the problem to grow rapidly with the sample size. A further attractive property of our tests is that they do not require simulation to compute suitable critical values. We illustrate the practical relevance of our theoretical results in a simulation study.
Read the full abstract ▾
All authors Yuehao Bai, Kirill Ponomarev, Andres Santos, Azeem M. Shaikh, Max Tabord-Meehan, Alexander Torgovitsky
Algebraic Geometry
The Quasisymmetric Grassmannian
Nantel Bergeron, Lucas Gagnon, Hunter Spink et al. (+1 more)
We construct a complex of toric varieties we call the quasisymmetric Grassmannian inside the Grassmannian of $r$-planes in $\mathbb{C}^n$. Each irreducible component is a positroid variety and an $S_n$ translate of a toric Richardson variety of ribbon shape. We describe it as the vanishing locus of equations $\Delta_A\Delta_{A'}=0$ in Plücker coordinates determined by a new noncrossing combinatorial object we call the quasisymmetric Johnson graph. We give an affine paving, and show that its
cohomology ring is a quasisymmetric modification of the Borel presentation of the Grassmannian's
cohomology, with fundamental quasisymmetric
polynomials playing the role of Schur
polynomials.
Read the full abstract ▾
All authors Nantel Bergeron, Lucas Gagnon, Hunter Spink, Vasu Tewari
Classical Analysis and ODEs
The Uncertainty Principle in Harmonic Analysis – Lecture Notes on Selected Topics
Adem Limani
These lecture notes are devoted to selected topics related to the uncertainty principle in harmonic analysis. Rather than attempting a systematic treatment, we emphasize only a number of both classical and deep manifestations of this principle, mainly from the perspective of
Fourier analysis on the unit circle and on the real line. We consider problems of uniqueness and reconstruction for
Fourier series and
Fourier transforms, the influence of spectral gaps, and the role of logarithmic integrability in questions of approximation and quasi-analyticity. Central results discussed include the Paley–Wiener
theorem, the Beurling–Malliavin multiplier
theorem, and the Ivashev–Musatov
theorem. These notes are intended as an entry point toward the research literature, with several sections pointing in the direction of more recent developments.
Read the full abstract ▾
Number Theory
Elementary anabelian varieties are anabelian
Magnus Carlson
We show that isomorphisms of fundamental groups of elementary anabelian varieties – varieties obtained as iterated fibrations of
hyperbolic curves – over sub-$p$-adic fields correspond bijectively to isomorphisms of varieties. Moreover, dominant maps between proper elementary anabelian varieties are in bijection with “stably cohomologically injective” maps of fundamental groups: open maps whose pullbacks to all open subgroups induce injections on
cohomology rings with $\ell$-adic coefficients, for any
prime $\ell$. This verifies
conjectures of Grothendieck from his letter to Faltings. Finally, we establish étale homotopical generalizations of these results.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.RO
VISION-SLS: Safe Perception-Based Control from Learned Visual Representations via System Level Synthesis
Antoine P. Leeman, Shuyu Zhan, Melanie N. Zeilinger et al. (+1 more)
We propose
VISION-SLS, a method for nonlinear output-feedback control from high-resolution RGB images which provides robust constraint satisfaction guarantees under calibrated uncertainty bounds despite partial observability, sensor noise, and nonlinear dynamics. To enable scalability while retaining guarantees, we propose: (i) a learned low-dimensional observation map from pretrained visual features with state-dependent error bounds, and (ii) a causal affine time-varying output-feedback policy optimized via System Level Synthesis (SLS). We develop a scalable, novel solver for the resulting nonconvex program that leverages sequential convex programming coupled with efficient Riccati recursions. On two simulated visuomotor tasks (a 4D car and a 10D quadrotor) with >= 512 x 512 pixels and a 59D
humanoid task with partial observability, our method enables safe, information-gathering behavior that reduces uncertainty while guaranteeing constraint satisfaction with empirically-calibrated error bounds. We also validate our method on hardware, safely controlling a ground vehicle from onboard images, outperforming baselines in safety rate and solve times. Together, these results show that learned visual abstractions coupled with an efficient solver make SLS-based safe visuomotor output-feedback practical at scale. The code implementation of our method is available at https://github.com/trustworthyrobotics/
VISION-SLS.
Read the full abstract ▾
All authors Antoine P. Leeman, Shuyu Zhan, Melanie N. Zeilinger, Glen Chou
Combinatorics
Gap sets of random generalized numerical semigroups
Veronica Bitonti and Noah Kravitz
For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical
semigroup generated by $A$. We show that with high probability (as $p \to 0$), the gap set $\mathbb{Z}_{\geq 0}^d \setminus S$ is well approximated by the shifted hyperboloid region $$\{(x_1, \ldots, x_d) \in \mathbb{R}_{\geq 0}^d: (x_1+\log p^{-1}) \cdots (x_d+\log p^{-1})\ll p^{-1}(\log p^{-1})^{d+1}\}.$$ This generalizes work of the second author, Morales, and Schildkraut on the $1$-dimensional setting. We also obtain the same result with $S$ replaced by the set of subset sums of $A$.
Read the full abstract ▾
Algebraic Geometry
The $\mathbf{P}^1$-motivic Gysin map
Longke Tang
We develop a $\mathbf{P}^1$-unstable non-$\mathbf{A}^1$-invariant theory of motivic spaces and spectra, and construct the Gysin map therein for regular immersions. This in particular gives the Gysin map in the Annala–Hoyois–Iwasa $\mathbf{P}^1$-motivic spectra, and thus gives a uniform construction for the Gysin maps of various
cohomology theories.
Read the full abstract ▾