Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 25 April
In this note, we study the resonance variety of rank-two vector bundles over an elliptic curve. Our approach is based on analyzing the flattening stratification of the resonance. We also investigate the linear section of the Grassmann variety $\operatorname{Gr}(2,n)$ from which the resonance is constructed through the lens of its corresponding flattening stratification.
Combinatorics
Kronecker coefficients via the Giambelli identity for Schur functions
One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable advance in this direction is due to Blasiak, who proved a combinatorial interpretation in terms of colored Yamanouchi tableaux for the case whereby one of the indexing partitions is hook-shaped. In this paper, we introduce a framework for the evaluation and combinatorial interpretation of Kronecker coefficients, combining a Schur function identity of Littlewood, the Giambelli identity for Schur functions, and Blasiak's combinatorial rule. This framework reduces the study of Kronecker coefficients to alternating sums involving hook-indexed cases. As an application of this framework, we obtain combinatorial interpretations of $g_{t, h^{(1)}, h^{(2)}}$ for two-row partitions $t$ and hook-like partitions $h^{(1)}$ and $h^{(2)}$ satisfying natural conditions. More broadly, our approach provides a systematic method for extending hook-based combinatorial rules to wider families of Kronecker coefficients.
Read the full abstract
Logic · Cross-listed from cs.LO
The Constructive $\mu$-calculus: Game Semantics and Non-Wellfounded Proof Systems
We study a variant of the modal $\mu$-calculus based on the constructive modal logic $\mathsf{CK}$. We define game semantics for the constructive $\mu$-calculus and prove its equivalence to the birelational Kripke semantics. We then use the game semantics to prove the soundness and completeness of a fully-labeled non-wellfounded proof system for it. At last, we briefly describe how to adapt the game semantics and proof system to the $\mu$-calculus over other non-classical modal logics.
Read the full abstract
Dynamical Systems
WSINDy for Model Predictive Control with Applications to Fusion, Drones, and Chaos
The control of complex dynamical systems remains a fundamental challenge in science and engineering, where strong nonlinearities, the presence of noise, and computational constraints often pose significant obstacles in traditional control approaches. Recent advances in data-driven methods, particularly system identification techniques, have shown a powerful alternative by providing fast, parsimonious, interpretable models that are well-suited for model predictive control (MPC). Building on these developments, the present article embeds WSINDy with actuation inputs (WSINDYc) within a MPC framework. Compared to benchmark data-driven methods, WSINDYc enables a more robust identification of the governing dynamics, particularly in the presence of high noise levels, resulting in more accurate and efficient control. The capabilities of the proposed WSINDY-MPC framework are demonstrated on a range of problems, including a tokamak plasma boundary model that includes main ion gas puff actuation, drone tracking and collision avoidance, the chaotic Lorenz system, and a simplified flight control model for an F-8 aircraft. The proposed framework achieves superior performance in the presence of noise, enabling longer prediction horizons, lower trajectory tracking error, and a more reliable obstacle clearance, while simultaneously achieving lower MPC cost values compared to the baseline methods.
Read the full abstract
Numerical Analysis
A Filtered MgNet Solver For Radiative Transfer Equations
Conventional numerical solvers for the radiative transfer equation (RTE) exhibit severe sensitivity to medium parameters. To address this, we propose an operator learning framework that approximates the RTE solution map as a function of material properties. The core architecture, MgNet, preserves the solution operator framework established by recursive skeleton factorization (RSF) but substitutes its coefficient-specific sub-operators (e.g. smoother, prolongation operator and restriction operator) with learnable neural components. This design transcends the the fixed parametric structure of classical schemes, enabling data-driven sub-operator optimization and learning of their medium-parameter dependence. To mitigate spectral bias in operator learning, we introduce an adaptive angular compression technique within the loss function that dynamically suppresses high-frequency modes responsible for training instability. Comprehensive benchmarks demonstrate that, when deployed as a learned preconditioner, MgNet achieves at least 10 times acceleration over conventional preconditioners in the diffusive regime and maintains robust generalization to unseen parameter configurations. By unifying multilevel factorization structure with deep operator learning, this work establishes a physics-constrained operator-learning paradigm for radiative transport simulations.
Read the full abstract
Differential Geometry
Mabuchi solitons and Mabuchi constants on Fano admissible manifolds
In this paper, we study the existence of Mabuchi solitons on admissible manifolds as defined by Apostolov–Calderbank–Gauduchon–Tønnesen-Friedman. We prove that a Fano admissible manifold admits a Mabuchi soliton if and only if the Mabuchi constant is less than 1. We also provide an explicit formula for the Mabuchi constant on Fano admissible manifolds, which generalizes that of Mabuchi. Using this formula, we completely determine the existence and non-existence of Mabuchi solitons on Fano admissible manifolds over the complex projective space $\mathbf{P}^{n}$.
Read the full abstract
Mathematical Physics · Cross-listed from physics.optics
Pulsed Vertical Electric Dipole Over a Lossy Halfspace: On the Time-Domain Zenneck Wave
We investigate the transient electromagnetic field radiated by a pulsed vertical electric dipole above a lossy half-space and identify its time-domain signatures associated with the Zenneck wave. Starting from the classical Sommerfeld representation, we derive a causal time-domain formulation based on the double-deformation technique, with successive contour deformations in the transverse-wavenumber and frequency planes. This yields an explicit decomposition of the field into source-pole, loss-pole, modal-pole, and residual steepest-descent contributions. The resulting expressions exactly satisfy causality and are validated against a reference solution obtained through a standard double inverse transform. The analysis shows that one modal contribution, generated by the frequency-plane deformation and related to the frequency-domain Zenneck pole, exhibits reduced-time invariance and a spatial attenuation consistent with a surface-wave component. Under suitable source and observation conditions, this term can dominate the field over a broad and physically relevant finite late-time interval. At the same time, for the considered damped-sinusoidal excitation, the strict asymptotic tail at fixed distance remains algebraic of order $t^{-5/2}$, with contributions from both the residual continuous spectrum and the modal-pole family. These results provide a rigorous and physically interpretable time-domain manifestation of the frequency-domain Zenneck wave in the pulsed half-space problem.
Read the full abstract
Mathematical Physics
Matched asymptotics of Rayleigh-wave fields near cuspidal ridges and gorges
We construct a local matched-asymptotic description of time-harmonic elastic fields generated by Rayleigh waves near cuspidal elements of a traction-free surface. The free surface is represented locally by a cusp graph with exponent $0<\alpha<1$, or equivalently by a vanishing-width horn $b(s)=B s^m$, $m=1/\alpha>1$. A cuspidal gorge is a zero-opening re-entrant notch: its leading field is the Williams crack-tip field, and the stresses behave as $r^{-1/2}$. The cusp exponent affects the gorge through lower-order corrections and through the stress cut-off produced by rounding the bottom. In contrast, a cuspidal ridge behaves as an elastic horn with vanishing width. The leading admissible free-tip field is asymptotically rigid (bounded stress), distinct from the high-energy branch supported by a finite tip truncation, where stresses grow as $\sigma \sim \rho^{-m}$. Finite-element calculations for the local static Lamé problems support these predictions: the free-tip ridge test confirms the absence of crack-like growth, the truncated ridge recovers the high-energy law, and the gorge stress slope is found to be close to $-1/2$.
Read the full abstract
Information Theory
Age of Information under Source-Aware Truncated ARQ in Multi-Source Wireless Status Updating
This paper studies information timeliness in multi-source wireless Internet of Things (IoT) status updating systems under a truncated Automatic Repeat reQuest (ARQ) protocol. We propose a source-aware truncated ARQ (SATARQ) scheme that allows differentiated maximum transmission times (MTTs) tailored to different sources. This work focuses on a wireless system with preemptive update management. To study the statistical characteristics of the age of information (AoI) process for each source, a multi-dimensional age process (MDAP) is developed and modeled as a Markov chain, tracking both the AoI and the age of the concerned source's update currently in transmission. Via Markov analysis of the MDAP, we obtain analytical expressions for the distributions and averages of the AoI and peak AoI, as well as the average power consumption of IoT device. The timeliness-energy tradeoff is analyzed by examining the impact of the MTT, update generation probability (UGP), and wireless transmission power (TP). Moreover, this work explores the energy efficiency of the wireless status updating process and its relationship with the information timeliness and energy cost. Numerical results validate the theoretical analysis. Finally, it is demonstrated that the proposed SATARQ, combined with the optimization of MTTs, UGPs, and TPs, significantly improves the overall timeliness-energy tradeoff and energy efficiency across all sources.
Read the full abstract
Logic
Polytopological Semantics for Intuitionistic Modal Logics
We develop polytopological semantics for various constructive, intuitionistic, and Gödel–Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over a single set, equipped with either the closure or derivative operators. We identify regularity conditions to ensure that spaces validate each of our target logics and prove that all the logics considered are sound and strongly complete with respect to their respective semantics.
Read the full abstract
Operator Algebras
Spectral versus interpolation norms in tracial nonassociative $\mathrm{L}^p$-spaces
We investigate the metric structure of nonassociative $\mathrm{L}^p$-spaces associated with tracial $\mathrm{JW}^*$-algebras. While noncommutative $\mathrm{L}^p$-spaces arising from von Neumann algebras enjoy a unique natural norm, the situation in the Jordan setting is more subtle. We compare two canonical definitions: the interpolation norm, arising from the complex method between the algebra and its predual, and the spectral norm, defined with the trace. We show that these two norms are equivalent but generally not isometric for $p \neq 2$, even in the associative case of nonabelian von Neumann algebras when viewed through the Jordan product, thereby answering an open question raised by the first author in a previous paper. We further analyze the geometry of these spaces in concrete examples as complex spin factors or the complexified Albert algebra. Finally, we discuss the relevance of these results to generalized probabilistic theories (GPTs), where Jordan structures arise naturally, and explain why $\mathrm{JBW}$-algebras and their preduals provide a natural framework for such models.
Read the full abstract
Statistics Theory
Solidarity of Spectral Gaps for Component-Wise Markov Chains
Deterministic-scan and random-scan component-wise Markov chain Monte Carlo algorithms, such as Gibbs samplers and conditional Metropolis-Hastings, are popular approaches for sampling from multivariate distributions. A long-standing open question is to determine the conditions under which these algorithms have similar convergence rates. A block-wise contraction condition for the component-wise updates is used to establish a solidarity principle for the $L^2$ spectral gaps of the associated Markov chains. Specifically, under this condition, the spectral gaps of the random-scan and deterministic-scan versions of the Gibbs and component-wise chains are either simultaneously positive or simultaneously zero. Moreover, the spectral gaps differ by at most polynomial factors in the number of blocks. As an application of the general results, a deterministic-scan conditional Metropolis-adjusted Langevin algorithm (MALA) for multivariate Gaussian targets is studied. The block-wise contraction condition is combined with known spectral gap bounds for the random-scan Gibbs sampler to obtain a spectral gap bound that is polynomial in dimension. The result is used to clarify how the convergence rate of the conditional MALA depends on the precision matrix of the Gaussian target and the step sizes of the block-wise MALA updates.
Read the full abstract
Analysis of PDEs
Long time upper bounds for solutions of Leibenson's equation on Riemannian manifolds
We consider on Riemannian manifolds the Leibenson equation $$\partial _{t}u=\Delta _{p}u^{q}.$$ We prove that a certain upper bound for weak solutions of this equation is equivalent to a euclidean-type Sobolev inequality.
Optimization and Control · Cross-listed from cs.LG
A Layer Separation Optimization Framework for Cross-Entropy Training in Deep Learning
This paper investigates the deep learning optimization problem with softmax cross-entropy loss. We propose a layer separation strategy to alleviate the strong nonconvexity encountered during training deep networks. For cross-entropy models with fully connected and convolutional neural networks, we introduce auxiliary variables associated with hidden layer outputs and construct corresponding layer separation models, which decompose the original deeply nested optimization problem into a sequence of more manageable subproblems. We also conduct theoretical analyses, proving that the new layer separation loss provides an upper bound for the original cross-entropy loss. Moreover, we design alternating minimization algorithms and prove that, under appropriate conditions, these algorithms exhibit decreasing properties of the loss function. Numerical experiments validate the effectiveness of the proposed methods and indicate improved optimization behavior, especially for fully connected and convolutional neural networks.
Read the full abstract
Combinatorics
Une curieuse égalité entre deux sommes de produits de coefficients binomiaux
We will show in this text that, for all non-negative integers $n$ and $l$, the following equality is verified: \[\sum_{i=0}^{l} {n-i \choose i}{l+i \choose 2i+1}=\sum_{i=0}^{l} {n-i \choose i-1}{l+i \choose 2i}.\] We will first address the case where $l \leq n$, for which both sums contain only classical binomial coefficients. Then, we will consider the general framework using generalized binomial coefficients.
Read the full abstract
Complex Variables
On the Third Hankel Determinant for Inverse Coefficients of Starlike Functions: A Bernstein Polynomial Approach
Let $\mathcal{A}$ denote the class of normalized analytic functions $f$ in the open unit disk defined as $ \mathbb{D}:=\{z\in\mathbb{C}:|z|<1\} $ with $f(0)=0$ and $f'(0)=1$. A function $f\in\mathcal{A}$ is said to be starlike if $f(\mathbb{D})$ is starlike domain. By using the Bernstein polynomial method to obtain the required maximum estimate, we establish sharp upper bound for the third Hankel determinant corresponding to the inverse coefficients of starlike univalent (i.e., one-to-one) functions in the unit disk $\mathbb{D}$.
Read the full abstract
Optimization and Control
Secure estimator design for Lur'e-type systems with nonuniformly and synchronously sampled measurements under attacks [extended version]
Motivated by the need for real-time health monitoring of power distribution grids, we propose a secure state estimator design for continuous time Lur'e type systems with non-uniformly and synchronously sampled outputs which have potentially been maliciously corrupted. The secure state estimator provides state estimates with accuracy independent of the sensor attack, when less than half of the sensors are under attack and when all inter-sample times are upper bounded. We show convergence of the state estimation error under an impulsive system framework and provide an upper bound on the estimation error that is independent of the attack signals. The stability conditions are formulated as linear matrix inequalities, which can be used to design the observer parameters. We demonstrate the capabilities of the proposed secure state estimator on a low-voltage power distribution grid.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Learning Curves and Benign Overfitting of Spectral Algorithms in Large Dimensions
Existing large-dimensional theory for spectral algorithms resolves either the optimally tuned point or the interpolation limit, but leaves the under-regularized regime unexplored. We study the learning curve and benign overfitting of spectral algorithms in the large-dimensional setting where the sample size and dimension are of comparable order, i.e., $n \asymp d^{\gamma}$ for some $\gamma>0$. We first consider inner-product kernels on the sphere $\mathbb{S}^{d-1}$ and establish a sharp asymptotic characterization of the excess risk across the full regularization path under various source conditions $s \geq 0$, where $s$ measures the relative smoothness of the regression function. Our results reveal that the learning curve is not simply U-shaped but instead consists of three distinct regimes: over-regularized, under-regularized, and interpolation regimes. This characterization allows us to fully capture the benign overfitting phenomenon, demonstrating that benign overfitting arises consistently across both the under-regularized and interpolation regimes whenever $s$ is positive but no larger than a critical threshold. We further show that, in the sufficiently regularized regime, the kernel learning curve is recovered by an associated sequence model. Finally, we extend the learning-curve analysis to large-dimensional KRR for a class of kernels on general domains in $\mathbb{R}^d$ whose low-degree eigenspaces satisfy spectral-scaling and hyper-contractivity conditions.
Read the full abstract
Combinatorics
Formalizing $A_1^{(1)}$ Curve Neighborhoods in Lean 4
Combinatorial curve neighborhoods are somewhat foundational when setting up the quantum Schubert calculus for affine flag manifolds. In the specific case of type $A_1^{(1)}$, you can encode these neighborhoods entirely within the moment graph of the infinite dihedral group $D_\infty$. Building on the framework developed by Mihalcea and Norton, this paper presents a complete, axiom-free formalization of these combinatorial curve neighborhoods in Lean 4. Rather than just wrapping mathematical statements, we formalized $D_\infty$ directly as a Coxeter system to explicitly compute length functions and degree maps. Reachable sets are defined through edge chains bounded by specific degrees, and we ultimately characterize the curve neighborhood by the maximal vertices inside these sets. The core effort here lies in formally verifying the explicit combinatorial formulas for curve neighborhoods of arbitrary elements. Interestingly, by restricting our search space to finite sets, we also managed to extract a fully computable version of these neighborhoods.
Read the full abstract
Numerical Analysis
A Low-rank ADI Algorithm for Solving Large-scale Non-symmetric Algebraic Riccati Equations
This paper considers large-scale nonsymmetric continuous-time algebraic Riccati equations (NAREs) that admit low-rank solutions. Low-rank alternating direction implicit (ADI) methods have proven to be an efficient approach for solving several matrix equations, including Lyapunov equations, Sylvester equations, and symmetric Riccati equations. Although a low-rank algorithm for the Sylvester equation has been used as an inner loop in computing low-rank solutions of NAREs, no low-rank ADI algorithm currently exists for NAREs themselves. This paper fills this gap by developing a low-rank ADI algorithm for large-scale NAREs that admit a low-rank solution. Since Lyapunov equations, Sylvester equations, and symmetric Riccati equations are special cases of the NARE, the existing low-rank ADI methods in the literature are special cases of the more general low-rank ADI method proposed here. An automatic and computationally efficient method for shift generation is also discussed, and a subspace-accelerated projection approach is presented to generate shifts for subsequent iterations without user intervention. Once initialized with arbitrary shifts, the proposed algorithm solves large-scale NAREs autonomously, generating its own shifts. Numerical results are presented using benchmark example of order $10^6$, demonstrating the computational efficiency and accuracy of the proposed algorithm.
Read the full abstract
Differential Geometry
Normal-Yang-Mills and Tangent-Yang-Mills submanifolds
This paper investigates the variational problems associated with the $L^2$-norms of the normal and tangent curvature tensors for submanifolds immersed in a unit sphere. We define the critical points of these functionals under normal variations as Normal-Yang-Mills and Tangent-Yang-Mills submanifolds, for which we explicitly establish the Euler-Lagrange equations in terms of the second fundamental form. Furthermore, by investigating the focal submanifolds of OT-FKM isoparametric hypersurfaces, we construct infinitely many non-trivial examples of both Normal-Yang-Mills and Tangent-Yang-Mills submanifolds. Notably, the curvature tensors of these examples generally do not satisfy the classical Yang-Mills equations.
Read the full abstract
Number Theory
A Proof of Bala's General-$m$ Representation of the Harmonic Numbers
For every nonzero integer $m$ and every integer $n \ge 1$, the $n$\textsuperscript{th} harmonic number $H_n = 1 + \tfrac12 + \dots + \tfrac1n$ satisfies the identity \[ H_n \;=\; \frac{1}{m}\,\sum_{k=1}^{n} \frac{(-1)^{k+1}}{k}\, \binom{m k}{k}\binom{n + (m-1)k}{n - k}. \] The cases $m = 1$ and $m = 2$ are classical; for general nonzero integer $m$ the identity was conjectured by P.~Bala in the OEIS entry A001008 in 2022 and remained open. We prove it here, working throughout in $\QQ[[x]]$. The proof reduces, via a substitution $u = x/(1-x)^m$, to two formal-power-series identities: a Lagrange–Bürmann evaluation of $\sum_{k\ge1} \binom{mk}{k} u^k / k$, and the fixed-point fact that under that substitution the unique solution $v(u)$ of $v = u(1-v)^{m}$ is $v = x$. The argument extends verbatim to arbitrary complex $m \ne 0$.
Read the full abstract
Dynamical Systems
A Network Transformation Mapping Approach to Synchronization of Multi-Agent Systems With Disconnected Switching Topologies
This paper focuses on the multi-agent synchronization problem with an open-loop unstable leader and followers under the switching topologies. For this issue, the typical approach is intermittent communication (including a spanning tree intermittently) or fast switching strategy. We here consider a more general scenario where each communication link between two agents is randomly disconnected and reconnected, and the durations of both the disconnected intervals and the connected intervals follow negative exponential distributions. To handle this issue, we propose a network transformation mapping method that divides the communication network into reachable and unreachable parts at any time. A node can access the leader's information and synchronize only when it lies in the reachable part; otherwise, it cannot. For each node, the synchronization speed is designed such that its convergence amplitude in the reachable part exceeds its divergence amplitude in the unreachable part. Hence, all nodes achieve asymptotic synchronization over the entire time domain. We further develop adaptive strategies for coupling gains to reduce the computational complexity introduced by the network transformation mapping. The proposed method is also applicable to jointly connected switching topologies and distributed observers under topologies that lack a spanning tree at any time. Finally, two numerical simulations – synchronous control of multi-one-link manipulator systems and multi-motor systems based on Fieldbus – are provided to demonstrate the effectiveness of our approach.
Read the full abstract
Dynamical Systems
On the construction of almost periodic solutions for the derivative nonlinear Schrödinger equation
In this paper, we consider a derivative nonlinear Schrödinger equation $$ \mathrm{i}\partial_{t}u+\partial_{xx}u-V\ast u+\mathrm{i}\vert u\vert^{2}\partial_{x}u=0 $$ on the torus $\mathbb{T}$, depending on some potential $V$. We prove that for `almost all' potentials $V$, this equation admits an almost-periodic solution.
Read the full abstract
General Topology
On proper compactifications of topological groups
In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of possible extensions of algebraic operations on a topological group to its compactifications, and give descriptions of Roelcke, Ellis, WAP, and graph compactifications of topological groups. Additionally, using dichotomy theorems of A.V.Arhangelskii, we show that the description of compactifications can be effectively used in the investigation of topological properties of their remainders. As examples, subgroups of the permutation group (in the permutation topology) and the automorphism group of a LOTS (in the topology of pointwise convergence) are examined.
Read the full abstract
Functional Analysis
Boundedness of commutator generated by fractional integral operator and Orlicz-BMO function
For $\alpha\in(0, n)$ and a growth function $\varphi:[0,\infty)\rightarrow [0,\infty)$, it is proved that the commutator $[b,I_\alpha]$ generated by fractional integral operator $I_\alpha$ and Orlicz $\mathrm{BMO}$ function $b$ is bounded from Orlicz-Hardy space $H_{b}^{\varphi}(\mathbb{R}^{n})$ to Lebesgue space $L^{\frac{n}{n-\alpha}}(\mathbb{R}^{n})$, where $H_{b}^{\varphi}(\mathbb{R}^{n})$ is a suitable Orlicz-Hardy space. Moreover, the authors also establish that the boundedness of commutator $[b,I_\alpha]$ from Orlicz-Hardy space $H^{\varphi}(\mathbb{R}^{n})$ to weak Lebesgue space $L^{\frac{n}{n-\alpha},\infty}(\mathbb{R}^{n})$.
Read the full abstract
Numerical Analysis · Cross-listed from cs.DS
Well-Conditioned Oblivious Perturbations in Linear Space
Perturbing a deterministic $n$-dimensional matrix with small Gaussian noise is a cornerstone of smoothed analysis of algorithms [Spielman and Teng, JACM 2004], as it reduces the condition number of the input to $O(n)$, and with it the complexity of many matrix algorithms. However, when deployed algorithmically, these perturbations are expensive due to the cost of generating and storing $n^2$ Gaussian random variables. We propose a perturbation that requires generating and storing $O(n)$ random numbers in $O(\log n)$ bits of precision, and reduces the condition number of any deterministic matrix to $O(n)$, matching Gaussian perturbations. Our result in particular implies a better complexity for the perturbed conjugate gradient algorithm, showing that we can solve an $n\times n$ linear system in linear space to within an arbitrarily small constant backward error using $O(n)$ matrix-vector products. In our construction, we introduce the concept of a pattern matrix, which is a dense deterministic matrix that maps all sparse vectors into dense vectors, and we combine it with a sparse perturbation whose entries are dependent and located in a non-uniform fashion. In order to analyze this construction, we develop new techniques for lower bounding the smallest singular value of a random matrix with dependent entries.
Read the full abstract
Combinatorics
Binary Words Containing Few Abelian Squares
Fici and Saarela ([2]) conjectured that a binary word of length n contains at least $\lfloor n/4 \rfloor$ abelian squares. We slightly extend this conjecture and show that it holds in some special cases. In all other cases we have the following: given a Parikh vector over a two letter alphabet we produce a word with that Parikh vector which we conjecture contains the least possible number of abelian squares.
Read the full abstract
Information Theory
A Unified Fractional Regularization Framework for Sparse Recovery
We propose a unified fractional regularization framework for sparse signal recovery based on the $\ell_1/\ell_p^q$ model. This model generalizes several widely used sparsity-promoting regularizers and provides additional flexibility through the parameters $p$ and $q$. Our main theoretical contribution is the characterization of the equivalence between the first-order stationary points of the $\ell_1/\ell_p^q$ formulation and the subtractive $\ell_1-\alpha\ell_p$ model, thereby offering a unified perspective on these nonconvex regularizers. In addition, we establish a new sufficient recovery condition under the Restricted Isometry Property (RIP), which shows that the proposed framework can provide relaxed recovery guarantees and improved robustness. To solve the resulting nonconvex problem, we develop a majorization–minimization (MM) algorithm and prove its convergence by using the Kurdyka–Łojasiewicz (KL) property. Numerical experiments on sparse recovery problems with different sensing matrices and MRI reconstruction demonstrate that the proposed approach outperforms existing methods in recovery accuracy.
Read the full abstract
Algebraic Geometry
Diffeomorphism types of simply connected $3$-dimensional Mori fibre spaces
In this article, we find finitely many numerical invariants to classify the diffeomorphism types of three dimensional simply connected Mori fibre spaces with torsion free homology groups.