Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 24 February

Number Theory

Solutions of polynomial equations in several variables modulo a prime power

We explain how to obtain the set of solutions of a multivariate polynomial equation modulo a power of a prime number. These solutions are determined by a tree, called the trunk, which makes it possible to reconstruct all solutions. We apply these methods to determine the number of solutions, without having to enumerate them. We also illustrate these techniques by proving a simple case of Igusa's theorem: the Poincaré series associated with a polynomial in two separated variables is rational.
Read the full abstract

Optimization and Control

On the Convergence of Stochastic Gradient Descent with Perturbed Forward-Backward Passes

We study stochastic gradient descent (SGD) for composite optimization problems with $N$ sequential operators subject to perturbations in both the forward and backward passes. Unlike classical analyses that treat gradient noise as additive and localized, perturbations to intermediate outputs and gradients cascade through the computational graph, compounding geometrically with the number of operators. We present the first comprehensive theoretical analysis of this setting. Specifically, we characterize how forward and backward perturbations propagate and amplify within a single gradient step, derive convergence guarantees for both general non-convex objectives and functions satisfying the Polyak–Łojasiewicz condition, and identify conditions under which perturbations do not deteriorate the asymptotic convergence order. As a byproduct, our analysis furnishes a theoretical explanation for the gradient spiking phenomenon widely observed in deep learning, precisely characterizing the conditions under which training recovers from spikes or diverges. Experiments on logistic regression with convex and non-convex regularization validate our theories, illustrating the predicted spike behavior and the asymmetric sensitivity to forward versus backward perturbations.
Read the full abstract

Probability

Multi-time Loewner energy: rate function for large deviation

The classification of probability measures that satisfy both conformal invariance and domain Markov property is equivalent to characterizing solutions to the Belavin–Polyakov–Zamolodchikov (BPZ) equations, as established by Dubédat~[Dub07]. In this context, the partition functions for half-watermelon SLE and for multi-radial SLE serve as fundamental solutions to the BPZ equations. In this article, we investigate the large deviation principle for both half-watermelon SLE and multi-radial SLE. The associated rate function is given by the multi-time Loewner energy, introduced in~[CHPW26]. As applications, we provide an alternative proof of the large deviation principle for Dyson Brownian motion, as well as a new derivation of the boundary perturbation property of the multi-time Loewner energy.
Read the full abstract

Statistics Theory

Scalable multitask Gaussian processes for complex mechanical systems with functional covariates

Functional covariates arise in many scientific and engineering applications when model inputs take the form of time-dependent or spatially distributed profiles, such as varying boundary conditions or changing material behaviours. In addition, new practices in digital simulation require predictions accompanied by confidence intervals. Models based on Gaussian processes (GPs) provide principled uncertainty quantification. However, GPs capable of jointly handling functional covariates and multiple correlated functional tasks remain largely under-explored. In this work, we extend the framework of GPs with functional covariates to multitask problems by introducing a fully separable kernel structure that captures dependencies across tasks and functional inputs. By taking advantage of the Kronecker structure of the covariance matrix, the model is made scalable. The proposed model is validated on a synthetic benchmark and applied to a realistic structure, a riveted assembly with functional descriptions of the material behaviour and response forces. The proposed functional multitask GP significantly improves over single task GPs. For the riveted assembly, it requires less than 100 samples to produce an accurate mean and confidence interval prediction. Despite its larger number of parameters, the multitask GP is computationally easier to learn than its single task pendant.
Read the full abstract

All authors Razak Christophe Sabi Gninkou, Andrés F. López-Lopera, Franck Massa, Rodolphe Le Riche

Mathematical Physics · Cross-listed from physics.flu-dyn

On the Mathematical Analysis and Physical Implications of the Principle of Minimum Pressure Gradient

In this paper, we establish a two-way equivalence between the incompressible Navier- Stokes equation (INSE) and the principle of minimum pressure gradient (PMPG). We prove that a candidate smooth flow field is a solution of the INSE if and only if its instantaneous evolution minimizes, at every instant, the norm of the pressure force, required to enforce incompressibility. We show that the PMPG is precisely the minimization formulation of the Leray-Helmholtz projection. Any admissible instantaneous evolution (e.g., onset of separation) resulting from the INSE necessarily minimizes the PMPG cost. Conversely, any other kinematically admissible evolution, requiring a strictly larger pressure force to ensure the same constraints, does not satisfy the INSE. Thus, the PMPG offers a variational perspective through which intricate incompressible flow behaviors may be interpreted. In a finite-dimensional setting with divergence-free modes, we show that the PMPG yields the same dynamics as classical Galerkin projection. Moreover, the PMPG provides a natural generalization of classical Galerkin projection beyond linear modal expansions, accommodating nonlinear and non-modal representations. We then examine the relation between instantaneous dynamical minimization and steady variational selection, including its connection to the variational theory of lift. Motivated by these observations, we formulate conjectures concerning necessary conditions for stability and the convergence of Navier-Stokes solutions to Euler's in the vanishing-viscosity limit.
Read the full abstract

Information Theory

Insertion Correcting Capability for Quantum Deletion-Correcting Codes

It is conjectured that a quantum code $C$ corrects $t$ deletion errors if and only if $C$ corrects a total of $t$ insertion and deletion errors. Although this conjecture has been proved only under certain conditions, it has not been proved in general. In this paper, we prove this conjecture for general quantum codes. Specifically, we show that a quantum state after an insertion error is represented as a product state of the original multi-qudit system and the inserted quantum state. Then, we prove this conjecture by combining the previous results and this property. In addition, we define generalized insertion errors by removing the quantum channel requirement from insertion errors and present their properties.
Read the full abstract

Rings and Algebras

Symmetric Rota-Baxter systems and applications

Rota-Baxter operators and bialgebras are closely connected in several applications, such as the Connes-Kreimer renormalization framework and the operator approach to the classical Yang-Baxter equation. The concept of a Rota-Baxter system was introduced in 2016 as a generalization of a Rota-Baxter operator. In this work, we introduce a bialgebra structure compatible with a symmetric Rota-Baxter system, called a symmetric Rota-Baxter antisymmetric infinitesimal (ASI) bisystem. This bialgebra is characterized by generalizations of matched pairs of algebras and double constructions of Frobenius algebras to the setting of symmetric Rota-Baxter systems. Investigating the coboundary case leads to an enriched version of the associative Yang-Baxter equation (aYBe) adapted to symmetric Rota-Baxter systems. Antisymmetric solutions of this equation are used to construct symmetric Rota-Baxter ASI bisystems. We also introduce the notion of an $\mathcal{O}$-operator on a symmetric Rota-Baxter system, which produces solutions of the admissible aYBe in such systems and thereby gives rise to symmetric Rota-Baxter ASI bisystems. A symmetric Rota-Baxter bisystem generalizes several known structures, including Rota-Baxter Lie bisystems, Rota-Baxter ASI bialgebras, Rota-Baxter Lie bialgebras, averaging ASI bialgebras, averaging Lie bialgebras, and special apre-perm bialgebras.
Read the full abstract

Logic

Almost cohomology of finite-dimensional Lie rings

We introduce almost cohomology groups for Lie rings definable in finite-dimensional theory. In particular, we define the 0th and 1st almost cohomology groups of a Lie ring module. Moreover, we prove that the 1st almost cohomology group of a finite-dimensional definable Lie ring module is finite if the 0th almost cohomology group is finite.
Read the full abstract

Combinatorics

Generating functions for compositions with constrained even parts

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly larger than $k$, and we introduce a two-variable generating function that encodes this statistic. We show that this generating function is rational and obtain explicit closed forms, depending on the parity of $k$. As a consequence, we derive exact counting formulas and linear recurrence relations for the number of compositions of $n$ with a prescribed number of even parts greater than $k$. We also obtain explicit formulas for related refined quantities, such as the number of compositions with an even or odd number of such parts, the total number of their occurrences among all compositions of $n$, and positional statistics describing how late the first such part appears in a composition. This combinatorial problem is motivated by questions arising from combinatorial expansions related to zeta functions of algebraic curves over finite fields, although the results of this paper are entirely combinatorial.
Read the full abstract

Dynamical Systems

On K{\r u}rka's dichotomy for cellular automata on groups

This paper is about topological dynamics of cellular automata on finitely generated groups. We tackle the problem of determining for which group sensitivity to initial conditions is equivalent to the absence of equicontinuity points (so-called K{\r u}rka's dichotomy). We show that the dichotomy holds on any virtually-Z group but not on free groups with 2 or more generators. We also show that if it holds on some group, it must hold on any of its subgroups.
Read the full abstract

Commutative Algebra

Grade and Cohen-Macaulayness for DG-modules

We establish an inequality relating the projective dimension of a DG-module in $\mathrm{D}^\mathrm{b}_\mathrm{f}(A)$ to its grade and introduce the concept of perfect DG-modules as a natural generalization of perfect modules. It is proved that a DG-module $M$ over a local Cohen-Macaulay DG-ring with constant amplitude is Cohen-Macaulay if and only if $M$ is perfect and $\mathrm{amp}M \leq \mathrm{amp}\mathrm{R}\Gamma_{\bar{\mathfrak{m}}}(M)$. An affirmative answer is provided to Conjecture 2.11 of Yoshida [J. Pure Appl. Algebra 123 (1998) 313–326]. We also study the grade of DG-modules with finite injective dimension and examine the preservation of Cohen-Macaulayness under tensor products.
Read the full abstract

Group Theory

Hyperfocal subalgebras of hyperfocal abelian Frobenius blocks

In this paper, we introduce a class of blocks which is called hyperfocal abelian Frobenius blocks.This class of blocks is an analogous version of the block with abelian defect group and Frobenius inertial quotient at hyperfocal level and includes the blocks with Klein four hyperfocal subgroups and cyclic hyperfocal subgroups. We show that there is a stable equivalence of Morita type between the hyperfocal subalgebras of the hyperfocal abelian Frobenius blocks and a group algebra of a Frobenius group associated with the hyperfocal subgroup of the block. As applications, we can partially describe some structures of the blocks with Klein four hyperfocal subgroups and cyclic hyperfocal subgroups,such as the structures of their hyperfocal subalgebras in terms of derived categories and the structures of their characters. As a consequence, we show that Broue's abelian defect group conjecture holds for blocks with Klein four hyperfocal subgroups.
Read the full abstract

Dynamical Systems

Uniform Weighted Averages and a Conjecture of Bergelson, Moreira, and Richter

We confirm a conjecture posed by Bergelson, Moreira, and Richter (arXiv:1711.05729), and in particular show that for every probability measure preserving system $(X,\mathscr{B},\mu,T)$, every $k\in \mathbb{N}$, every set $A\in \mathscr{B}$ with $\mu(A)>0$, and every tempered function $f$, \[ \lim_{N\to\infty}\frac{1}{N}\sum_{n=1}^N\mu(A\cap T^{-\lfloor{f(n)\rfloor}}A\cap T^{-\lfloor{f(n+1)\rfloor}}A\cap \cdots \cap T^{-\lfloor{f(n+k)\rfloor}}A)>0. \] This is achieved by establishing conditions on an increasing function $W:\mathbb{N}\rightarrow (0,\infty)$ such that if $(x_n)_{n\in \mathbb{N}}$ is a bounded sequence in a Banach space with \[ \lim_{W(N)-W(M)\to\infty}\frac{1}{W(N)-W(M)}\sum_{n=M}^N (W(n)-W(n-1))x_n =L \] then the limit of Cesàro averages of $(x_n)_{n\in \mathbb{N}}$, $\lim_{N\to\infty}\frac{1}{N}\sum_{n=1}^Nx_n$ is also equal to $L$. Furthermore, the methods we develop can be used to sharpen some of the combinatorial results obtained by Bergelson, Moreira, and Richter. For example, if $E$ is a set of positive upper density, then for any $k\in \mathbb{N}$, any $\epsilon>0$, and all sufficiently large $N\in \mathbb{N}$ there is an $n\in [N-N^{1/2+\epsilon},N]$ such that \[\{a,a+\lfloor{n^{3/2}\rfloor},a+\lfloor{(n+1)^{3/2}\rfloor},\dots ,a +\lfloor{(n+k)^{3/2}\rfloor}\}\subseteq E. \]
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum circuit design from a retraction-based Riemannian optimization framework

Designing quantum circuits for ground state preparation is a fundamental task in quantum information science. However, standard Variational Quantum Algorithms (VQAs) are often constrained by limited ansatz expressivity and difficult optimization landscapes. To address these issues, we adopt a geometric perspective, formulating the problem as the minimization of an energy cost function directly over the unitary group. We establish a retraction-based Riemannian optimization framework for this setting, ensuring that all algorithmic procedures are implementable on quantum hardware. Within this framework, we unify existing randomized gradient approaches under a Riemannian Random Subspace Gradient Projection (RRSGP) method. While recent geometric approaches have predominantly focused on such first-order gradient descent techniques, efficient second-order methods remain unexplored. To bridge this gap, we derive explicit expressions for the Riemannian Hessian and show that it can be estimated directly on quantum hardware via parameter-shift rules. Building on this, we propose the Riemannian Random Subspace Newton (RRSN) method, a scalable second-order algorithm that constructs a Newton system from measurement data. Numerical simulations indicate that RRSN achieves quadratic convergence, yielding high-precision ground states in significantly fewer iterations compared to both existing first-order approaches and standard VQA baselines. Ultimately, this work provides a systematic foundation for applying a broader class of efficient Riemannian algorithms to quantum circuit design.
Read the full abstract

All authors Zhijian Lai, Hantao Nie, Jiayuan Wu, Dong An

Information Theory

Efficient Solvers for Coupling-Aware Beamforming in Continuous Aperture Arrays

In continuous aperture arrays (CAPAs), careful consideration of the underlying physics is essential, among which electromagnetic (EM) mutual coupling plays a critical role in beamforming performance. Building on a physically consistent mutual coupling model, the beamforming design is formulated as a functional optimization whose optimality condition leads to a Fredholm integral equation. The incorporation of the coupling model, however, substantially increases computational complexity, necessitating efficient and accurate integral equation solvers. In this letter, we propose two efficient solvers: 1) a coordinate-transformation-based kernel approximation that preserves the operator structure while alleviating discretization demands, and 2) a direct lower-upper (LU)-based solver that stably handles the Nyström-discretized system. Numerical results demonstrate improved accuracy and reduced computational overhead compared to conventional methods, with the LU-based solver emerging as an efficient and scalable solution for large-scale CAPA optimization via offline factorization.
Read the full abstract

All authors Geonhee Lee, Kwonyeol Park, Hyeongjun Park, Jinwoo An, Junil Choi

Operator Algebras

A note on purely infinite corona algebras and extensions

Let $\mathcal{A}$ be a separable nuclear C*-algebra, and $\mathcal{B}$ be a nonunital separable simple $\mathcal{Z}$-stable C*-algebra. Continuing the work from Gabe-Lin-Ng, we classify all essential extensions, with large complement, of the form $$0 \rightarrow \mathcal{B} \rightarrow \mathcal{E} \rightarrow \mathcal{A} \rightarrow 0,$$ for the following cases: i. $\mathcal{C}(\mathcal{B})$ is properly infinite, and the extension is full. ii. $\mathcal{C}(\mathcal{B})$ is purely infinite (though not necessarily simple). We also have some more general results.
Read the full abstract

Dynamical Systems

Continuity of Julia sets and invariant rays

For certain typical perturbations $(f_n)_n$ of a rational map $f$ with parabolic cycles, we investigate the relations between the Hausdorff convergence of Julia sets and invariant rays, and the horocyclic convergence of multipliers of periodic points. We establish several equivalent characterizations by means of parabolic implosion theory. This builds upon an analysis of the edge dynamics on the tree for the gate structure induced by the perturbation. The edge dynamics which are driven by Oudkerk's algorithm, are used to trace the orbits for the near parabolic perturbations.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets

We study online maximization of non-monotone Diminishing-Return(DR)-submodular functions over down-closed convex sets, a regime where existing projection-free online methods suffer from suboptimal regret and limited feedback guarantees. Our main contribution is a new structural result showing that this class is $1/e$-linearizable under carefully designed exponential reparametrization, scaling parameter, and surrogate potential, enabling a reduction to online linear optimization. As a result, we obtain $O(T^{1/2})$ static regret with a single gradient query per round and unlock adaptive and dynamic regret guarantees, together with improved rates under semi-bandit, bandit, and zeroth-order feedback. Across all feedback models, our bounds strictly improve the state of the art.
Read the full abstract

All authors Yiyang Lu, Haresh Jadav, Mohammad Pedramfar, Ranveer Singh, Vaneet Aggarwal

Statistics Theory · Cross-listed from stat.ME

Local Fréchet regression with toroidal predictors

We provide the first regression framework that simultaneously accommodates responses taking values in a general metric space and predictors lying on a general torus. We propose intrinsic local constant and local linear estimators that respect the underlying geometries of both the response and predictor spaces. Our local linear estimator is novel even in the case of scalar responses. We further establish their asymptotic properties, including consistency and convergence rates. Simulation studies, together with an application to real data, illustrate the superior performance of the proposed methodology.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs

Push-Sum-based decentralized learning enables optimization over directed communication networks, where information exchange may be asymmetric. While convergence properties of such methods are well understood, their finite-iteration stability and generalization behavior remain unclear due to structural bias induced by column-stochastic mixing and asymmetric error propagation. In this work, we develop a unified uniform-stability framework for the Stochastic Gradient Push (SGP) algorithm that captures the effect of directed topology. A key technical ingredient is an imbalance-aware consistency bound for Push-Sum, which controls consensus deviation through two quantities: the stationary distribution imbalance parameter $\delta$ and the spectral gap $(1-\lambda)$ governing mixing speed. This decomposition enables us to disentangle statistical effects from topology-induced bias. We establish finite-iteration stability and optimization guarantees for both convex objectives and non-convex objectives satisfying the Polyak–Łojasiewicz condition. For convex problems, SGP attains excess generalization error of order $\tilde{\mathcal{O}}\!\left(\frac{1}{\sqrt{mn}}+\frac{\gamma}{\delta(1-\lambda)}+\gamma\right)$ under step-size schedules, and we characterize the corresponding optimal early stopping time that minimizes this bound. For PŁ objectives, we obtain convex-like optimization and generalization rates with dominant dependence proportional to $\kappa\!\left(1+\frac{1}{\delta(1-\lambda)}\right)$, revealing a multiplicative coupling between problem conditioning and directed communication topology. Our analysis clarifies when Push-Sum correction is necessary compared with standard decentralized SGD and quantifies how imbalance and mixing jointly shape the best attainable learning performance.
Read the full abstract

All authors Yifei Liang, Yan Sun, Xiaochun Cao, Li Shen

Information Theory · Cross-listed from eess.SP

On Channel Estimation for Group-Connected Beyond Diagonal RIS Assisted Multi-User MIMO Communication

Beyond diagonal reconfigurable intelligent surface (BD-RIS) architectures offer superior beamforming gain over conventional diagonal RISs. However, the channel estimation overhead is the main hurdle for reaping the above gain in practice. This letter addresses this issue for group-connected BDRIS aided uplink communication from multiple multi-antenna users to one multi-antenna base station (BS). We first reveal that within each BD-RIS group, the cascaded channel associated with one user antenna and one BD-RIS element is a scaled version of that associated with any other user antenna and BD-RIS element due to the common RIS-BS channel. This insight drastically reduces the dimensionality of the channel estimation problem. Building on this property, we propose an efficient two-phase channel estimation protocol. In the first phase, the reference cascaded channels for all groups are estimated in parallel based on common received signals while determining the scaling coefficients for a single reference antenna. In the second phase, the scaling coefficients for all remaining user antennas are estimated. Numerical results demonstrate that our proposed framework achieves substantially lower estimation error with fewer pilot signals compared to state-of-the-art benchmark schemes.
Read the full abstract

All authors Rui Wang, Junyuan Gao, Shuowen Zhang, Bruno Clerckx, Liang Liu

Information Theory · Cross-listed from stat.ML

Standard Transformers Achieve the Minimax Rate in Nonparametric Regression with $C^{s,\lambda}$ Targets

The tremendous success of Transformer models in fields such as large language models and computer vision necessitates a rigorous theoretical investigation. To the best of our knowledge, this paper is the first work proving that standard Transformers can approximate Hölder functions $ C^{s,\lambda}\left([0,1]^{d\times n}\right) $$ (s\in\mathbb{N}_{\geq0},0<\lambda\leq1) $ under the $L^t$ distance ($t \in [1, \infty]$) with arbitrary precision. Building upon this approximation result, we demonstrate that standard Transformers achieve the minimax optimal rate in nonparametric regression for Hölder target functions. It is worth mentioning that, by introducing two metrics: the size tuple and the dimension vector, we provide a fine-grained characterization of Transformer structures, which facilitates future research on the generalization and optimization errors of Transformers with different structures. As intermediate results, we also derive the upper bounds for the Lipschitz constant of standard Transformers and their memorization capacity, which may be of independent interest. These findings provide theoretical justification for the powerful capabilities of Transformer models.
Read the full abstract

Analysis of PDEs

Solutions with one dimensional concentration for a two dimensional Gross-Pitaevskii model with general potential

We concern standing wave solutions with frequency $\lambda$ to a two dimensional Gross-Pitaevskii equation with a trap potential under the unit mass constraint, which is used to describe Bose-Einstein condensates with attractive interaction. First, we investigate the necessary conditions for existence of the solutions with concentration phenomena directed along closed smooth curves. Next, not only imposing stationary and non-degeneracy conditions on the curves with respect to an auxiliary weighted length involving the trap potential, but also adding some other technical assumptions, we select a sequence $\{\lambda_j\}$ of the frequency $\lambda$ with $-\lambda_j\rightarrow +\infty$ and construct solutions with concentration directed along the curves. Our result partially answers the conjecture raised in [A. Ambrosetti, A. Malchiodi, W.-M. Ni, Comm. Math. Phys. 2003] about necessary condition for solution concentrating at submanifolds. The solutions constructed in this paper are concentrating on curves whose length are non-uniformly bounded, and hence the situation is quite different from that in [M. del Pino, M. Kowalczyk, J. Wei, Comm. Pure Appl. Math. 2007].
Read the full abstract

Optimization and Control

Stochastic Control Problems with Infinite Horizon and Regime Switching Arising in Optimal Liquidation with Semimartingale Strategies

We study an optimal control problem on infinite time horizon with semimartingale strategies, random coefficients and regime switching. The value function and the optimal strategy can be characterized in terms of three systems of backward stochastic differential equations (BSDEs) with infinite horizon. One of them is a system of linear BSDEs with unbounded coefficients and infinite horizon, which seems to be new in literature. We establish the existence of the solutions to these BSDEs by BMO analysis and comparison theorem for multi-dimensional BSDEs. Next, we establish that the optimal control problem is well posed, in the sense that the value function is finite and the optimal strategy-when it exists-is unique. This is achieved by reformulating the cost functional as the sum of a quadratic functional and the candidate value function. The reformulation crucially relies on the well-established well-posedness results for systems of BSDEs. Finally, under additional assumptions, we obtain the unique optimal strategy.
Read the full abstract

Differential Geometry

Optimal inequalities involving Casorati curvatures along Riemannian maps and Riemannian submersions for quaternionic space form

In this paper, we establish Casorati inequalities for Riemannian maps and Riemannian submersions involving quaternionic space forms, and we provide geometric characterisations of their equality cases. First, we derive Casorati inequalities for Riemannian maps to quaternionic space forms and describe the corresponding equality cases, showing that the leaves of the range space are invariantly quasi-umbilical, and that the associated shape operator matrix commutes. Next, we obtain Casorati inequalities involving the fundamental tensor fields $T$ and $A$ for Riemannian submersions from quaternionic space forms onto Riemannian manifolds, together with their geometric interpretations. In particular, we prove that the equality case corresponding to the tensor field $A$ along the horizontal distribution is equivalent to the integrability of the horizontal distribution. Moreover, the equality case associated with the tensor field $T$ along the vertical distribution characterises fibres that are invariantly quasi-umbilical with a commuting shape operator matrix. Finally, the simultaneous equality cases involving both tensor fields $T$ and $A$ along the horizontal and vertical distributions imply the integrability of the horizontal distribution together with the invariantly quasi-umbilical nature of the fibres and the commutativity of the corresponding shape operators.
Read the full abstract

Combinatorics

Quantizing Pythagorean triples

We introduce a $q$-deformation of the Pythagoras equation $a^2 + b^2 = c^2$, which is a polynomial version of it different from the standard one. We construct a polynomial analogue, or “$q$-analogue”, of every primitive Pythagorean triple. We also construct such analogue for a larger class of Pythagorean triples called standard. Our approach is based on the notion of $q$-deformed rational numbers and the modular group $\mathrm{PSL}(2,\mathbb{Z})$.
Read the full abstract

Differential Geometry

Asymptotic geometric regularity of CAT(0) spaces

We prove that if an n-dimensional geodesically complete CAT(0) space has Tits boundary sufficiently close to the (n-1)-dimensional standard unit sphere, then it is bi-Lipschiz homeomorphic to the n-dimensional Euclidean space. As an application, we conclude that if an (n-1)-dimensional geodesically complete CAT(1) space is sufficiently close to the (n-1)-dimensional standard unit sphere, then they are bi-Lipschiz homeomorphic to each other.
Read the full abstract

Information Theory

Integer-Forcing Precoding: A Geometric Perspective and Low-Complexity Algorithm Design

The joint coefficient–scaling design of integer-forcing (IF) precoding couples a full-rank integer coefficient matrix with a positive diagonal scaling matrix, resulting in a mixed discrete–continuous optimization problem. We first distinguish the original full-rank formulation and its finite-field invertibility requirement from the unimodular restriction studied in the subsequent analysis. Under this restriction, we formulate coefficient selection as the unimodular minimum-sum basis problem (UMSBP). By parameterizing the scaling matrix with its normalized diagonal vector, we define a deterministic exact single-output UMSBP oracle whose preimages partition the scaling manifold into disjoint coefficient-labelled regions. The restricted objective is consequently represented as the lower envelope of fixed-coefficient quadratic functions. Based on this formulation, we derive an exact decomposition into fixed-coefficient scaling optimization, coefficient-consistency verification, cross-region exploration, and candidate comparison. We prove that exact UMSBP evaluation is NP-hard through a polynomial-time reduction from exact Euclidean CVP. For a fixed coefficient matrix, we derive an equivalent convex formulation, its normalized stationarity condition, and a matrix-balancing interpretation. Under the stated positivity and finite-projective-diameter condition
Read the full abstract

All authors Junren Qin, Fan Jiang, Tao Yang, Shanxiang Lyu, Rongke Liu, Shi Jin

Analysis of PDEs

The singularity at degenerate points in steady axisymmetric compressible free surface flows with gravity

In this paper, we analyze the singular shape of the free boundary at degenerate points in a three dimensional axisymmetric compressible gravity flow. For all possible degenerate points on the free surface, we prove that the only nontrivial asymptotic behavior of the free surface at the stagnation points away from the axis of symmetry is the Stokes corner flow. The possible geometries for free boundaries at the non-stagnation axis points are downward pointing or upward pointing cusps. At the origin, there are only two nontrivial asymptotics possible: the Garabedian's pointed bubble or a horizontal flat surface. The problem is associated with the analysis of the degenerate points of a quasilinear free boundary problem of the Bernoulli type, and the main obstacles are the absence of a Weiss-type monotonicity formula. To achieve our goal, we establish for the first time monotonicity formulas for quasilinear Bernoulli type free boundary problems. Our formula works both when the equation becomes singular and when the free boundary condition is degenerate. Moreover, we establish a new nonlinear frequency formula at the horizontal flat points at the origin and integrate it with the compensated compactness theory for Euler equations, ensuring the strong convergence of variational solutions. Our results resolve the Stokes conjecture [Mathematical and Physical Papers, Vol. I., 1880] in a generalized compressible, three dimensional axisymmetric framework. In addition, it can also be realized as a compressible counterpart to Vǎrvǎrucǎ and Weiss [Comm. Pure Appl. Math., (67), 2014]. Our approach is completely new and gives a systematic approach for studying singularities of a singular Bernoulli type quasilinear free boundary problem.
Read the full abstract