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

Numerical Analysis · Cross-listed from cs.CE

An Implicit Compact-Kernel Material Point Method for Computational Solid Mechanics

The numerical performance of the material point method (MPM) is strongly governed by the particle-grid kernel, which controls the trade-off among smoothness, locality, numerical diffusion, contact accuracy, and computational cost. Although wide-support smooth kernels can effectively suppress cell-crossing instability, they often introduce increased numerical diffusion, artificial contact gaps, and higher transfer cost. In contrast, the suitability of compact-kernel designs for implicit computational solid mechanics remains unclear. In this work, we develop an implicit formulation of the Compact-Kernel Material Point Method (CK-MPM) and assess its performance through benchmark problems in linear and nonlinear solid mechanics, including cantilever bending, Hertzian contact, narrow-clearance free fall, and colliding hyperelastic rings. The results show that implicit CK-MPM retains the advantages of compact support while preserving the smoothness required for robust large-deformation simulation. Compared with linear MPM, it reduces cell-crossing-induced stress noise and excessive numerical dissipation; compared with quadratic B-spline MPM, it improves contact locality and reduces artificial contact gaps and early-contact artifacts while maintaining comparable overall smoothness and accuracy. These results indicate that CK-MPM provides a viable implicit MPM framework for computational mechanics.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Safety-Certified CRT Sparse FFT: $\Omega(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case

Computing Fourier transforms of k-sparse signals, where only k of N frequencies are non-zero, is fundamental in compressed sensing, radar, and medical imaging. While the Fast Fourier Transform (FFT) evaluates all N frequencies in $O(N \log N)$ time, sufficiently sparse signals should admit sub-linear complexity in N. Existing sparse FFT algorithms using Chinese Remainder Theorem (CRT) reconstruction rely on moduli selection choices whose worst-case implications have not been fully characterized. This paper makes two contributions. First, we establish an $\Omega(k^2)$ adversarial lower bound on candidate growth for CRT-based sparse FFT when moduli are not pairwise coprime (specifically when $m_3 \mid m_1 m_2$), implying an $O(k^2 N)$ worst-case validation cost that can exceed dense FFT time. This vulnerability is practically relevant, since moduli must often divide N to avoid spectral leakage, in which case non-pairwise-coprime configurations can be unavoidable. Pairwise coprime moduli avoid the proven attack; whether analogous constructions exist for such moduli remains an open question. Second, we present a robustness framework that wraps a 3-view CRT sparse front end with lightweight certificates (bucket occupancy, candidate count) and an adaptive dense FFT fallback. For signals passing the certificates, the sparse path achieves $O(\sqrt{N} \log N + k N)$ complexity; when certificates detect collision risk, the algorithm reverts to $O(N \log N)$ dense FFT, guaranteeing worst-case performance matching the classical bound.
Read the full abstract

Dynamical Systems

AM2 model with a series configuration of interconnected chemostats and distinct removal rates

We investigate the dynamics of the AM2 model in a serial configuration of two interconnected chemostats with distinct dilution rates. The system is described by nonlinear differential equations, for which the usual reduction from an eight-dimensional system to a four-dimensional one is no longer possible due to the distinct dilution rates. We provide a complete qualitative study by characterizing all steady states and establishing necessary and sufficient conditions for the existence, multiplicity, and local stability of nine types of equilibria, expressed in terms of key operating parameters. We show that coexistence equilibria involving two species in the second bioreactor are not always stable, even when they exist, and require an additional condition related to the trace of the Jacobian matrix. Identifying parameter sets leading to Hopf bifurcations and limit cycles remains an open problem. These results provide new insights into the dynamics of interconnected bioreactors and motivate further investigations on oscillatory behaviors.
Read the full abstract

Representation Theory

Kazhdan-Lusztig Basis and Optimization

We describe a conjectural approach to obtaining canonical bases of the Hecke algebra at $q=1$ via continuous quadratic optimization. We focus on Specht modules $S^\lambda$ and proper cones inside $S^\lambda$ that are invariant under the action of $1+s$ for all simple reflections $s\in S$. We show that there are unique minimal and maximal cones invariant under all $1+s$. For hook shapes, two-column shapes, and partitions of the form $(n-2,2)$, we prove that the Kazhdan–Lusztig basis spans this maximal cone. More generally, we define an optimization problem over bases that are unitriangular with respect to the polytabloid basis, subject to the constraint that the operators $1+s$ act non-negatively. We prove that the feasible region forms a compact semialgebraic set, and interpret it in terms of a hierarchy of invariant cones under all $1+s$. We demonstrate that minimizing the trace of the Gram matrix uniquely recovers Young's seminormal basis. Furthermore, we verify computationally that maximization uniquely recovers the Kazhdan–Lusztig basis for all partitions of $n\leq 7$. In higher ranks, the optimization detects deviations from the Kazhdan–Lusztig basis and may favour other natural positive bases, such as the Springer basis or $p$-canonical bases. Finally, we extend this framework to irreducible representations of $\mathfrak{sl}_n$. We observe that the Gelfand–Tsetlin basis corresponds to the unique minimizer, and we conjecture that the canonical basis corresponds to the maximum in small ranks.
Read the full abstract

Dynamical Systems

Perturbation of the time-1 map of a generic volume-preserving $3$-dimensional Anosov flow

Let $s > 1$ be a large integer, and let $f$ be a diffeomorphism sufficiently close in the $C^{s}$-topology to the time-1 map of a $C^{s}$ generic volume-preserving Anosov flow on a $3$-dimensional compact manifold. We show that for any probability measure $\mu$ with smooth density, $f^n_* \mu$ converges exponentially fast to a common limit measure with full support. As corollaries, we show the following: $f$ is topologically mixing; $f$ has a unique physical measure with basin of full Lebesgue measure, which is also the unique u-Gibbs state; if $f$ is volume preserving, then $f$ is exponentially mixing with respect to the volume form. As applications, we give a class of time-1 maps of transitive Anosov flows non-approximable in $C^{s}$ by Axiom A maps, giving negative answer to a question of Palis-Pugh (1974); the first example of a $C^{s}$-stably transitive time-1 map of Anosov flow, a question mentioned in Bonatti-Guelman (2010), Rodriguez Hertz (2010); as well as the first example of a $C^{s}$-stably transitive diffeomorphism without periodic points.
Read the full abstract

Numerical Analysis

Matrix-Free Multigrid with Algebraically Consistent Coarsening on Adaptive Octrees

We present a matrix-free GPU multigrid preconditioner with algebraically consistent coarsening for solving Poisson equations on adaptive octree grids with irregular domains. Within uniform-resolution regions, the coarsening satisfies the Galerkin principle. At T-junctions between refinement levels, we propose a flux-consistent coarse-grid correction that restores cross-level consistency while preserving the compact matrix-free representation. The coarse operators are stored in a compact matrix-free form suitable for parallel execution on GPUs. Numerical experiments demonstrate second-order accuracy, grid-independent convergence when used with PCG, and robust performance on cut-cell problems arising in fluid simulation. On a single NVIDIA RTX 4090 GPU, the solver achieves full-solve throughputs above 200 million cells per second on analytical Poisson tests and above 70 million cells per second on pressure projection problems in fluid simulation.
Read the full abstract

Commutative Algebra

Geometry of numbers and degree bounds for rational invariants

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups, we also prove a new bound on the minimum degree $d$ such that the polynomials of degree $\leq d$ span the field of rational functions as a vector space over the invariant field. This latter quantity also bounds the degree $d$ such that the polynomials of degree $\leq d$ contain a copy of the regular representation of $G$, advancing an inquiry of Kollár and Tiep. The methods involve Euclidean lattices and Minkowski's geometry of numbers.
Read the full abstract

All authors Ben Blum-Smith, Sylvan Crane, Karla Guzman, Alexis Menenses, Maxine Song-Hurewitz

Number Theory

Algebraic numbers and Fourier analysis: Salem's third problem

In 1963, Raphaël Salem concluded his highly influential book “Algebraic Numbers and Fourier Analysis” with a list of four unsolved problems. The first two problems remain wide open while the last problem on the absolute continuity of Bernoulli convolutions has seen significant progress over the years including recent results by Shmerkin and Varjú. In this paper, we solve the third problem concerning the vanishing at infinity of the product of Fourier transforms of Bernoulli convolutions each of which does not vanish at infinity. Our solution uses tools in diophantine approximation such as the theory of Weil heights and Lang's general formulation of Roth's theorem.
Read the full abstract

Probability

Quantitative approximation of the Vlasov(-Fokker-Planck)-Navier-Stokes system by stochastic particle systems

This paper is concerned with a fluid-particle system given by the incompressible Navier-Stokes equations coupled with the Vlasov(-Fokker-Planck) equation through a drag force. Such a model arises naturally in the study of aerosols, sprays, and more generally two-phase flows. In dimensions $d\in \{2,3\}$, we establish a rate of convergence for a system of $N$ interacting stochastic particles coupled with a fluid, towards the Vlasov(-Fokker-Planck)-Navier-Stokes system, as $N\to \infty$. The case of particles with a noise that vanishes as $N\to \infty$ is considered and leads specifically to the Vlasov-Navier-Stokes system. More precisely, we prove that the empirical measure associated with the particle system converges to the Vlasov(-Fokker-Planck) component, while the fluid velocity converges to the Navier-Stokes component of the coupled system. The proofs combine stochastic calculus and PDE techniques to establish energy estimates and commutator estimates for both the discrete and continuous systems.
Read the full abstract

All authors Ludovic Goudenège, Christian Olivera, Gabriela Planas, Alexandre Richard

Combinatorics

Global Product Intersection Sets in Semigroups

For a family $(A_q)_{q\in Q}$ of subsets of a semigroup, the product intersection set records those exponents $h \in \mathbb{N}$ for which the $h$-fold product set of the intersection, $(\bigcap_q A_q)^h$, is equal to $\bigcap_q A_q^h$, the intersection of the product sets. Nathanson recently asked which subsets of $\mathbb{N}$ can occur as a product intersection set, both for arbitrary and for decreasing families $(A_q)_{q\in Q}$. We solve both problems by giving a complete classification. In particular, when $|Q| \ge 2$, we show that in either case any subset $X \subseteq \mathbb{N}$ with $1 \in X$ occurs as a product intersection set. Both classifications were autonomously discovered and formally verified in Lean by Aristotle, a formal reasoning agent developed by Harmonic.
Read the full abstract

Optimization and Control

A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones

In this work we develop and analyze a semi-smooth Newton method for the general nonlinear conic programming problem. In particular, we study the problem with a generalized simplicial cone, i.e., the image of a symmetric cone under a linear mapping. We generalize Robinson's normal equations to a conic setting, yielding what we call the conic projection equations. The resulting system is equivalent to the KKT conditions associated with the nonlinear conic programming problem. A semi-smooth Newton iteration is proposed for solving it, and local quadratic convergence is established. We study properties of generalized simplicial cones and prove strong semi-smoothness of the projection operator onto them. Numerical experiments compare the method against a recent smoothing Newton approach on the circular cone programming problem, and we also apply it to the low-rank matrix completion problem.
Read the full abstract

Complex Variables

Regularity of rooftop envelopes

We study continuity, Hölder regularity, and $C^{1,1}$-regularity of geodesics between continuous plurisubharmonic functions on bounded domains of $\mathbb{C}^n$. We then derive regularity properties of rooftop envelopes.

Dynamical Systems

Consensus and flocking with transmission and reaction delays

We investigate consensus formation and flocking behavior in multi-agent systems subject to two distinct types of delays: a transmission delay accounting for information exchange between agents, and a reaction delay representing the processing time before agents adjust their states. For a simplified linear two-agent system, we provide explicit insight into how these delays affect asymptotic stability. We then derive sufficient conditions for asymptotic consensus and flocking in the general multi-agent setting with a nonlinear, globally positive influence function. These conditions require the delays to be sufficiently small relatively to the initial data and the decay rate of the influence function. The analysis is based on a Lyapunov functional approach combined with a Halanay-type inequality. Our results establish rigorous conditions under which collective behavior emerges in delayed multi-agent systems where both communication and reaction lags are non-negligible, with applications to biological, social, and engineered systems.
Read the full abstract

Number Theory

Characterizing monogenic trinomials $\boldsymbol{x^{12}+ax^6+b}$ according to their Galois groups

Let $f(x)=x^{12}+ax^{6}+b\in {\mathbb Z}[x]$, with $ab\ne 0$. We say that $f(x)$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots,\theta^{11}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where $f(\theta)=0$. For each possible Galois group $G$ of $f(x)$ over ${\mathbb Q}$, we give explicit descriptions of all monogenic trinomials $f(x)$ having Galois group $G$. These results extend recent work on monogenic power-compositional quartic and sextic trinomials.
Read the full abstract

Optimization and Control

Integrated Routing and Trajectory Design for Satellite Servicing

This paper studies the integrated spacecraft routing and trajectory optimization problem for satellite servicing missions involving partial en-route propellant replenishment. Unlike terrestrial routing problems, spacecraft operate in a dynamic environment, and we need to optimize the spacecraft routing over a network with nonlinear and time-dependent trajectory costs. In this paper, we tackle this problem using two different formulations. The first formulation, referred to as the arc-based formulation, defines variables based on arcs and employs an iterative decoupling scheme that alternates between mixed-integer linear programming and sequential nonlinear trajectory optimization. The second formulation, referred to as the path-based formulation, defines variables based on paths/routes and leverages column generation and a labeling algorithm to accelerate the identification of promising routes. Through a geosynchronous satellite servicing case study and numerical experiments, we quantify the computational trade-offs between these two formulations in terms of the solution optimality, computational time, and robustness against non-converging or trivial solutions.
Read the full abstract

Group Theory

Weak order on groups generated by involutions

In this article, we propose to initiate the general study of involution systems. An involution system, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a weak order arising from orienting the Cayley graph of $(W,S)$. In the case of a Coxeter system $(W,S)$, Björner showed that the weak order is a complete meet-semilattice. This fact has many important consequences for Coxeter systems and their related structures. In this article, we discuss the following question: For which involution systems is the weak order a complete meet-semilattice? The class of involution systems that satisfies this condition is larger than the class of Coxeter systems (it contains, for instance, Cactus groups). In the case of an involution system with sign character, we provide a finite presentation by generators and relations and a classification in rank 3. We also obtain new characterizations of Coxeter systems in terms of the weak order, and prove a number of results on certain subclasses of these involution systems. Finally, we discuss further works and open problems in relation to biautomatic structures, geometric representations, mediangle graphs, and more.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

Sparse Network Inference under Imperfect Detection and its Application to Ecological Networks

Recovering latent structure from count data has received considerable attention in network inference, particularly when one seeks both cross-group interactions and within-group similarity patterns in bipartite networks, which are widely used in ecology research. Such networks are often sparse and prone to imperfect detection. Existing models mainly focus on interaction recovery, while the induced similarity graphs are much less studied. Moreover, existing models for under-counted data place sparsity, if at all, on the detection model rather than on these graphs. To address these issues, we propose a nonnegative low-rank factorization framework that jointly estimates detection probabilities and promotes sparse within- and cross-group graphs through $\ell_{1/2}$ regularization. For the resulting nonconvex, nonsmooth problem, we develop an ADMM-based algorithm with adaptive penalization, and establish asymptotic feasibility and KKT stationarity of cluster points under stated assumptions. We also give sufficient conditions for exact recovery of within- and cross-group graphs. On synthetic data with up to 20% missing entries, the method recovers the graphs and detection probabilities with competitive accuracy. Across three ecological datasets, it matches the baseline held-out predictions while estimating detection probabilities and within- and cross-group graphs.
Read the full abstract

All authors Aoran Zhang, Tianyao Wei, Maria J. Guerrero, César A. Uribe

Dynamical Systems

Qualitative Analysis of a Three-Stage Anaerobic Digestion Model with Microbial Decay

We extend a three-stage anaerobic digestion model by incorporating microbial mortality into the hydrolysis of particulate organic matter. The model describes hydrolysis, acidogenesis, and methanogenesis, each with distinct dilution and decay rates, and accounts for non-monotonic growth in order to capture substrate inhibition. Two hydrolysis mechanisms are considered: a first-order formulation and a biomass-dependent one. The latter distinguishes hydraulic washout from intrinsic mortality and leads to different persistence conditions. For both models, we establish well-posedness and prove the positivity and boundedness of solutions. We then characterize all equilibria and analyze their local stability with respect to key operating parameters. The inclusion of microbial mortality provides a more general and biologically relevant framework, thereby enriching the qualitative dynamics compared to the classical AM2 model.
Read the full abstract

Numerical Analysis · Cross-listed from physics.comp-ph

Nonuniform Iterative Phasing Framework and Sampling Requirements for 3D Dynamical Inversion from Coherent Surface Scattering Imaging

Coherent surface scattering imaging (CSSI) is an emerging experimental technique uniquely suited to probing the structure of thin nanostructures. In these experiments, a specimen is placed on a substrate, and a series of X-ray diffraction patterns is collected at grazing incidence angles as the specimen is rotated. However, reconstructing the specimen's 3D structure from the data is challenging due to dynamical scattering effects induced by the experimental geometry and the lack of direct phase measurements. Specifically, the data involves nonuniformly sampled Fourier-transform values of the specimen density, and failure to effectively address this nonuniformity can lead to errors or degraded performance. Here we introduce a mathematical inversion framework that combines iterative-projection-based phasing techniques with new fast nonuniform Fourier inversion methods to efficiently reconstruct isolated 3D structures from their CSSI rotation-series data. We also analyze the theoretical properties of CSSI reconstruction to derive requirements on experimental parameters and characterize solution uniqueness. We validate our approach using CSSI data simulated from a conical Siemens star and a porous medium, demonstrating that high-resolution 3D structures can be reconstructed even in the presence of significant dynamical scattering, from data collected at as few as one or two incident angles. More broadly, the presented nonuniform reconstruction framework provides a foundation for solving challenging generalizations of the phase problem in which measurements involve nonlinear combinations of nonuniformly sampled Fourier values.
Read the full abstract

All authors Jeffrey J. Donatelli, Miaoqi Chu, Zixi Hu, Zhang Jiang, Nicholas Schwarz, Jin Wang, James A. Sethian

Optimization and Control

Target Mirror Descent: A Unifying Framework for Solving Monotone Variational Inequalities

It is well known that mirror descent may diverge or cycle on merely monotone variational inequalities. In this paper, we propose Target Mirror Descent (TMD), a unified framework that stabilizes monotone flows via a target point correction mechanism in the dual update. By appropriate design choices, TMD recovers the proximal point algorithm, extragradient methods, splitting methods, Brown-von Neumann-Nash dynamics, forward-backward-forward dynamics, and discounted mirror descent as special cases. Thus, we establish a unified perspective on these landmark algorithms and their convergence. Beyond unification, we leverage the TMD framework to correct an equilibrium misalignment in discounted mirror descent and to generalize its higher-order extension beyond interior solutions. Moreover, a key structural feature of TMD is the explicit decoupling of the mirror map from the target determination, which enables geometric ensembles: multiple algorithms solve the same problem in parallel using distinct mirror maps, while sharing a common dual update. We show that such an ensemble rigorously reduces to a single TMD with a synthesized mirror map, and thus inherits these convergence guarantees.
Read the full abstract

Analysis of PDEs

Analysis of persistence thresholds for a nonlocal PDE–ODE model of bacterial persister cells

Within many bacterial colonies, persister cells exist as a subpopulation that is tolerant to antibiotics and other stressors, yet not genetically distinct from the rest of the colony. A recent study has proposed epigenetic inheritance as a mechanism that leads to the presence of persister cells. We analyze a nonlocal PDE–ODE model introduced in that study to describe the epigenetic inheritance process and establish its mathematical well-posedness, including existence, uniqueness, and nonnegativity of solutions. We identify a sharp parameter threshold delineating extinction from persistence of the colony: below this threshold the washout equilibrium is globally asymptotically stable, while above it a unique positive equilibrium exists and the population is weakly persistent. Notably, this threshold is independent of the internal community structure.
Read the full abstract

Differential Geometry

On singular Finsler foliations of $(\alpha,\beta)$-spaces

We investigate singular Finsler foliations (SFFs) on a manifold equipped with an $(\alpha,\beta)$-metric. To be precise, we verify that any SFF of an $(\alpha,\beta)$-space is, under some hypotheses on the metric, a singular Riemannian foliation (SRF). This gives a partial answer to the general question "under which conditions a SFF is a SRF with respect to some Riemannian metric". Moreover, we extend the proof of Molino's conjecture to SFFs whenever they are also a SRFs. Finally, we prove equifocality of the regular leaves for a SFF under the same condition.
Read the full abstract

Algebraic Geometry

Distributivity, affineness, and the structure sheaf

We observe that for a quasi-compact and quasi-separated scheme the structure sheaf generates the perfect complexes if and only if the lattice of thick subcategories is distributive if and only if the affinization map is 0-affine. Examples are discussed, including an example of a quasi-projective scheme which is not quasi-affine but for which these equivalent conditions hold.
Read the full abstract

Optimization and Control

Tropical low-rank approximation and application to optimal control of N-body systems

We study the approximation of the value function of deterministic optimal control problems with fixed initial state, motivated by \(N\)-body systems. In this setting, the action functional consists of local kinetic and potential terms, along with an interaction potential. We exploit this structure to approximate the value function using a tropical tensor of small rank, i.e.\ a supremum of a small number of additively separable functions. We propose a trajectory-based tropical low-rank approximation method. Rather than propagating basis functions globally, as in usual tropical numerical methods, the approximation of the value function is improved only along a sequence of relevant trajectories. The resulting approximations form a monotone family of computable lower bounds for the exact value function, with the tropical tensor rank increasing at most linearly with the number of outer iterations. Under suitable regularity assumptions, we show that at the initial state, and also at the optimal trajectory starting from this state, the lower bounds converge to the exact value. In the $N$-body setting, the generated basis functions remain additively separable across subsystems, thereby yielding a structured tropical low-rank approximation. Numerical experiments on $N$-body systems with Coulomb-type repulsion illustrate the effectiveness of the approach up to state dimension \(200\), within a half hour time budget.
Read the full abstract

All authors Marianne Akian, Stephane Gaubert, Shanqing Liu, Yang Qi

Optimization and Control

A Dynamic Mode Decomposition Approach to Parameter Identification

This paper develops a data-driven algorithm for simultaneous system and parameter identification in control-affine nonlinear systems. Parameter identification is achieved by training a data-driven predictive model using measurements collected across a prescribed set of known parameter values. The predictive model is then used to estimate unknown parameter values from measured trajectories by minimizing the trajectory prediction error using multi-start Nelder-Mead. Numerical experiments on the controlled Duffing oscillator with unknown damping, stiffness, and nonlinearity coefficients demonstrate accurate recovery of both the system trajectories and the unknown parameter values from data collected under open-loop excitation. Additional studies evaluate parameter recovery across randomly selected parameter values and the effects of training-set size, query-horizon length, measurement noise, and process noise.
Read the full abstract

Algebraic Geometry

On the Hurwitz existence problem for branched covers of the projective line

We give an alternative proof of the Hurwitz existence problem for branched covers of $\mathbb{P}^1$ in the case where the number of ramification points equals the number of branch points, that is, where all the ramification profiles are of the form $[e,1,\ldots,1]$ with $e \geq 2$.
Read the full abstract

Numerical Analysis

Diffusion Synthetic Acceleration for polytopic discretisations of Boltzmann transport

We present a computational study of diffusion synthetic acceleration (DSA) for the monoenergetic, isotropically scattering $S_N$ transport equations, discretised in space by a polytopic discontinuous Galerkin method. Using a discrete ordinates angular discretisation, we construct the DSA correction with an interior-penalty diffusion operator and compare a classical symmetric interior penalty (SIP) formulation with a modified interior penalty (MIP) variant, together with homogeneous Dirichlet and Marshak (Robin) diffusion boundary conditions imposed weakly in the DG framework. We quantify the observed convergence behaviour of the resulting source iteration across variations in optical thickness, scattering ratio, angular quadrature, mesh refinement, polynomial degree and mesh anisotropy on families of bounded Voronoi meshes. The results show that MIP-based DSA remains robust across the parameter ranges tested, whereas SIP-based DSA can lose robustness in the intermediate regime. In challenging optically thick, highly scattering settings, the observed convergence factors for the MIP-based schemes are typically below $0.6$.
Read the full abstract

All authors Ansar Calloo, Matthew Evans, François Madiot, Tristan Pryer

Combinatorics

The Isoperimetric Problem in Regular Trees

We investigate the inner vertex-isoperimetric problem on the $d$-regular tree $T_d$. We first determine the exact value of the inner vertex-isoperimetric profile $I_d(k) = \min\{ |\partial D| \mid D\subset T_d \text{ finite and connected},\ |D|=k \}$, and we then introduce a boundary invariant, called the boundary branching excess $\tau(D)$, and show that it provides a simple criterion for optimality. A domain $D\subset T_d$ is shown to be isoperimetrically optimal if and only if $\tau(D)\le d-2$. Finally, we show that every domain in $T_d$ admits a canonical decomposition as an iterated gluing of full domains, namely domains whose entire boundary consists of leaves. This yields a complete description of all inner vertex-isoperimetric minimizers in $T_d$.
Read the full abstract