arXiv preprints from January 1, 2026 through September 7, 2026 — 12:07:31 EST
The interleaving distance is arguably the most widely used metric in topological data analysis (TDA) due to its applicability to a wide array of inputs of interest, such as (multiparameter) persistence modules, Reeb graphs, merge trees, and zigzag modules. However, computation of the interleaving distance in the vast majority of this...
In [R. J. Baraldi and D. P. Kouri, Math. Program., 201:1 (2023), pp. 559-598], the authors introduced a trust-region method for minimizing the sum of a smooth nonconvex and a nonsmooth convex function, the latter of which has an analytical proximity operator. While many functions satisfy this criterion, e.g., the $\ell_1$-norm defined...
Suppose $F$ is a finite unramified extension of $\mathbb{Q}_p$, and $G$ is the group of $F$-points of a split, connected, reductive group over $F$. Under a natural restriction on $p$, we determine the structure of the graded mod $p$ Iwasawa algebra $\textrm{gr}_{\mathfrak{m}}(\mathbb{F}_p [\![ I]\!])$, where $I$ is a pro-$p$ Iwahori...
Sarmanov copulas offer a simple and tractable way to build multivariate distributions by perturbing the independence copula. They admit closed-form expressions for densities and many functionals of interest, making them attractive for practical applications. However, the complex conditions on the dependence parameters to ensure that...
In the paper, we revisit several approaches to the concept of uniform completion $X^{\mathrm{ru}}$ of a vector lattice $X$. We show that many of these approaches yield the same result. In particular, if $X$ is a sublattice of a uniformly complete vector lattice $Z$ then $X^{\mathrm{ru}}$ may be viewed as the intersection of all...
This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. The first part of the research...
Non-linear statistical inverse problems pose major challenges both for statistical analysis and computation. Likelihood-based estimators typically lead to non-convex and possibly multimodal optimization landscapes, and Markov chain Monte Carlo (MCMC) methods may mix exponentially slowly. We propose a class of computationally tractable...
In this paper, we contribute to the Kuperberg program by giving a diagrammatic presentation of generators and relations for the affine $E_7$ unshaded subfactor planar algebra. Using this presentation, we prove that its jellyfish algorithm is a well-defined surjection onto $\mathbb{C}$. In particular, this shows that the jellyfish...
In this paper we consider reduction of the stochastic Hamilton-Pontryagin principle formulated on the Pontryagin bundle of a manifold $Q$. We prove that a stochastic action invariant under the free and proper action of a Lie group $G$ drops to a reduced variational principle expressed in terms of variables of the Pontryagin bundle of...
This work concerns the computation of ground states of two-component spin-orbit coupled Bose-Einstein condensates (SO-coupled BECs), modelled by a coupled nonlinear eigenvalue problem of Gross-Pitaevskii type. Spin-orbit coupling gives rise to fascinating phenomena, including supersolid-like phases with spatially modulated densities....
Consider a unit-intensity point process $Π$ on the vertex set $V$ of a transitive non-amenable unimodular graph. We study invariant matchings between $Π$ and $V$ having small typical matching distances. When $Π$ is either a Poisson process or i.i.d. perturbations of the vertex set, we determine the optimal matching distance and show...
We develop a space-time spectral element method for topology optimization of transient heat conduction. The forward problem is discretized with summation-by-parts (SBP) operators, and interface/boundary and initial/terminal conditions are imposed weakly via simultaneous approximation terms (SAT), yielding a stable monolithic...
Previous analysis of the Newell-Whitehead-Segel equation proved the best solution is null; although, the method of solution generated complex nested integrals, therefore, difficult to analyze \cite{NWSgen,NWS2020}. Recent insights into the properties of the convolution integral enable considerable simplification of the solution in the...
We obtain a local central limit theorem for cocycles associated with a class of non abelian and non compact group extensions of Gibbs Markov maps. This class consists of multidimensional infinite dihedral groups. Unlike in the set up of the random walks on groups, we cannot use the convolution of measures on the group and instead we...
S.E. Hans paper, Remarks on Pseudocovering Spaces in a Digital Topological Setting: A Corrigendum, is meant to address errors in previous papers. However, this paper is also marked by errors in its mathematics, as well as improprieties in its citations. We address these flaws in the current work.
We introduce triple crossing diagram (TCD) maps, which encode projective configurations of points and lines, as a unified framework for constructions arising in various areas of geometry, such as discrete differential geometry, discrete geometric dynamics and hyperbolic geometry. We define two types of local moves for TCD maps, one of...
Under a sign assumption on the Minkowski norm, we prove a monotonicity formula for anisotropic minimal hypersurfaces in Euclidean space.
For the $1+1$ dimensional nonlinear damped stochastic Klein-Gordon equation driven by space-time white noise, we prove that the second-order increments of the solution can be approximated, after scaling with the diffusion coefficient, by those of the corresponding linearized stochastic Klein-Gordon equation. This extends the result of...
We study equivariant perfect matchings on the Boolean hypercube $\B^6$ under the Klein four-group $K_4 = \langle \comp, \rev \rangle$ generated by bitwise complement and reversal. Among matchings using only $\comp$ or $\rev$ pairings, there is a unique Hamming-cost minimizer, given by a simple ``reverse-priority rule'': pair each...
A marker-and-cell finite difference method is developed for solving the two dimensional and three dimensional linear elasticity in the displacement-stress formulation on staggered grids. The method employs a staggered grid arrangement, where the displacement components are approximated on the midpoints of cell edges, the normal...
Let $D$ be a totally definite quaternion algebra over a totally real number field $F$, and $\mathcal{O}$ be an $O_F$-order (of full rank) in $D$. The type number $t(\mathcal{O})$ is an important arithmetic invariant of $\mathcal{O}$ that counts the number of isomorphism classes of orders belonging to the same genus as $\mathcal{O}$...
The Fortuin-Kasteleyn-Ginibre (FKG) inequality is an invaluable tool in monotone spin systems satisfying the FKG lattice condition, which provides positive correlations for all coordinate-wise increasing functions of spins. This inequality has numerous applications and plays an integral role in the proof of various central limit...
We provide a discussion of Jordan decompositions in the Lie algebra, and the dual Lie algebra, of a reductive group in as uniform a way as possible. We give a counterexample to the claim that Jordan decompositions on the dual Lie algebra are unique, and state an upper bound on how non-unique they can be. We also prove some...
We extend a property of Mazzola's theory of cadential sets in relation to the modulation between minor and major tonalities from triadic to tetradic harmony, using the PLRQ group of Cannas et al. (2017) as the analogue of the classical PLR group. While the PLR group connects triadic cadential sets via the relative morphism $R$, the...
This article focuses on the construction of left-continuous t-norms on complete lattices. The concepts of $\mathfrak{f}$-mappings and weak $\mathfrak{f}$-mappings on complete lattices are first introduced, respectively. They are then applied to establish the following key results: weak $\mathfrak{f}$-mappings are used to induce...