Numerical Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 25 February
We consider a multidimensional polychromatic radiative transfer (RT) problem, accounting for scattering processes in a general form, i.e. anisotropic (dipole) scattering with partial frequency redistribution. Given a discrete ordinates discretization, we report the corresponding matrix structures, depending on model and discretization parameters. Despite the possibly dense nature of these matrices, the use of Krylov methods is effective (especially in the matrix-free context) and robust. We propose a theoretical analysis, using the spectral tools of the symbol theory, explaining why Krylov convergence is robust w.r.t. all the discretization parameters, even in the unpreconditioned case. In fact, the compactness of the continuous operators used in the modeling leads to zero-clustered dense matrix sequences plus identity, so that the clustering at the unity of the spectra is deduced. Numerical experiments confirm the theoretical results, which have a direct application, for example, in the simulation of radiative transfer in stellar atmospheres, a key problem in astrophysical research. In general, we demonstrate that optimal scaling with respect to RT discretization parameters is expected for Krylov solution strategies.
Analysis of PDEs
Asymptotic analysis of higher-order perturbations of the Perona–Malik functional
The Gamma-limit of higher-order singular perturbations of the Perona-Malik functional is analyzed. The energies considered combine the critically scaled logarithmic term with a k-th order regularization designed to balance bulk and interfacial effects. A compactness result is obtained, and the Gamma-limit is identified as a free-discontinuity functional on SBV, given by the sum of the Dirichlet energy and a surface term proportional to the jump amplitude to the power 1/k. The surface density is characterized through a one-dimensional optimal-profile problem with homogeneous boundary conditions on derivatives up to order k-1. As a consequence, the limit of the same energies at a different scaling is determined. That scaling had been previously studied in the second-order case to address the so-called staircasing phenomenon.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Aggressiveness-Aware Learning-based Control of Quadrotor UAVs with Safety Guarantees
This paper presents an aggressiveness-aware control framework for quadrotor UAVs that integrates learning-based oracles to mitigate the effects of unknown disturbances. Starting from a nominal tracking controller on $\mathrm{SE}(3)$, unmodeled generalized forces and moments are estimated using a learning-based oracle and compensated in the control inputs. An aggressiveness-aware gain scheduling mechanism adapts the feedback gains based on probabilistic model-error bounds, enabling reduced feedback-induced aggressiveness while guaranteeing a prescribed practical exponential tracking performance. The proposed approach makes explicit the trade-off between model accuracy, robustness, and control aggressiveness, and provides a principled way to exploit learning for safer and less aggressive quadrotor maneuvers.
Read the full abstract
Information Theory
Function-Correcting Codes with Optimal Data Protection for Hamming Code Membership
This paper investigates single-error-correcting function-correcting codes (SEFCCs) for the Hamming code membership function (HCMF), which indicates whether a vector in $\mathbb{F}_2^7$ belongs to the [7,4,3]-Hamming code. Necessary and sufficient conditions for valid parity assignments are established in terms of distance constraints between codewords and their nearest non-codewords. It is shown that the Hamming-distance-3 relations among Hamming codewords induce a bipartite graph, a fundamental geometric property that is exploited to develop a systematic SEFCC construction. By deriving a tight upper bound on the sum of pairwise distances, we prove that the proposed bipartite construction uniquely achieves the maximum sum-distance, the largest possible minimum distance of 2, and the minimum number of distance-2 codeword pairs. Consequently, for the HCMF SEFCC problem, sum-distance maximisation is not merely heuristic-it exactly enforces the optimal distance-spectrum properties relevant to error probability. Simulation results over AWGN channels with soft-decision decoding confirm that the resulting max-sum SEFCCs provide significantly improved data protection and Bit Error Rate (BER) performance compared to arbitrary valid assignments.
Read the full abstract
Analysis of PDEs
Real analytic solutions to the divergence equation
In this paper, we develop a differential-topological method to yield explicit real analytic solutions $v$ to the divergence equation $div_{\mathbb{R}^n} v = f$ on any annali $A(R_1 ,R_2) = \{ x \in \mathbb{R}^n : R_1 < |x| < R_2\}$, with $n \geq 2$, and $0 < R_1 < R_2 < \infty$. The prescribed source term $f$ is supposed to be real analytic on $\overline{A(R_1 , R_2)} = \{ x \in \mathbb{R}^n : R_1 \leq |x| \leq R_2\}$ satisfying the zero integral condition on $A(R_1, R_2)$. The resulting solution $v$ is a real analytic vector field on $\overline{A(R_1 , R_2)}$, which vanishes on $\partial \big( A(R_1, R_2 ) \big )$. The method which we develop here is different from the standard Bogovski approach and the Kapitanskii-Pileckas approach. The first main step our method is a clever differential-topological argument, which we develop under the inspiration and guidance of the standard proof of the cohomological statement $H_c^n \big ( \mathbb{R}^n\big ) = \mathbb{R}$ in Spviak book A Comprehensive Introduction to Differential Geometry, Vol I. This allows us to reduce the problem to that of solving a linear algebra problem.
Read the full abstract
Optimization and Control
Comparison of Linear Systems Across Time Domains: Continuous-time vs. Discrete-time
We develop a formal framework for the behavioral comparison of linear systems across different time domains. We accomplish this by introducing the notion of system interpolation, which determines whether the input-state trajectories of a continuous-time system can be realized as piecewise polynomial interpolations of the input-state trajectories of a discrete-time system. In this context, a piecewise polynomial interpolation of a discrete-time signal is characterized as a continuous-time function that coincides with the discrete-time signal at given sampling instants and can be realized as a polynomial of a prescribed degree over intervals between these instants. By representing piecewise polynomial functions as linear combinations of shifted Legendre polynomials, we characterize system interpolation as a subspace inclusion that is completely in terms of system parameters. This therefore allows for a computationally efficient comparison of the input-state behavior of a continuous-time system with that of a discrete-time one. We then exploit this characterization to discretize a given continuous-time system into a discrete-time one. Lastly, given a control specification, we exploit system interpolation to synthesize controllers that ensure satisfaction at each given sampling instant, while they measure the extent of (possible) violation over intervals between these instants.
Read the full abstract
Analysis of PDEs
2D incompressible inviscid Oldroyd-B equations: ill-posedness, long time existence, and high Weissenberg number limit
In this paper, we consider the high-Weissenberg number limit of a Voigt-regularized two-dimensional Oldroyd-B model for viscoelastic fluids. We first demonstrate that the Euler-Oldroyd-B system is both linearly and nonlinearly ill-posed in Sobolev spaces, exhibiting Hadamard instability. Then, we introduce a Voigt-type regularization on the stress tensor, which stabilizes the system. For the regularized model, we establish long time ($T \sim \mathcal O(\varepsilon^{-2/3})$) well-posedness and uniform energy estimates with respect to the relaxation parameter $\varepsilon>0$. Lastly, we prove that, as $\varepsilon \to 0$, the solutions converge to a solution of the 2-d incompressible Navier-Stokes equations over time intervals of size $\mathcal O(\varepsilon^{-2/3})$. The proof relies on a decomposition of the stress tensor, high-order energy estimates, and a detailed analysis of the nonlinear coupling terms. Our results provide a mathematical justification for the Newtonian limit of a regularized viscoelastic fluid model that is otherwise ill-posed.
Read the full abstract
Numerical Analysis
Robust Kaczmarz methods for nearly singular linear systems
The Kaczmarz method is an efficient iterative algorithm for large-scale linear systems. However, its linear convergence rate suffers from ill-conditioned problems and is highly sensitive to the smallest nonzero singular value. In this work, we aim to extend the classical Kaczmarz to nearly singular linear systems that are row rank-deficient. We introduce a new concept of nearly singular property by treating the row space as an unstable subspace in the Grassman manifold. We then define a related important space called the approximate kernel, based on which a robust kernel-augmented Kaczmarz (KaK) is introduced via the subspace correction framework and analyzed by the well-known Xu–Zikatanov identity. To get an implementable version, we further introduce the approximate dual kernel and transform KaK into an equivalent kernel-augmented coordinate descent. Furthermore, we develop an accelerated variant and establish the improved rate of convergence matching the optimal complexity of first-order methods. Compared with existing methods, ours achieve uniform convergence rates for nearly singular linear systems, and the robustness has been confirmed by some numerical tests.
Read the full abstract
Numerical Analysis
A fully iterative adaptive energy-based approach for monotone elliptic problems
We present a fully iterative adaptive algorithm for the numerical minimization of strongly convex energy functionals in Hilbert spaces. The proposed approach, which we first present in abstract form, generates a hierarchical sequence of adaptively refined finite-dimensional approximation spaces and employs a (nonlinear) conjugate gradient (CG) method to compute suitable approximations on each space. A core novelty of our approach is that all components of the algorithm are consistently driven by energy reduction principles rather than by classical a posteriori estimators. In particular, adaptive refinement is steered by local energy reduction indicators which aim to construct subsequent approximation spaces in a way that attains the largest potential decrease in energy. Likewise, the stopping criteria for the iterative solver are based on either relative or averaged energy reductions on each subspace. As a concrete realization, we present a concise implementation for $\mathbb{P}_1$ finite element discretizations of second-order semilinear elliptic diffusion-reaction models, where the local indicators driving the element refinements are computed based on edge-wise energy reductions. Numerical experiments demonstrate that the resulting scheme achieves optimal convergence for various benchmark problems in two-dimensional polygonal domains.
Read the full abstract
Numerical Analysis
A generalized Riemann problem-based compact reconstruction method for finite volume schemes
We present a Generalized Riemann Problem-based reconstruction method (GRPrec) for high-order finite volume schemes applied to hyperbolic partial differential equations. The method constructs spatial polynomials using cell averages at the current time level and GRP solution data from the previous time level. The resulting GRPrec stencil is as compact as that of discontinuous Galerkin (DG) schemes but unlike DG, our finite volume schemes obey a generous CFL stability condition that is independent of the order of accuracy. We assess the method's performance through test problems for smooth and discontinuous solutions of the linear advection equation and the Euler equations of gas dynamics in one space dimension. Results are compared against exact solutions and against numerical results from well-known spatial reconstruction finite volume and DG schemes, with all methods implemented in the fully discrete ADER framework. The performance of GRPrec is very promising, especially in terms of efficiency, that is error against CPU cost.
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
The Error of Deep Operator Networks Is the Sum of Its Parts: Branch-Trunk and Mode Error Decompositions
Operator learning has the potential to strongly impact scientific computing by learning solution operators for differential equations, potentially accelerating multi-query tasks such as design optimization and uncertainty quantification by orders of magnitude. Despite proven universal approximation properties, deep operator networks (DeepONets) often exhibit limited accuracy and generalization in practice, which hinders their adoption. Understanding these limitations is therefore crucial for further advancing the approach. This work analyzes performance limitations of the classical DeepONet architecture. It is shown that the approximation error is dominated by the branch network when the internal dimension is sufficiently large, and that the learned trunk basis can often be replaced by classical basis functions without a significant impact on performance. To investigate this further, a modified DeepONet is constructed in which the trunk network is replaced by the left singular vectors of the training solution matrix. This modification yields several key insights. First, for examples involving the KdV and Burgers equations, a spectral bias in the branch network is observed, with coefficients of dominant, low-frequency modes learned more effectively. Second, through the interplay of the singular-value weighting and the optimizer's neglect of small modes, the branch error is dominated by modes with large and intermediate singular values. Third, using a shared branch network for all mode coefficients, as in the standard architecture, improves generalization of small modes compared to a stacked architecture in which coefficients are computed separately. Finally, detrimental coupling between modes in parameter space is identified, which weakens with increasing network width.
Read the full abstract
Commutative Algebra
Betti numbers of skeletons of thick trees
The starting point is the class of the following simplicial complexes $\Delta$ with 2-linear resolutions. The facets of $\Delta$ are $F_1,\ldots,F_n$, and we demand that for each $i$ $F_i\cap (F_1\cup \cdots\cup F_{i-1}\cup F_{i+1}\cdots\cup F_n)$ be a point. We will determine the Betti numbers, and thus the projective dimension, the depth, and the regularity of the Stanley-Reisner rings of all skeletons of such complexes. It follows that we know when these complexes are Cohen-Macaulay. Also, there are two ways to determine the Hilbert series of $\Delta$, giving sequences of identities for binomial coefficients.
Read the full abstract
Combinatorics
On the expansion formulas of cluster varieties from surfaces and their combinatorial properties
This paper explores the cluster algebra structure of the moduli space $\mathscr{A}_{\mathrm{SL}_{n+1},\mathbb{S}}$ of twisted $\mathrm{SL}_{n+1}$-local systems on a surface. We derive general recurrence relations for cluster variables arising from flips of a triangulation, corresponding to specific sequences of mutations. Our approach is grounded in a detailed combinatorial analysis over the standard $n$-triangulated $m$-gon (with explicit calculations for $n=1,2$). As a generalization, the non-simply-laced $G_2$ type is also considered. We prove the "well-triangulated" property for cluster mutations under flips, which provides a combinatorial framework for understanding the stability and transformation rules of these cluster algebra structures, and compute the monomial counts for the cluster expansion formula.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Computing Nonequilibrium Transport from Short-Time Transients: From Lorentz Gas to Heat Conduction in One Dimensional Chains
We test the Transient Time Correlation Function (TTCF) method to compute nonequilibrium transport coefficients, highlighting its conceptual and practical difference from the standard time-average approach. While time averages extract transport properties from long stationary trajectories and discard transient dynamics, TTCF adopts the complementary strategy: it exploits the information contained in short-time transients following the onset of an external perturbation, while discarding the long-time evolution once stationarity is reached. We revisit the theoretical framework of TTCF and assess its numerical performance through representative case studies, the Lorentz gas and a many-body system, namely a chain of oscillators with anharmonic pinning potential. By direct comparison with time averages, we show that for the Lorentz gas TTCF yields consistent transport coefficients in both linear and nonlinear regimes at a reduced computational cost. Moreover, the TTCF displays superior precision in the linear-response regime, and remains reliable in non-ergodic situations, revealing the presence of regions of phase space corresponding to different behaviors, as well as the possibility of phase transitions. For the anharmonic chain, we show that TTCF is a scalable and efficient alternative for the numerical study of nonequilibrium transport.
Read the full abstract
Logic
Quantales carrying ortholattice structure
This paper investigates the intersection of residuated structures from many-valued logic and orthomodular lattices from quantum logic. We explore whether non-Boolean structures can simultaneously satisfy residuation principles and orthocomplementation requirements. Our main contribution is a study of Girard posets with inversions, providing a characterization theorem where a unital residuated poset is Girard if and only if it admits an inversion satisfying specific adjointness conditions. We prove that any complemented lattice admitting an integral residuated structure must be Boolean, which motivates our search for orthomodular examples in the non-integral case. We answer this by demonstrating that the lattice $C(\mathbb{R}^n)$ of closed subspaces of $n$-dimensional real coordinate space carries both an orthomodular and a commutative Girard quantale structure. This construction provides a concrete non-Boolean framework unifying quantum-logical and many-valued logical reasoning.
Read the full abstract
Combinatorics
Symbols frequencies in the Thue–Morse word in base $3/2$ and related conjectures
We study a binary Thue–Morse-type sequence arising from the base-$3/2$ expansion of integers, an archetypal automatic sequence in a rational base numeration system. Because the sequence is generated by a periodic iteration of morphisms rather than a single primitive substitution, classical Perron–Frobenius methods do not directly apply to determine symbol frequencies. We prove that both symbols ${\tt 0},{\tt 1}$ occur with frequency $1/2$ and we show uniform recurrence and symmetry properties of its set of factors. The proof reveals a structural bridge between combinatorics on words and harmonic analysis: the first difference sequence is shown to be Toeplitz, providing dynamical rigidity, while filtered frequencies naturally encode a dyadic structure that lifts to the compact group of $2$-adic integers. In this $2$-adic setting, desubstitution becomes a linear operator on Fourier coefficients, and a spectral contraction argument enforces uniqueness of limiting densities. Our results answer several conjectures of Dekking (on a sibling sequence) and illustrate how harmonic analysis on compact groups can be fruitfully combined with substitution dynamics.
Read the full abstract
Number Theory
The cyclosyntomic regulator of a number field
We construct a q-deformation of the p-adic regulator of a number field, called the cyclosyntomic regulator, building on the Habiro ring of Garoufalidis-Scholze-Wheeler-Zagier. The key new ingredient in our construction is a refinement of Sulyma's norm maps in prismatic cohomology, which interpolate between classical powers and Frobenius maps at various prime numbers p. Furthermore, we compute the values of the cyclosyntomic regulator at units of the form $1-\zeta$, where $\zeta$ is a root of unity.
Read the full abstract
Classical Analysis and ODEs
Endpoint variation and jump inequalities for rough singular integrals
In this article, we establish weak type $(1,1)$ bounds for the variation and jump operators associated with the family of truncated singular integrals with rough kernels. This resolves an open question raised by Jones, Seeger and Wright (Trans. Amer. Math. Soc. (2008)). Moreover, as an immediate consequence of the variational estimate, we recover the weak type $(1,1)$ boundedness of the maximally truncated rough singular integral operator.
Read the full abstract
Optimization and Control
Non-Extreme Individual Minima for Improved Pareto Front Sampling Efficiency and Decision-Making
In multi-objective optimization, the set of optimal trade-offs – the Pareto front – often contains regions that are extremely steep or flat. The Pareto optimal points in these regions are typically of limited interest for decision-making, as the marginal rate of substitution is extreme: a marginal improvement in one objective necessitates a significant deterioration in at least one other objective. These unfavorable trade-offs frequently occur near the individual minima, where single objectives attain their minimum values without considering the remaining criteria. To address this, we propose the concept of non-extreme individual minima that relies on the notion of $L$-practical proper efficiency. These points can serve as a less sensitive replacement for standard individual minima in subsequent related methods. Specifically, they allow for a more practical restriction of the Pareto front sampling within a refined utopia-nadir hyperbox, provide a meaningful basis for image space normalization, and can enhance decision-making techniques, such as knee-point methods, by focusing on regions with acceptable trade-offs. We provide a computationally efficient algorithm to determine these non-extreme individual minima by solving at most $2n_J$ standard weighted-sum scalarizations, where $n_J$ is the number of objectives. To ensure robustness across varying objective scales, the method incorporates an integrated image space normalization strategy. Numerical examples, specifically a convex academic case and a non-convex real-world application, demonstrate that the method successfully excludes practically irrelevant regions in the image space.
Read the full abstract
Number Theory
Equidistribution for Tannakian monodromy groups
We prove that a perverse sheaf on a connected commutatitve algebraic group over a finite is generically unramified. This implies an equidistribution theorem for Tannakian monodromy groups in previously unavailable generality. We also prove a stratification theorem for exponential sums in families indexed by a scheme and the characters of a connected commutative algebraic group. Our method is based on Tannakian categories introduced by Gabber and Loeser. This method naturally yields fiber functors. We also prove vanishing theorems over a connected commutative algebraic group, classify the negligible sheaves, and prove relative weak propagation theorems for tori.
Read the full abstract
Representation Theory
Strata of Weyl groups
A Weyl group W is a union of strata (certain subsets which are unions of conjugacy classes) which are the nonempty fibres of a map from W to the set of irreducible representations of W. We give an explicit description of strata in terms of a certain modified centralizer group. We also define superstrata of a connected reductive group and state a conjecture about them.
Read the full abstract
Combinatorics
The perturbation threshold of degenerate graphs
We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most $\Delta$. Then with high probability, $G \cup G(n, n^{-1/d - \eta})$ contains a copy of $H$. We also prove that the same conclusion extends to $d$-regular graphs with $d\ge 4$ satisfying a certain edge expansion property, with the threshold improved to $n^{-2/d - \eta}$. Such a property is satisfied by almost all $d$-regular graphs and for even $d$, by the $(d/2)$-th power of a Hamilton cycle.
Read the full abstract
Number Theory
Quartic del Pezzo surfaces over $\mathbb{F}_p(t)$ without quadratic points
We construct an infinite family of quartic del Pezzo surfaces over $\mathbb{F}_p(t)$ with no quadratic points, for all primes $p\neq 2$. This answers a question of Colliot–Thélène, Creutz and Viray in the negative, which asks whether every quartic del Pezzo surface has quadratic points over $C_2$ fields. We exhibit a Brauer–Manin obstruction on the variety parametrising lines associated to the quartic del Pezzo surface.
Read the full abstract
Combinatorics
Steiner Forest for $H$-Subgraph-Free Graphs
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and combinatorial results: Algorithms: We identify two new classes of graph-theoretical structures that make it possible to solve Steiner Forest in polynomial time. Roughly speaking, our algorithms handle the following cases: (1) a set $X$ of vertices of bounded size that are pairwise connected by subgraphs of treewidth $2$ or bounded size, possibly together with an independent set of arbitrary size that is connected to $X$ in an arbitrary way; (2) a set $X$ of vertices of arbitrary size that are pairwise connected in a cyclic manner by subgraphs of treewidth $2$ or bounded size. Hardness results: We show that Steiner Forest remains NP-complete for graphs with 2-deletion set number $3$. (The $c$-deletion set number is the size of a smallest cutset $S$ such that every component of $G-S$ has at most $c$ vertices.) Combinatorial results: To establish the dichotomy, we perform a delicate graph-theoretic analysis showing that if $H$ is a path or a subdivided claw, then excluding $H$ as a subgraph either yields one of the two algorithmically favourable structures described above, or yields a graph class for which NP-completeness of Steiner Forest follows from either our new hardness result or a previously known one. Along the way to classifying the hardness for excluded subgraphs, we establish a dichotomy for graphs with $c$-deletion set number at most $k$. Specifically, our results together with pre-existing ones show that Steiner Forest is polynomial-time solvable if (1) $c=1$ and $k\geq 0$, or (2) $c=2$ and $k\leq 2$, or (3) $c\geq 3$ and $k=1$, and is NP-complete otherwise.
Read the full abstract
Probability
Concentration for random Euclidean combinatorial optimization
We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$–costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration at the natural energy scale $n^{1-p/d}$ for $1\le p<d^2/2$. Our method combines a Poincaré inequality with a robust geometric mechanism providing uniform bounds on the edges of optimizers. We also formulate a conjectural $p\!\to\!q$ transfer principle for the $p$–optimal matching which, if true, would extend the concentration range to all $p\ge 1$.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Scalable Kernel-Based Distances for Statistical Inference and Integration
Representing, comparing, and measuring the distance between probability distributions is a key task in computational statistics and machine learning. The choice of representation and the associated distance determine properties of the methods in which they are used: for example, certain distances can allow one to encode robustness or smoothness of the problem. Kernel methods offer flexible and rich Hilbert space representations of distributions that allow the modeller to enforce properties through the choice of kernel, and estimate associated distances at efficient nonparametric rates. In particular, the maximum mean discrepancy (MMD), a kernel-based distance constructed by comparing Hilbert space mean functions, has received significant attention due to its computational tractability and is favoured by practitioners. In this thesis, we conduct a thorough study of kernel-based distances with a focus on efficient computation, with core contributions in Chapters 3 to 6. Part I of the thesis is focused on the MMD, specifically on improved MMD estimation. In Chapter 3 we propose a theoretically sound, improved estimator for MMD in simulation-based inference. Then, in Chapter 4, we propose an MMD-based estimator for conditional expectations, a ubiquitous task in statistical computation. Closing Part I, in Chapter 5 we study the problem of calibration when MMD is applied to the task of integration. In Part II, motivated by the recent developments in kernel embeddings beyond the mean, we introduce a family of novel kernel-based discrepancies: kernel quantile discrepancies. These address some of the pitfalls of MMD, and are shown through both theoretical results and an empirical study to offer a competitive alternative to MMD and its fast approximations. We conclude with a discussion on broader lessons and future work emerging from the thesis.
Read the full abstract
Algebraic Topology
Bredon cohomology methods in mass partition problems on spheres
We apply $\mathrm{RO}(G)$-graded Bredon cohomology to mass assignment problems, extending classical mass partition methods. Within this framework, we reprove a recent result of Lessure and Soberón: for $n+1$ mass assignments on $k$-dimensional affine subspaces of $\mathbb{R}^n$, there exists a $k$-subspace containing a sphere that simultaneously bisects all measures. This approach highlights a flexible topological framework with potential for broader applications.
Read the full abstract
Number Theory
Ours go to 211: Euler pseudoprimes to 47 prime bases (from Carmichael numbers)
In this paper we show that a certain subset of the Carmichael numbers contains good Euler pseudoprimes, composite numbers that for many bases survive the Solovay-Strassen primality test. We present a classification of Carmichael numbers, and use the knowledge gained from this to create a fast algorithm to compute new Euler pseudoprimes, by multiplying already found Euler pseudoprimes. We use this algorithm to find many Euler pseudoprimes that are pseudoprimes for several consecutive prime bases starting at 2, hence for all integer bases up to that number. The best Euler pseudoprime we find survives up to 211, i.e., survives the first 47 prime bases.
Read the full abstract
Optimization and Control · Cross-listed from econ.GN
Selecting representative community partitions under modularity degeneracy: the STAR method
Community detection based on modularity maximization is one of the most widely used approaches for uncovering mesoscale structures in complex networks. However, it is well known that the modularity function exhibits a highly degenerate optimization landscape: a large number of structurally distinct partitions attain close modularity values. This degeneracy raises issues of instability, reproducibility, and interpretability of the detected communities. We propose a simple and user-friendly post-processing method to address this problem by selecting a representative partition among the set of high-modularity solutions. The proposed approach is model-agnostic and can be applied a posteriori to the output of any modularity-based community detection algorithm. Rather than seeking the optimal partition in terms of modularity, our method aims to identify a solution that best represents the structural features shared across degenerate partitions. We compare our approach with consensus clustering methods, which pursue a similar objective, and show that the resulting partitions are highly consistent, while being obtained through a substantially simpler procedure that does not require additional optimization steps or external software packages. Moreover, unlike standard consensus clustering techniques, the proposed method can be applied to networks with both positive and negative edge weights, making it suitable for a wide range of applications involving signed networks and correlation-based systems, such as social, financial, and neuroscience networks. Overall, the method provides a practical and robust tool for handling degeneracy in modularity-based community detection, combining simplicity with broad applicability across different types of networks and real-world problems.
Read the full abstract
Analysis of PDEs
Capillary $L_p$-curvature problem
We prove a gradient estimate for a class of capillary curvature equations in the half-space. As an application, we prove the existence of an even, smooth, strictly convex solution to the even capillary $L_p$-curvature problem for all $1<p<k+1$ and all contact angles $\theta\in(0,\pi/2)$.