Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Saturday 28 March

Optimization and Control

Adjoint Matching through the Lens of the Stochastic Maximum Principle in Optimal Control

Reward fine-tuning of diffusion and flow models and sampling from tilted or Boltzmann distributions can both be formulated as stochastic optimal control (SOC) problems, where learning an optimal generative dynamics corresponds to optimizing a control under SDE constraints. In this work, we revisit and generalize Adjoint Matching, a recently proposed SOC-based method for learning optimal controls, and place it on a rigorous footing by deriving it from the Stochastic Maximum Principle (SMP). We formulate a general Hamiltonian adjoint matching objective for SOC problems with control-dependent drift and diffusion and convex running costs, and show that its expected value has the same first variation as the original SOC objective. As a consequence, critical points satisfy the Hamilton–Jacobi–Bellman (HJB) stationarity conditions. In the important practical case of state- and control-independent diffusion, we recover the lean adjoint matching loss previously introduced, which avoids second-order terms and whose critical points coincide with the optimal control under mild uniqueness assumptions. Numerical experiments confirm that the extra terms it discards become necessary once the diffusion is state-dependent. Finally, we show that adjoint matching can be precisely interpreted as a continuous-time method of successive approximations induced by the SMP, yielding a practical and implementable alternative to classical SMP-based algorithms, which are obstructed by intractable martingale terms in the stochastic setting. These results are also of independent interest to the stochastic control community, providing new implementable objectives and a viable pathway for SMP-based iterations in stochastic problems.
Read the full abstract

Dynamical Systems

A view towards mixing in holomorphic correspondences

In this manuscript we develop a theory of mixing and weakly mixing in the study of dynamics of holomorphic correspondences defined on a compact connected complex manifold. We also connect these notions to the theory of ergodicity of holomorphic correspondences developed by Londhe. Further, we give motivation and illustrative examples that compare the present scenario with that of maps. Finally, we study product of two holomorphic correspondences and use them to characterise weakly mixing.
Read the full abstract

General Mathematics

From Vieta to Chebyshev: A Unified Trigonometric Census of Polynomial Roots

This article gives a trigonometric method for counting how many roots of a polynomial are real and how many are complex, without solving the equation. For a depressed polynomial $P(t) = t^d + c_{d-2}t^{d-2} + \cdots + c_1 t + c_0$ of degree~$d$ with $c_{d-2} < 0$ (the case $c_{d-2}\geq 0$ is discussed briefly in Section~\ref{sec:cgeq0} but not resolved), the substitution $t = u\cos\theta$, $u = 2\sqrt{-c_{d-2}/d}$, matches $P$ against the Chebyshev identity $T_d(\cos\theta) = \cos d\theta$ and reduces the classification problem to a single trigonometric equation $f(\theta) = \sum_{k=1}^{d-3}\alpha_k\cos^k\!\theta + \cos d\theta + \delta = 0$ on $[0,\pi]$. A bijection between the zeros of~$f$ and the roots of~$P$ in $[-u,u]$ gives an exact interior root count. For roots outside $[-u,u]$, a universal lemma based on the positivity of~$P^{(d-2)}$ gives an exact parity and an upper bound of $d-2$ roots per half-line; combined with the interior count, this pins down the total number of real roots exactly whenever at most one root lies on each exterior half-line, a condition we prove for the cubic, verify computationally throughout our examples, but show by an explicit quartic counterexample to fail in general for $d\geq 4$ (Remark~\ref{rem:counterexample}). We also compare the method's cost to Sturm's theorem (Section~\ref{sec:complexity}): it is not asymptotically cheaper, but avoids the coefficient blow-up of the Euclidean algorithm and applies via one uniform template to every degree $d\geq 4$, with the classical Vieta cubic ($d=3$) as the degenerate base case. The derivation is conceptually simple, unifying and extending the quartic and quintic analyses developed individually in earlier work.
Read the full abstract

General Mathematics

Analytical continuation of Euler prime product for $\Re(s)>\tfrac{1}{2}$ assuming (RH)

We analytically continue the Euler prime product for $\Re(s)>\tfrac{1}{2}$ (except for its pole $s=1$) assuming (RH) by introducing a new factor to the Euler product. We also discuss how to recover the Mertens's 3rd Theorem at $s=1$ case, and how to apply the same technique to analytically continue other similar Euler products. In the last part, we also construct a simple script in Pari/GP to compute the Euler product and verify the calculations numerically.
Read the full abstract

Complex Variables

Sharp Landau-Type Theorems and Schlicht Disc Radii for certain Subclasses of Harmonic Mappings

Let $\mathcal{H}$ be the class of all complex-valued harmonic mappings $f=h+\overline{g}$ defined on the unit disc $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $h(0)=0=h'(0)-1$, here $h$ and $g$ are analytic functions in $\mathbb{D}$. In this paper, we investigates Landau-type theorems for several significant subclasses of sense-preserving harmonic mappings. Specifically, we establish sharp Landau-type theorems for the class $\mathcal{P}_{\mathcal{H}}^{0}(M)$ and the parameterized class $\mathcal{W}_{\mathcal{H}}^{0}(\alpha)$ for $\alpha \ge 0$. For mappings in $\mathcal{W}_{\mathcal{H}}^{0}(\alpha)$, we derive the radii of univalence and the radii of the largest schlicht discs contained in the images of the unit disc, expressing these results in terms of the Lerch Transcendent function $\Phi(z,s,a)$ and the Dilogarithm function ${\rm Li}_2(z)$. The sharpness of the obtained radii is demonstrated by constructing appropriate extremal functions for each class. These results generalize and extend various known Landau-type theorems in the theory of harmonic mappings.
Read the full abstract

Group Theory

Ascending Chains in 3-Manifold and Relatively Hyperbolic Groups

We prove that any ascending chain of bounded rank subgroups in the fundamental group of a compact $3$-manifold stabilizes. We use geometrization to reduce the proof to fundamental groups of complete, finite-volume hyperbolic $3$-manifolds. To handle this case, we prove the following: In a toral relatively hyperbolic group, any ascending chain of bounded rank, locally relatively quasiconvex subgroups stabilizes. We note this theorem is new even for bounded rank, locally quasiconvex chains in hyperbolic groups.
Read the full abstract

All authors Edgar A. Bering IV, Jakob Heikamp, Jack Kohav, Nir Lazarovich, Zachary Munro

Mathematical Physics

The Full Set of KMS-States for Abelian Kitaev Models

We first prove that the subalgebra $\mathcal{C}$ generated by the vertex and face operators of an abelian Kitaev model is a $C^\ast$-diagonal of the UHF algebra $\mathcal{A}$ of quasilocal observables. This gives us access to the Weyl groupoid $\mathcal{G}_\mathcal{C}$ associated with the $C^\ast$-inclusion $\mathcal{C} \hookrightarrow \mathcal{A}$, which supplies a valuable presentation of $\mathcal{A}$ as a groupoid $C^\ast$-algebra where the dynamics of the model are generated by a groupoid 1-cocycle $c_H$. Making appeal to the notion of $(c_H,\beta)$-KMS measures for this groupoid, we identify the full set of KMS states of the model and prove its uniqueness for $\beta \in [0,\infty)$. Furthermore, we show that its limit at $\beta \rightarrow \infty$ exists and coincides with the unique frustration-free ground state of the model.
Read the full abstract

Combinatorics

Bounds on median eigenvalues of graphs of bounded degree

We prove that for every integer $d \ge 3$, the median eigenvalues of any graph of maximum degree $d$ are bounded above by $\sqrt{d-1}$. We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree $d$ are bounded below by $-\sqrt{d-1}$: when the graph is triangle-free, when $d-1$ is a perfect square, or when $d \ge 75$. These results resolve, for all but finitely many values of $d$, an open problem of Mohar on median eigenvalues of graphs of maximum degree $d$. As a byproduct, we establish an upper bound on the average energy of graphs of maximum degree at most $d$, generalizing a previous result of van Dam, Haemers, and Koolen for $d$-regular graphs.
Read the full abstract

Probability

The $k$-cycle shuffling with repeated cards

We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle, including cutoff and explicit limiting profiles. For fixed $l$, we show that the walk exhibits cutoff at time $\frac{n}{k}\log n$ with window of order $\frac{n}{k}$, and we identify the limiting profile in terms of the total variation distance between Poisson distributions arising from quotient fixed-point statistics. When $l\to\infty$ with sufficiently slow growth, more precisely when $l=o(\log n)$, we prove that the cutoff location shifts to $\frac{n}{k}\left(\log n-\frac 12\log l\right)$, again with window of order $\frac{n}{k}$, and that the limiting profile is asymptotically Gaussian, arising from a Poisson comparison after normal approximation. The proof is based on an approximation of the shuffling measure by an explicitly tractable auxiliary measure, generalizing the $k=2$ case from Jain and Sawhney (arXiv:2410.23944). The representation-theoretic framework underlying the analysis of this auxiliary measure follows from the work of Hough (arXiv:1605.00911) and Nestoridi and Olesker-Taylor (arXiv:2005.13437)
Read the full abstract

Information Theory · Cross-listed from cs.LG

The Geometric Cost of Normalization: Affine Bounds on the Bayesian Complexity of Neural Networks

LayerNorm and RMSNorm impose fundamentally different geometric constraints on their outputs - and this difference has a precise, quantifiable consequence for model complexity. We prove that LayerNorm's mean-centering step, by confining data to a linear hyperplane (through the origin), reduces the Local Learning Coefficient (LLC) of the subsequent weight matrix by exactly $m/2$ (where $m$ is its output dimension); RMSNorm's projection onto a sphere preserves the LLC entirely. This reduction is structurally guaranteed before any training begins, determined by data manifold geometry alone. The underlying condition is a geometric threshold: for the codimension-one manifolds we study, the LLC drop is binary – any non-zero curvature, regardless of sign or magnitude, is sufficient to preserve the LLC, while only affinely flat manifolds cause the drop. At finite sample sizes this threshold acquires a smooth crossover whose width depends on how much of the data distribution actually experiences the curvature, not merely on whether curvature exists somewhere. We verify both predictions experimentally with controlled single-layer scaling experiments using the wrLLC framework. We further show that Softmax simplex data introduces a "smuggled bias" that activates the same $m/2$ LLC drop when paired with an explicit downstream bias, proved via the affine symmetry extension of the main theorem and confirmed empirically.
Read the full abstract

Algebraic Geometry

Galois subspaces for compact Riemann surfaces of genus 2

Let $X$ be a compact Riemann surface of genus 2 and $D$ a very ample divisor with $\phi_D$ its associated embedding into $\mathbb{P}^{n}$. We consider the set $G_{X,D}$ of linear subspaces $W$ of $\mathbb{P}^n$ of codimension $2$ with projection $\pi_W$ such that $f_W = \pi_W \circ \phi_D$ is Galois, i.e. $f_W^*k(\mathbb{P}^1) \subseteq k(X)$ is a Galois extension. It is known that $G_{X,D}$ is isomorphic to a disjoint union of projective spaces. In this article, we calculate the dimension of projective spaces in the decomposition of $G_{X,D}$, when $D$ is induced by a subgroup of $\mathrm{Aut}(X)$.
Read the full abstract

Combinatorics

Some properties of Padovan matrices and bi-periodic Padovan matrices

Let $\left(P_{n}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan numbers and let $\left(M_{p_{n}}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan matrices. In this article we study when these matrices are diagonalizable and we obtain a certain connection with the Lucas number sequence. We also obtain some connections of these matrices with the generating matrix $Q$ for the Padovan numbers.
Read the full abstract

Dynamical Systems

Conditions for uniform $h$–dichotomy in terms of uniform non criticality, expansiveness and via generalized Floquet theory

In this article, we complete the study of the equivalences between the properties of $h$–dichotomy, $h$–noncriticality and $h$–expansiveness of a linear nonautonomous ODE system which had been initiated in a previous work. Moreover, we extend a result of the generalized Floquet theory developed by T.A. Burton and J.S. Muldowney by providing a necessary and sufficient condition for $h$–dichotomy. It should be noted that all the results have been obtained by using a characterization of the $h$–dichotomy by a group theory approach recently developed by J.F. Peña and S. Rivera–Villagrán.
Read the full abstract

Combinatorics

Largest $2$-regular Subgraphs in complete $S$-partite Graphs

In this paper, we focus on the class of complete $S$-partite graphs, for $S$ an undirected graph possibly with self-loops, and address the problem of finding largest $2$-regular subgraphs of these graphs, which can be formulated as an integer linear program. Roughly speaking, a complete $S$-partite graph is obtained by replacing every single node of $S$ with a number of nodes, preserving the edge/non-edge relations of $S$. Our motivation in finding largest $2$-regular subgraphs is rooted in the structural systems theory, particularly in the problem of finding largest subnetworks that can sustain controllability or asymptotic stability of the corresponding subsystems. A main contribution of the paper is to show that the integer linear problem can be solved efficiently in $O(|V(S)|^3)$, independent of the order/size of the $S$-partite graph itself. Furthermore, we demonstrate through simulations that with high probability, a random $S$-partite graph contains a largest $2$-regular subgraph of the same order as its complete counterpart does.
Read the full abstract

Numerical Analysis

Error analysis of an asymptotic-preserving, energy-stable finite volume method for barotropic Euler equations

We propose and analyse an energy-stable and asymptotic-preserving finite volume scheme for the compressible Euler system. Using the relative energy framework, we establish rigorous error estimates that yield convergence of the numerical solutions in two distinct regimes. For a fixed Mach number $\varepsilon>0$, we derive error estimates between the numerical solutions and a strong solution of the compressible Euler system that are uniform with respect to the discretisation parameters, ensuring convergence as the underlying mesh is refined. In the low Mach number regime, we analyse the error between the numerical solutions and a strong solution of the incompressible Euler system and obtain asymptotic error estimates that are uniform in $\varepsilon$ and the discretisation parameters. These results imply convergence of the numerical solutions toward a strong solution of the incompressible Euler system as $\varepsilon$, and the discretisation parameters simultaneously tend to zero. Numerical experiments are presented to validate the theoretical analysis.
Read the full abstract

All authors Megala Anandan, K.R. Arun, Amogh Krishnamurthy, Mária Lukáčová-Medvid'ová

Statistics Theory

Multiple-Prediction-Powered Inference

Statistical estimation often involves tradeoffs between expensive, high-quality measurements and a variety of lower-quality proxies. We introduce Multiple-Prediction-Powered Inference (MultiPPI): a general framework for constructing statistically efficient estimates by optimally allocating resources across these diverse data sources. This work provides theoretical guarantees about the minimax optimality, finite-sample performance, and asymptotic normality of the MultiPPI estimator. Through experiments across three diverse large language model (LLM) evaluation scenarios, we show that MultiPPI consistently achieves lower estimation error than existing baselines. This advantage stems from its budget-adaptive allocation strategy, which strategically combines subsets of models by learning their complex cost and correlation structures.
Read the full abstract

All authors Charlie Cowen-Breen, Alekh Agarwal, Stephen Bates, William W. Cohen, Jacob Eisenstein, Amir Globerson, Adam Fisch

Number Theory

NP-hardness of SVP in Euclidean Space

In 1981, van Emde Boas conjectured that computing a shortest non-zero vector of a lattice in a Euclidean space is $\mathbf{NP}$-hard. In this paper, we prove this conjecture, thereby derandomizing Ajtai's classical randomized hardness result (1998). We follow the derandomization program formulated by Micciancio (1998–2014) who conjectured the existence of an efficient deterministic construction of locally dense lattices. The key is to resolve this conjecture. Our proof builds on the candidate construction via Reed-Solomon codes by Bennett and Peikert (2023), and depends crucially on Deligne's work on the Weil conjectures for higher-dimensional varieties over finite fields.
Read the full abstract

Dynamical Systems

Topological Detection of Hopf Bifurcations via Persistent Homology: A Functional Criterion from Time Series

We propose a topological framework for detecting Hopf-type dynamical transitions directly from scalar time series. The method combines delay-coordinate reconstruction with persistent homology and uses the maximum persistence of one-dimensional homology classes as a scalar descriptor of cyclic structure. For the supercritical Hopf setting, we derive finite-resolution persistence bounds that relate detectability of the reconstructed periodic orbit to its geometry, sampling quality, and finite-data perturbations. A derivative-based estimator is then introduced to localize the critical parameter from the sampled topological functional. The approach is evaluated on the Hopf normal form, the Lorenz system, and a reduced Belousov–Zhabotinsky model. The numerical experiments show accurate finite-resolution localization of the corresponding transitions and illustrate the effects of embedding parameters, temporal sampling, smoothing, observational noise, and transient removal. These results support persistent homology as an interpretable data-driven tool for detecting geometric reorganizations in nonlinear time series.
Read the full abstract

Numerical Analysis

On Well-posedness of a Nonstationary Stokes Hemivariational Inequality

This paper is devoted to the well-posedness analysis of a nonstationary Stokes hemivariational inequality for an incompressible fluid flow described by the Stokes equations subject to a nonsmooth boundary condition of friction type described by the Clarke subdifferential. In a recent paper [19], well-posedness of the nonstationary Stokes hemivariational inequality is studied for both the velocity and pressure fields. The solution existence is shown through a limiting procedure based on temporally semi-discrete approximations for both the velocity and pressure fields. In this paper, a refined well-posedness analysis is provided on the nonstationary Stokes hemivariational inequality under more natural assumptions on the problem data. The solution existence is first shown for the velocity field through a limiting procedure based on temporally semi-discrete approximations of a reduced problem and then the pressure field is recovered with the help of an inf-sup property. In this way, assumptions on the source term and the initial velocity needed in [19] are weakened, and a compatibility condition on initial values of the data is dropped. Moreover, several hemivariational inequalities are introduced for the mathematical model and their equivalence is explored.
Read the full abstract

Optimization and Control

Dynamic Constrained Stabilization on the n-sphere (Extended version)

We consider the constrained stabilization problem of second-order systems evolving on the n-sphere. We propose a control strategy with a constraint proximity-based dynamic damping mechanism that ensures safe and almost global asymptotic stabilization of the target point in the presence of star-shaped constraints on the n-sphere. It is also shown that the proposed approach can be used to deal with constrained rigid-body attitude stabilization. The effectiveness of our approach is demonstrated through simulation results on the 2-sphere and the 3-sphere in the presence of star-shaped constraint sets.
Read the full abstract

Analysis of PDEs

Strongly Singular Nonlocal Kirchhoff-Type Equations with Variable Exponents: Existence, Regularity, and Renormalized Solutions

This work resolves the open problem of strong singularity ($\alpha(z)> 1$) in nonlocal Kirchhoff-type equations with variable exponents through five original theorems that collectively establish a comprehensive theory. Beginning with weighted Sobolev spaces and existence via truncation, we develop comparison principles, optimal regularity results, and when classical solutions cease to exist, the construction of renormalized solutions. Building upon these foundations, we establish three advanced results: optimal convergence of truncated sequences to renormalized solutions, refined energy estimates characterizing asymptotic behavior as the truncation parameter vanishes, and a quantitative comparison principle yielding sharp pointwise bounds. Subsequently, we derive sharp two-sided pointwise estimates, a uniqueness theorem with quantitative stability, and Lipschitz continuous dependence of solutions on parameters and boundary data. Each theorem is supported by rigorous proofs employing nonlinear analysis, variational methods, and elliptic regularity theory. A computational illustration visualizes the solution behavior near the boundary and demonstrates convergence of truncated approximations.
Read the full abstract

Optimization and Control

Multidimensional Gradient-MUSIC: A Global Nonconvex Optimization Framework for Optimal Resolution

We develop a multidimensional version of Gradient-MUSIC for estimating the frequencies of a nonharmonic signal from noisy samples. The guiding principle is that frequency recovery should be based only on the signal subspace determined by the data. From this viewpoint, the MUSIC functional is an economical nonconvex objective encoding the relevant information, and the problem becomes one of understanding the geometry of its perturbed landscape. Our main contribution is a general structural theory showing that, under explicit conditions on the measurement kernel and the perturbation of the signal subspace, the perturbed MUSIC function is an admissible optimization landscape: suitable initial points can be found efficiently by coarse thresholding, gradient descent converges to the relevant local minima, and these minima obey quantitative error bounds. Thus the theory is not merely existential; it provides a constructive global optimization framework for multidimensional optimal resolution. We verify the abstract conditions in detail for two canonical sampling geometries: discrete samples on a cube and continuous samples on a ball. In both cases we obtain uniform, nonasymptotic recovery guarantees under deterministic as well as stochastic noise. In particular, for lattice samples in a cube of side length $4m$, if the true frequencies are separated by at least $\beta_d/m$ and the noise has $\ell^\infty$ norm at most $\varepsilon$, then Gradient-MUSIC recovers the frequencies with error at most \[ C_d \frac{\varepsilon}{m}, \] where $C_d, \beta_d>0$ depend only on the dimension. This scaling is minimax optimal in $m$ and $\varepsilon$. Under stationary Gaussian noise, the error improves to \[ C_d\frac{\sigma\sqrt{\log(m)}}{m^{1+d/2}}. \] This is the noisy super-resolution scaling: (see paper for rest of abstract)
Read the full abstract

Operator Algebras

Semi-Cosimplicial Hilbert Spaces with Isometric Coface Operators

Semi-cosimplicial objects in the category of Hilbert spaces with isometries which are motivated by non-commutative probability theory, in particular by the distributional symmetry of spreadability, are introduced and systematically developed in various directions: partial shifts, cohomology, Hessenberg form, a related graph, decomposition into labeled subspaces, representation theory of the infinite symmetric and braid groups, classification and extensions for semi-cosimplicial sets with injective coface maps and a toy version of spreadability.
Read the full abstract

Optimization and Control

The Risk Quadrangle in Optimization: An Overview with Recent Results and Extensions

This paper revisits and extends the 2013 development by Rockafellar and Uryasev of the Risk Quadrangle (RQ) as a unified scheme for integrating risk management, optimization, and statistical estimation. The RQ features four stochastics-oriented functionals – risk, deviation, regret, and error, along with an associated statistic, and articulates their revealing and in some ways surprising interrelationships and dualizations. Additions to the RQ framework that have come to light since 2013 are reviewed in a synthesis focused on both theoretical advancements and practical applications. New quadrangles – superquantile, superquantile norm, expectile, biased mean, quantile symmetric average union, and $\varphi$-divergence-based quadrangles – offer novel approaches to risk-sensitive decision-making across various fields such as machine learning, statistics, finance, and PDE-constrained optimization. The theoretical contribution comes in axioms for “subregularity” relaxing “regularity” of the quadrangle functionals, which is too restrictive for some applications. The main RQ theorems and connections are revisited and rigorously extended to this more ample framework. Examples are provided in portfolio optimization, regression, and classification, demonstrating the advantages and the role played by duality, especially in ties to robust optimization and generalized stochastic divergences.
Read the full abstract

All authors Bogdan Grechuk, Anton Malandii, Terry Rockafellar, Stan Uryasev

Optimization and Control

Size-Selective Threshold Harvesting under Nonlocal Crowding and Exogenous Recruitment

We propose a nonlinear size-structured fishery model for externally recruited stocks under size-selective harvesting. The population density satisfies a McKendrick–von Foerster transport equation in which growth and natural mortality depend on a nonlocal crowding index, while harvesting acts as a bounded size-dependent mortality control. Unlike standard self-recruiting formulations, recruitment is prescribed as a lower-boundary inflow, making the model suitable for enhancement fisheries or analyses conditional on juvenile input. For the no-harvest baseline, we derive the stationary size profile and reduce the nonlinear equilibrium problem to a scalar closure equation, proving existence and uniqueness under a net monotonicity condition. We introduce an intrinsic replacement index and show why, in this externally forced setting, it is a viability diagnostic rather than a persistence threshold. A formal state–adjoint system yields a bang–bang switching rule; under weak coupling and single crossing, the optimal policy has a threshold structure. Numerical experiments validate the approximation and sensitivity trends
Read the full abstract

Geometric Topology

Perron's method and spherical ideal circle patterns with prescribed total geodesic curvatures

In this paper, we apply the classical Perron method to give a proof of the existence and uniqueness/rigidity result of a circle pattern on a closed surface equipped with conical spherical metric when prescribed measures of the angles of intersecting circles stay in the range (0,{\pi}/2] and total geodesic curvatures are assigned to the circles, which is recently obtained in [3] via Colin de Verdière's variation method. Then we show the convergence of Thurston's algorithm, which adjusts the geodesic curvatures of circles one by one based on the prescribed values for total geodesic curvatures of the circles, to the desired circle pattern in the setting of the result.
Read the full abstract

All authors Lishan Li, Jun Hu, Yi Qi, Yu Sun

Dynamical Systems

From pseudo-Anosov flows on graph manifolds to totally periodic flows

We show that every pseudo-Anosov flow on a graph manifold is almost equivalent, i.e. orbit equivalent in the complement of a finite collection of closed orbits, to a totally periodic pseudo-Anosov flow or a suspension Anosov flow. The proof is via a hands-on construction of a partial Birkhoff section with genus one components that misses finitely many closed orbits. When combined with previous work of the author, this implies that every transitive Anosov flow on a graph manifold with orientable stable and unstable foliations is almost equivalent to a suspension Anosov flow.
Read the full abstract

Classical Analysis and ODEs

On parameter-dependent inhomogeneous boundary-value problems in Sobolev spaces

We study a wide class of linear inhomogeneous boundary-value problems for $r$th order ODE-systems depending on a parameter $\mu$ belonging to a general metric space $\mathcal M$. The solutions belong to the Sobolev spaces $(W^{n+r}_p)^m$, $n\in\mathbb{N}\cup\{0\}$, $m, r \in \mathbb{N}$, $1\leq p\leq \infty$. The boundary conditions are of a most general form $By=c$, where $B$ is an arbitrary continuous operator from $(W^{n+r}_p)^m$ to $\mathbb{C}^{rm}$. Thus, they may contain derivatives of the unknown vector function of integer and/or fractional orders $\geq r$. We find necessary and sufficient conditions for the continuity of solutions with respect to the parameter $\mu$. We also prove that the solutions of the original problems can be approximated in the space $(W^{n+r}_p)^m$ by solutions of ODE-systems with polynomial coefficients, right-hand sides of the equation, and multipoint boundary conditions, which are independent of the original problem's right-hand sides.
Read the full abstract

Information Theory

On Optimal Homogeneous-Metric Codes

The homogeneous metric can be viewed as a natural extension of the Hamming metric to finite chain rings. It distinguishes between three types of elements: zero, non-zero elements in the socle, and elements outside the socle. Since the Singleton bound is one of the most fundamental and widely studied bounds in classical coding theory, we investigate its analogue for codes over finite chain rings equipped with the homogeneous metric. We provide a complete characterization of Maximum Homogeneous Distance (MHD) codes, showing that MHD codes coincide with lifted MDS codes and are contained within the socle at low rank. Exceptions arise from exceptional MDS codes or single-parity-check codes. We then shift our focus to the Plotkin-type bound in the homogeneous metric and close an existing gap in the theory of constant homogeneous-weight codes by identifying those of minimal length.
Read the full abstract

General Topology

Continuity and openness of maps on locales by way of Galois adjunctions

We study four adjoint situations in pointfree topology that interchange images and preimages with closure and interior operators and establish with them a number of characterisations for meet-preserving maps, localic maps, open maps (in a broad sense) and open localic maps between locales. The principal and most attractive feature of these adjunctions is that they are all concerned with elementary ideas and basic concepts of localic topology: the use of the concrete language of sublocales and its technique simplifies the reasoning. We then revisit open localic maps in detail and present a new proof of Joyal-Tierney open mapping theorem. We end with a study of the interchange laws between preimages/images and closure/interior operators, making clear the similarities and differences with the classical realm.
Read the full abstract