Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 20 April

Statistics Theory

Horospherical Depth and Busemann Median on Hadamard Manifolds

\We introduce the horospherical depth, an intrinsic notion of statistical depth on Hadamard manifolds, and define the Busemann median as the set of its maximizers. The construction exploits the fact that the linear functionals appearing in Tukey's half-space depth are themselves limits of renormalized distance functions; on a Hadamard manifold the same limiting procedure produces Busemann functions, whose sublevel sets are horoballs, the intrinsic replacements for halfspaces. The resulting depth is parametrized by the visual boundary, is isometry-equivariant, and requires neither tangent-space linearization nor a chosen base point. For arbitrary Hadamard manifolds, we prove that the depth regions are nested and geodesically convex, that a centerpoint of depth at least $1/(d+1)$ exists, and hence that the Busemann median exists for every Borel probability measure. Under strictly negative sectional curvature and mild regularity assumptions, the depth is strictly quasi-concave and the median is unique. We also establish robustness: the depth is stable under total-variation perturbations, and under contamination escaping to infinity the limiting median depends on the escape direction but not on how far the contaminating mass has moved along the geodesic ray, in contrast with the Fréchet mean. Finally, we establish uniform consistency of the sample depth and convergence of sample depth regions and sample Busemann medians; on symmetric spaces of noncompact type, the argument proceeds through a VC analysis of upper horospherical halfspaces, while on general Hadamard manifolds it follows from a compactness argument under a mild non-atomicity assumption.
Read the full abstract

Number Theory

A Rademacher exact type formula for pod$_2(n)$

In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a mixed mock modular form of weight 0. In order to obtain the formula we apply an extended version of the circle method, during which we need to bound Kloosterman sums and similar exponential sums as well as Mordell-type integrals.
Read the full abstract

Information Theory

Order Optimal Task Allocation in Distributed Computing via Interweaved Cliques

We consider a distributed computing system in which a master node coordinates $N$ workers to evaluate a function over $n$ input files, where this function accepts general decomposition. In particular, we focus on the general case where the requested function admits a $d$-uniform decomposition, meaning that it can be decomposed into a set of subfunctions that each depends on a unique $d$-tuple of the $n$ files. Our objective is to design file and task allocations that minimize the worst-case communication from the master to any worker and the worst-case computational load across workers. We first show that the optimal file and task allocation with minimum communication and computation costs admits a natural characterization within combinatorial design theory: it corresponds to a Steiner system $S(t, k, v)$ with $t=d$, $v=n$, and $k \approx \frac{n}{N^{1/d}}$. However, Steiner systems are known to exist only for very restricted parameter regimes. To overcome this limitation, we propose the information-theoretic-inspired Interweaved Clique (IC) design, a universal and deterministic allocation framework that relaxes the strict structure of Steiner systems by allowing slight variations in worker file loads. Although slightly suboptimal, the IC design achieves a communication cost within a constant factor $4e$ from our converse, while also maintaining an order-optimal computation cost, thus allowing this work to derive the fundamental scaling laws of this general distributed computing problem for a large range of parameters.
Read the full abstract

Classical Analysis and ODEs

Full packing dimensional projections of measures

We introduce a threshold parameter $D(\mu)$ for a Borel probability measure $\mu$ with compact support $E\subset\mathbb{R}^n$ such that, for every integer $1\leq m\leq n$, the orthogonal projection of $\mu$ onto a typical $m$ dimensional subspace attains full packing dimension if and only if $m\leq D(\mu)$. In the complementary regime we show that the Assouad dimension of the support controls the possible drop of the packing dimension under projections:$$\dim_P^{m}\mu\geq\dim_P\mu-\max\{0,\ \dim_A E-m\}.$$ In particular, whenever $m\geq\dim_A E$, the packing dimension of every measure supported on $E$ is preserved under orthogonal projection onto almost every $m$-dimensional subspace. Taking supremum over the measures supported on a set recovers, in its Assouad dimension form, the corresponding result of Falconer, Fraser and Shmerkin for sets. A key ingredient, of independent interest, is a sharpening of an estimate of Falconer and Mattila for the growth of the measure of balls, in which the ambient dimension is replaced by the Assouad dimension of the support.
Read the full abstract

Combinatorics

Generalized Turán problems for Berge hypergraphs

Let $\mathcal{H}$ be a hypergraph and $F$ be a graph. If there exists a bijection between the hyperedges of $\mathcal{H}$ and the edges of $F$ such that each hyperedge contains its image, then we say that $\mathcal{H}$ is a Berge copy of $F$, and the collection of Berge copies of $F$ is denoted by Berge-$F$. Given $r$-graphs $\mathcal{F}$ and $\mathcal{H}$, the generalized hyper-Turán number $\text{ex}_r(n, \mathcal{H}, \mathcal{F})$ is the maximum number of copies of $\mathcal{H}$ in $n$-vertex $\mathcal{F}$-free $r$-graphs. We study $\text{ex}_r(n, \mathcal{H}, \text{Berge-}F)$. For general $\mathcal{H}$, we connect this problem to counting copies of the shadow graph of $\mathcal{H}$ in $F$-free graphs and obtain several exact results. In particular, we show that for any hypergraph $\mathcal{H}$, if $k$ is sufficiently large, then $\text{ex}_r(n, \mathcal{H}, \text{Berge-}K_k)$ is achieved by the balanced complete $(k-1)$-partite $r$-graph, generalizing a result of Morrison, Nir, Norin, Rzażewski and Wesolek [Journal of Combinatorial Theory, Series B, 162 (2023) 231–243] to the case of hypergraphs. We show that $\text{ex}_r(n,K_s^r,\text{Berge-}F)\le \text{ex}_s(n,\text{Berge-}F)$ and present sufficient conditions for equality. We also consider the connected generalized Turán number for Berge paths.
Read the full abstract

Analysis of PDEs

Weak solutions and weak-strong uniqueness for a Cahn-Hilliard type model with chemotaxis

We prove existence of weak solutions and weak-strong uniqueness for a mathematical model which couples the evolution of a phase-parameter $\varphi$ satisfying a Cahn-Hilliard type relation with the one of an additional variable $\sigma$ influencing the phase separation process. The main application of the model refers to cancer growth processes, where $\sigma$ may represent the concentration of a chemical substance affecting the evolution of the tumor, and is governed by a nonlinear parabolic equation characterized by a cross-diffusion term alike that occurring in the Keller-Segel model for chemotaxis. This term is also responsible for the most relevant difficulties in the mathematical analysis of the system. Complementing previous results on the model, we prove here global in time existence for a very weak notion of solution to which a suitable energy imbalance and a logarithmic inequality for the nutrient are added. Noting that the system also admits local in time "strong" solutions, we can also exhibit a weak-strong uniqueness result whose proof exploits in an essential way the entropy-type inequality satisfied by weak solutions.
Read the full abstract

Geometric Topology · Cross-listed from cs.CV

Towards Symmetry-sensitive Pose Estimation: A Rotation Representation for Symmetric Object Classes

Symmetric objects are common in daily life and industry, yet their inherent orientation ambiguities that impede the training of deep learning networks for pose estimation are rarely discussed in the literature. To cope with these ambiguities, existing solutions typically require the design of specific loss functions and network architectures or resort to symmetry-invariant evaluation metrics. In contrast, we focus on the numeric representation of the rotation itself, modifying trigonometric identities with the degrees of symmetry derived from the objects' shapes. We use our representation, SARR, to obtain canonic (symmetry-resolved) poses for the symmetric objects in two popular 6D pose estimation datasets, T-LESS and ITODD, where SARR is unique and continuous w.r.t. the visual appearance. This allows us to use a standard CNN for 3D orientation estimation whose performance is evaluated with the symmetry-sensitive cosine distance $\text{AR}_{\text{C}}$. Our networks outperform the state of the art using $\text{AR}_{\text{C}}$ and achieve satisfactory performance when using conventional symmetry-invariant measures. Our method does not require any 3D models but only depth, or, as part of an additional experiment, texture-less RGB/grayscale images as input. We also show that networks trained on SARR outperform the same networks trained on rotation matrices, Euler angles, quaternions, standard trigonometrics or the recently popular 6d representation – even in inference scenarios where no prior knowledge of the objects' symmetry properties is available. Code and a visualization toolkit are available at https://github.com/akriegler/SARR .
Read the full abstract

Dynamical Systems

Locally invariant manifolds and foliations

Invariant manifolds and foliations associated to invariant pseudo-hyperbolic reference geometries have been well-studied in the context of dynamics implemented by a diffeomorphism. In this paper, we provide sufficient conditions for the existence of maximally smooth, locally invariant manifolds and foliations containing a given locally invariant, pseudo-hyperbolic reference geometry, in the context of dynamics implemented by a smooth map which need not be invertible. The theory is motivated by applications to the developing theory of large-step optimisation.
Read the full abstract

Differential Geometry

On the Calabi estimate of geometric flows of Hermitian metrics

We establish a general result ensuring a $C^1$ a priori bound for smooth curves of Hermitian metrics. As a main application, we obtain a new regularity result for Hermitian curvature flows, and in particular for the second Chern-Ricci flow.

Optimization and Control

Local Convergence Results for Sequential Quadratic Programming with Complementarity Constraints

Mathematical programs with complementarity constraints (MPCCs) are a challenging class of nonlinear optimization problems, because their nonlinear programming reformulations violate standard constraint qualifications at every feasible point. This paper analyzes sequential quadratic programming with complementarity constraints (SQPCC). In this method, the complementarity constraints are retained in the subproblems, yielding quadratic programs with complementarity constraints (QPCCs). The main contribution of the paper is a new local convergence result for the SQPCC method to S-stationary points. We show that there exists at least one sequence of QPCC S-stationary points converging to a reference S-stationary point of the MPCC, and we characterize conditions under which each such sequence converges and under which such a sequence is locally unique. In contrast to previous results, the analysis is established under weaker second-order sufficient conditions and requires no upper-level strict complementarity. Our result builds upon local convergence results for the classical SQP method. We present local convergence results for SQP within the kappa-omega setting, which also cover linearly convergent variants. These assumptions, which are widely used in the analysis of Newton-type methods, provide a natural framework for quantifying subproblem approximation errors, their effect on the convergence speed, and the effect of nonlinearity on the size of the local convergence region. Furthermore, we establish an active-set stabilization result for SQPCC, identifying conditions under which the optimal complementarity and inequality active sets are identified after finitely many iterations, and conditions under which such identification occurs only asymptotically. Numerical examples illustrate the theoretical findings and highlight some advantages of SQPCC over classical SQP applied to MPCCs.
Read the full abstract

Statistics Theory

Spectral approximation for the separable covariance mixture model

This paper introduces the separable covariance mixture model, which assumes a data-matrix $Y$ to be of the form $$ \sum\limits_{r=1}^R A_r X B_r $$ for one random $(d \times n)$-matrix $X$ with independent centered variance-one entries, and for two families of deterministic matrices $A_1,\dots,A_R \in \mathbb{C}^{d \times d}$ and $B_1,\dots,B_R \in \mathbb{C}^{n \times n}$. Under certain assumptions, it is shown that the resolvents $(\frac{1}{n} Y Y^* - z \operatorname{Id}_d)^{-1}$ and $(\frac{1}{n} Y^* Y - z \operatorname{Id}_n)^{-1}$ respectively approximate the deterministic matrices $$ -\frac{1}{z}\Big( \operatorname{Id}_d + \sum\limits_{r,s=1}^R \delta^{(B)}_{r,s}(z) A_{r} A_{s}^* \Big)^{-1} \ \ \text{ and } \ \ -\frac{1}{z}\Big( \operatorname{Id}_n + \sum\limits_{r,s=1}^R \delta^{(A)}_{r,s}(z) B_{s}^*B_{r} \Big)^{-1} \ , $$ where $\delta^{(A)}, \delta^{(B)} \in \mathbb{C}^{R \times R}$ are uniquely defined solutions to a certain dual system of equations. The results are non-asymptotic and do not require simultaneous diagonalizability of the families $(A_r)_{r \leq R}$ or $(B_r)_{r \leq R}$, as was required in previous works such as [Hazarika and Paul (2025)] or [Mei et al. (2023)]. An asymptotic application, which describes the limiting spectral distribution of the sample covariance matrix analogues $\frac{1}{n} Y Y^*$ or $\frac{1}{n} Y^* Y$, is included.
Read the full abstract

Numerical Analysis

Trefftz methods with evanescent plane waves

Classical Trefftz methods approximate Helmholtz solutions using propagative plane waves and are subject to strong numerical instabilities. Evanescent plane wave bases can substantially mitigate this phenomenon. We propose a simple recipe to select such basis functions. We show that the numerical results obtained by the Ultraweak Variational Formulation (UWVF) greatly improve thanks to this choice. More details and examples will soon be available in [Galante, Moiola, Parolin 2026].
Read the full abstract

Algebraic Topology

The complex of discrete Morse matchings of the $n$-simplex: homotopy types and structural results

The complex of discrete Morse matchings $\M(K)$, introduced by Chari and Joswig, is a simplicial complex whose simplices are the acyclic matchings on the Hasse diagram of $K$. Its homotopy type is known in only a handful of cases. In this paper, we compute the homotopy types of $\M(\Delta^3)$ and $\M(\partial\Delta^3)$, the corresponding pure complexes $\M_{P}(\Delta^3) \simeq \M_{P}(\partial\Delta^3)$, and the generalized complex of discrete Morse matchings $\GM(\Delta^3) \simeq \GM(\partial\Delta^3)$. For general $n$ we prove the identity $f(n) = (n+1) \cdot |\text{top-dimensional facets of } \M(\Delta^n_{(n-2)})|$, reducing the enumeration of optimal matchings on $\Delta^n$ to an enumeration on its $(n-2)$-skeleton, and we show that the inclusion $\M(K) \hookrightarrow \M(CK)$ is null-homotopic for any cone. We also compute the $f$-vector of $\M(\Delta^4)$, whose top entry $f(4) = 380{,}125$ is the number of optimal discrete Morse matchings on $\Delta^4$. We conclude with two conjectures extending the $\M_{P}$ and $\GM$ equivalences to all $n$.
Read the full abstract

Functional Analysis

Operators on injective tensor products of L1-preduals

Let X be an L1-predual and E,F be Banach spaces. We use the fact that an unconditionally converging operator T from the injective tensor product of X and E to F is strongly bounded and extend T to an operator S on continuous F-valued functions on the dual unit ball of X with the preservation of properties of T. This procedure provides a unified approach for proving properties of the tensor product of X and E based on the properties of E.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Informativity of Data-Knowledge Pairs for Lyapunov Equations

In the past few years, data informativity with prior knowledge has attracted increasing attention. This line of research aims to characterize whether data and prior knowledge suffice for system analysis or design. In this paper, we investigate such a characterization for the data-driven problem of determining a unique solution to Lyapunov equations. First, we introduce a notion of joint informativity for data-knowledge pairs as an extension of the standard informativity concept. Second, we derive an algebraic necessary and sufficient condition for the joint informativity. Finally, we provide further insights into the joint informativity by considering a special case of prior knowledge. The characterization presented in this paper is developed for a wide class of prior knowledge, enabling the incorporation of various forms of system information.
Read the full abstract

Optimization and Control

The Magnitude of Dominated Sets: A Pareto Compliant Indicator Grounded in Metric Geometry

We investigate magnitude as a new unary and strictly Pareto-compliant quality indicator for finite approximation sets to the Pareto front in multiobjective optimization. Magnitude originates in enriched category theory and metric geometry, where it is a notion of size or point content for compact metric spaces and a generalization of cardinality. For dominated regions in the \(\ell_1\) box setting, magnitude is close to hypervolume but not identical: it contains the top-dimensional hypervolume term together with positive lower-dimensional projection and boundary contributions. This paper gives a first theoretical study of magnitude as an indicator. We consider multiobjective maximization with a common anchor point. For dominated sets generated by finite approximation sets, we derive an all-dimensional projection formula, prove weak and strict set monotonicity on finite unions of anchored boxes, and thereby obtain weak and strict Pareto compliance. Unlike hypervolume, magnitude assigns positive value to boundary points sharing one or more coordinates with the anchor point, even when their top-dimensional hypervolume contribution vanishes. We then formulate projected set-gradient methods and compare hypervolume and magnitude on biobjective and three-dimensional simplex examples. Numerically, magnitude favors boundary-including populations and, for suitable cardinalities, complete Das–Dennis grids, whereas hypervolume prefers more interior-filling configurations. Computationally, magnitude reduces to hypervolume on coordinate projections; for fixed dimension this yields the same asymptotic complexity up to a factor \(2^d-1\), and in dimensions two and three \(\Theta(n\log n)\) time. These results identify magnitude as a mathematically natural and computationally viable alternative to hypervolume for finite Pareto front approximations.
Read the full abstract

Functional Analysis

A Metric Framework for Approximate Transitivity, Mixing, and Hypercyclicity

We study metric versions of transitivity, mixing, and hypercyclicity for continuous maps, based on intersections of the form \( f^{n}(U)\cap B_{\delta}(V)\neq\varnothing. \) We introduce $\delta$-topological transitivity, $\delta$-topological mixing, and a uniform-from-below version of $\delta$-mixing, and prove \( \mathrm{UFB\mbox{-}}\delta\text{-TM} \;\Rightarrow\; \delta\text{-TM} \;\Rightarrow\; \delta\text{-TT}. \) In the linear setting of separable F-spaces, we formulate a $\delta$-Hypercyclicity Criterion, prove that it implies $\delta$-hypercyclicity, and show that the classical Hypercyclicity Criterion implies the $\delta$-criterion for every $\delta>0$. We further show that this criterion yields eventual $\delta$-mixing along the underlying sequence. Finally, we discuss weighted backward shifts, derive sufficient conditions for $\delta$-topological mixing, and show that $\lambda B$ satisfies the $\delta$-Hypercyclicity Criterion for every $\delta>0$.
Read the full abstract

Mathematical Physics · Cross-listed from astro-ph.GA

Do time delay effects explain galactic velocity profiles?

Using the gravitoelectromagnetic analogy for weak gravitational fields, we critique explanations of galactic velocity profiles that invoke time delay effects (i.e. "retarded gravity"). For isotropic, time-dependent matter currents, we show within this framework that the force exerted on an orbiting body is Newtonian and due only to the instantaneous ambient matter configuration – there are no time delay effects in such situations.
Read the full abstract

All authors L. Benkoula, K. Chima, J. Kingsbury, K. Marroquin, M. Yim, T. Curtright

Analysis of PDEs

Global dynamics and diffusion-driven pattern formation in a predator-prey system with two chemicals

This work analyzes a predator-prey cross-diffusion system coupled with two chemical substances under homogeneous Neumann boundary conditions in a bounded domain Omega subset of R^n (n >= 2) with smooth boundary dOmega. Under appropriate conditions on the model parameters, the global existence of classical solutions is established. Furthermore, by constructing a suitable Lyapunov functional, the asymptotic stability of the spatially homogeneous steady state is proved. The emergence of spatial patterns induced by diffusion-driven instability is also investigated. Owing to the complexity of the resulting four-equation system, the criteria for Turing bifurcation are derived numerically rather than analytically. Numerical simulations are performed to generate Turing bifurcation diagrams, illustrating the dynamical responses of the system to variations in the predation rate. These results provide new insights into the role of predation intensity in the formation of spatial patterns in predator-prey systems mediated by two chemical substances.
Read the full abstract

All authors Gnanasekaran Shanmugasundaram, Jitraj Saha, Oluwole Daniel Makinde, Joydev Chattopadhyay

Geometric Topology

An Elliptic Curve Governing Hopf Linking in an $A_4$-Symmetric Tensegrity

We study in detail an A4-symmetric tensegrity appearing in Connelly's catalog. The realizable configurations form a one-parameter family that can be parametrized by points on the elliptic curve with Cremona label 30a2. The curve has only twelve rational points, among which only one corresponds to a stable tensegrity configuration whose cable framework forms a cuboctahedron. From a topological viewpoint, however, the underlying pair of the strut triangles preserves a Hopf link structure throughout the entire interval 0 < \omega_1 < 1 of the stress parameter.
Read the full abstract

Mathematical Physics

Moments at the hard edge and Rayleigh functions

Motivated by the analogy between spectral moments of random matrices and associated zeta functions, we study inverse power trace moments of the Laguerre ensemble of dimension $N$ and inverse temperature parameter $\beta>0$. We consider a large $N$ regime determined by the low-lying eigenvalues of the ensemble known as the hard edge. In the classical cases $\beta \in \{1,2,4\}$, we obtain explicit results for the inverse moments and extend these to formulae for the corresponding Mellin transforms. In the case of general $\beta>0$, by a result of Fyodorov and Le Doussal, we obtain a different formula for the moments given as a sum over partitions. We use this to consider a low temperature limit where $\beta \to \infty$ as $N \to \infty$. In this limit, we show that the moments are given in terms of the Bessel zeta function.
Read the full abstract

Group Theory

Counting automorphic orbits in finitely generated groups

We study an analogue of the conjugacy growth function in finitely generated groups: the automorphic growth function. This counts the number of automorphic orbits that intersect the ball of radius $n$ in the group. We show that this is not a commensurability invariant, by giving virtually abelian counterexamples. We classify the automorphic growth rate of all virtually abelian groups of rank at most $2$, the Heisenberg group, finite rank free groups and Thompson's groups $T$ and $V$. This last computation allows to conclude that $T$ and $V$ have exponential conjugacy growth.
Read the full abstract

Analysis of PDEs

Fractional Sobolev-type embedding on CR sphere and Heisenberg group

This paper studies critical fractional Sobolev inequalities with lower-order terms on the standard CR sphere $\mathbb S^{2n+1}$. Let $Q=2n+2$, let $s\in(0,1)$, let $1<p<Q$, and let $p_s^*=\frac{Qp}{Q-sp}$. For the inequality $\|u\|_{L^{p_s^*}(\mathbb S^{2n+1})}\le A[u]_{s,p}+B\|u\|_{L^p(\mathbb S^{2n+1})}$, we prove that the admissible lower-order coefficients are exactly $\left[|\mathbb S^{2n+1}|^{-s/Q},\infty\right)$. For the power-type inequality $\|u\|_{L^{p_s^*}(\mathbb S^{2n+1})}^p\le A[u]_{s,p}^p+B\|u\|_{L^p(\mathbb S^{2n+1})}^p$, we show that the admissible set is $\left[|\mathbb S^{2n+1}|^{-sp/Q},\infty\right)$ when $1<p\le 2$, and $\left(|\mathbb S^{2n+1}|^{-sp/Q},\infty\right)$ when $2<p<Q$. Via the Cayley transform, we derive the exact weighted counterpart on the Heisenberg group and prove that the corresponding admissible sets coincide with those on the sphere. We also show that nonlinear first-moment constraints do not improve the optimal lower-order coefficient, whereas finite-codimensional linear constraints excluding nonzero constants yield coercive inequalities.
Read the full abstract

Representation Theory

The Reverse Tableaux: a Gateway to the Surjectivity of the Component Map

Let $G$ be a simple algebraic group over $\mathbb C$, $B$ a fixed Borel subgroup, $P$ a parabolic subgroup, $P'$ its derived group acting on the Lie algebra $\mathfrak m$ of its nilradical. The nilfibre $\mathscr N$ is the zero locus of the augmentation $\mathcal I_+$ of the semiinvariant algebra $\mathcal I=\mathbb C[\mathfrak m]^{P'}$. Via Richardson's theorem, $\mathcal I$ is polynomial. Then the generators of $\mathcal I$ may be taken to be the Benlolo-Sanderson invariants \cite{BS}. In Y.Fittouhi and A.Joseph, The Magic and Mystery of Component Tableaux, Indag 2026, a set $\{\mathscr T^\mathcal C\}$ of component tableaux was constructed each encoding explicit combinatorial data $\mathcal C$. Each tableau $\{\mathscr T^\mathcal C\}$ defines a component $\mathscr C$ of $\mathscr N$ and the map $\{\mathscr T^\mathcal C\}\mapsto \mathscr C$ is injective. Here this data is simply encoded in a multiset called the Red Set. In the present work a set $\{\mathscr R^{\psi(\mathcal C)}\}$ of Reverse Tableaux is constructed through an Enabling Proposition. They define the same components as the component tableaux and furthermore give a factorisation of each new invariant in a chosen sequence via successive linearisation of preceding invariants. Via Krull's theorem this factorisation provides the required surjectivity. There can be several reverse tableaux for a given RedSet, yet each determine the same variety as the component tableaux with the given RedSet and define the same components. The flexibility of having several equivalent reverse tableaux absent from the more rigid component tableaux, is essential for factorisation This procedure is different from the classical approach to surjectivity requiring a geometric description of the nilcone which seems unattainable. Nothing of this complexity has never been tackled before and the methods used here are entirely new
Read the full abstract

Number Theory

Solvable Descent and the Grunwald Problem for Solvable Groups

We prove a suitable fibration theorem over quasi-trivial tori that, through an approach developed by Harpaz and Wittenberg, implies so-called solvable descent. In particular, this gives a positive answer to the Grunwald problem for solvable groups up to the necessary Brauer–Manin obstruction, providing a generalizion of Shafarevich's positive answer to the Inverse Galois Problem for solvable groups. This also provides an alternative proof of Shafarevich's result that avoids his "shrinking procedure". For the fibration theorem, we first adapt the starting ideas of Shafarevich for the creation of local lifts. To deal then with the Brauer–Manin obstruction (i.e. the relevant local-to-global obstruction), we compute its "triple variation" on grids of fibers. The resulting expression is a linear combination of Redéi symbols on the base. Customizing these and employing a combinatorial principle first noted by Alexander Smith in the context of Class and Selmer Groups, one infers the vanishing of the obstruction in at least one fiber.
Read the full abstract

Analysis of PDEs

Stability of geodesic-ray data, horofunctions, and rectifiability of fixed-shape slices in the Newtonian \(N\)-body problem

For the Newtonian \(N\)-body problem at nonnegative energy, we study solution sets selected by the Jacobi–Maupertuis variational principle and by the associated stationary Hamilton–Jacobi equation. We prove a compactness/stability theorem for classical initial data generating geodesic rays: limits in the ambient phase space remain collision-free, generate geodesic rays, and carry locally relatively compact normalized Busemann functions. The limiting horofunction of normalized Busemann functions yields a viscosity solution of the limiting stationary equation. For a fixed collision-free hyperbolic limit shape \(a\), we also prove closedness of the corresponding slice of geodesic-ray data. Finally, after passing to the reduced configuration space \(X\), we show that this fixed-shape slice is countably \(d(N-1)\)-rectifiable in phase space and has Hausdorff dimension exactly \(d(N-1)\). Thus the paper combines phase-space compactness of calibrated minimizing motions with a geometric-measure description of a fixed-shape Hamilton–Jacobi calibrated slice.
Read the full abstract

Algebraic Geometry

Generalized Howe curves of genus 4, 5, and 6 with completely decomposable Jacobians

Superspecial curves are important objects in number theory and algebraic geometry, and the existence of such a curve of genus $g \geq 4$ is an open problem, for general characteristics $p > 0$. As a computational approach to this problem, Kudo-Harashita-Howe (2020) showed that a superspecial curve of genus 4 exists in each characteristic $p$ with $7 < p < 20000$. Their method restricted attention to a specific class of curves, known as Howe curves, for which superspeciality is reduced to those of curves of genus at most 2. In this paper, we focus on a more specific class of curves, namely Howe curves whose Jacobians decompose into a product of four elliptic curves. By restricting our attention to such curves, the superspeciality reduces to the supersingularity of elliptic curves, which enables us to construct a superspecial curve of genus 4 more efficiently than Kudo-Harashita-Howe's method. As our first main result, we confirmed by computer the existence of such superspecial curves of genus 4 in characteristics $p$ with $20000 < p < 10^6$. Using a similar approach, we also propose constructions of superspecial curves of genera 5 and 6 from only supersingular elliptic curves. Furthermore, computational experiments establish the existence of superspecial curves of genus 5 (resp. genus 6) in characteristics $p$ with $13 < p < 10^5$ (resp. $7 < p < 10^5$).
Read the full abstract

Probability

Pick-up Sticks and the General Fibonacci Numbers

In the article by Edward et al. \cite{Sudbury2025}, it was shown that the probability that no three sticks randomly chosen from the unit interval can form a triangle equals the reciprocal of the product of the first $n$ Fibonacci numbers. The authors further suggested a generalization to higher \((k+1)\)-gons \((k\ge 4)\). This note proves that, indeed, for any \(k\ge 2\), the probability that no $k+1$ of $n$ independent uniform $[0,1]$ lengths can form a $(k+1)$-gon is expressed as a product whose factors involve a $k$-step Fibonacci-type recurrence. The method follows closely the original argument of \cite{Sudbury2025}, while making ex
Read the full abstract

Operator Algebras

Morita equivalence for quantum graphs

We introduce an operator-algebraic framework for Morita equivalence of quantum graphs based on $\Delta$-equivalence of operator systems introduced by Eleftherakis, Kakariadis and Todorov. Adopting the perspective of Weaver, we view quantum graphs as quantum relations, that is, operator systems endowed with a bimodule structure over the commutant of a von Neumann algebra. Within this framework, we show that two irreducibly acting quantum graphs are Morita equivalent if and only if they are both full pullbacks of a common quantum graph. This extends a result of Eleftherakis, Kakariadis and Todorov for graph operator systems to the quantum graph setting. In passing we construct a true-twin reduction analogue for an irreducibly acting quantum graph. We further characterise the case where we have simultaneous TRO-equivalence of the quantum graphs and their associated algebras, thus giving a second, stronger notion of Morita equivalence. In the special case of noncommutative graphs, corresponding to the zero-error quantum communication setting, the two notions coincide and we obtain a characterisation in terms of strong co-homomorphisms of noncommutative graphs. Finally, we show that connectivity, the independence number, Shannon capacity, quantum complexity and subcomplexity, Haemers bound, and the Lovász number are invariant under Morita equivalence.
Read the full abstract

All authors Alexandros Chatzinikolaou, Gage Hoefer, Nikolaos Koutsonikos-Kouloumpis, Ioannis Apollon Paraskevas

Information Theory · Cross-listed from eess.SP

Low-Complexity Tone Injection via Candidate Ranking for PAPR Reduction in OFDM and AFDM Systems

Tone injection (TI) is a promising distortionless PAPR reduction technique that incurs no spectral efficiency loss. However, state-of-the-art TI schemes based on random candidate generation or clipping noise spectrum suffer from fundamental limitations in PAPR performance. In this paper, we propose novel TI schemes compatible with both OFDM and AFDM systems. The proposed schemes iteratively update the TI sequence via a candidate ranking procedure guided by time-domain local peaks. This accurately selects effective candidates while achieving a complexity comparable to that of the fast Fourier transform. Depth-first search is further integrated to enhance PAPR performance by exploiting the tree structure of the process. Simulations demonstrate that the proposed schemes achieve over 1 dB PAPR gain over baseline TI schemes at comparable complexity. The gain is consistent across various numbers of subcarriers under controlled per-iteration complexities, confirming a superior performance-complexity trade-off for both OFDM and AFDM.
Read the full abstract

All authors Yupeng Zheng, Ang Li, Jinfei Wang, Yi Ma, Rahim Tafazolli