Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

162324486648 · Jun 202019922001200920172026
48 results for Mathieu functions

We describe two methods for computing the low-dimensional integral homology of the Mathieu simple groups and use them to make computations such as $H_5(M_{23},\ZZ)=\ZZ_7$ and $H_3(M_{24},\ZZ)=\ZZ_{12}$. One method works via Sylow subgroups. The other method uses a Wythoff polytope and perturbation techniques to produce…

2008-12-22abs ↗pdf ↗

We present reformulation of Mathieu's result on representing cohomology classes of symplectic manifold with symplectically harmonic forms. We apply it to the case of foliated manifolds with transversally symplectic structure and to symplectic orbifolds. We obtain in particular that such representation is always possibl…

2010-01-14abs ↗pdf ↗

Eguchi, Ooguri, and Tachikawa recently conjectured a new moonshine phenomenon. They conjecture that the coefficients of a certain mock modular form H(tau), which arises from the K3 surface elliptic genus, are sums of dimensions of irreducible representations of the Mathieu group M24. We prove that H(tau) surprisingly a…

2012-07-21abs ↗pdf ↗

Random walks on hyperbolic spaces follow predictable large deviation principles.

problem Understanding the behavior of random walks on hyperbolic spaces.
method Large deviation principles for displacement and translation distances.
result Translation and displacement distances satisfy large deviation principles with the same rate function.

We first show that every quasisimple sporadic group possesses an unmixed strongly real Beauville structure aside from the Mathieu groups M11 and M23 (and possibly 2B and M). We go on to show that no almost simple sporadic group possesses a mixed Beauville structure. We then go on to use the exceptional nature of the al…

2010-07-28abs ↗pdf ↗

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

2015-07-15abs ↗pdf ↗

Proves a conjecture about the maximum tet-volume of triangulations of a 2-sphere.

problem Proving the conjectured maximum tet-volume for all triangulations of a 2-sphere.
method Simplified version of Mathieu and Thurston's combinatorial proof using more general volume notions.
result Proves the full conjecture about the maximum tet-volume for all triangulations of a 2-sphere.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. We work with a generalization of unknotting number due to Mathieu-Domergue, which we call the untwisting number. The p-untwisting number is the minimum number (over all diagrams of a knot) of full twist…

2016-04-11abs ↗pdf ↗

Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.

problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.

FFBO optimizes functions as inputs and outputs, improving on existing BO methods.

problem Optimizing functions as both inputs and outputs in complex systems.
method Function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel, scalar upper confidence bound (UCB) acquisition function, and scalable functional gradient ascent algorithm (FGA).
result FFBO outperforms existing methods in synthetic and real-world data.

Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…

2015-01-25abs ↗pdf ↗

The Fridman function is bounded by the injectivity radius for certain hyperbolic manifolds.

problem Bounding the Fridman function for hyperbolic manifolds.
method Analyzing the relationship between the Fridman function and the injectivity radius function.
result The Fridman function is bounded above by the injectivity radius function for certain hyperbolic manifolds.

The paper extends mixability theory to function-valued forecasts, proving various loss functions are mixable.

problem Efficient aggregation of functional and probabilistic forecasts in online prediction games.
method Adapting mixable and exponentially concave loss functions to function-valued forecasts.
result Various loss functions used for probabilistic forecasting are mixable (exp-concave).

The paper proves isoparametric functions on Finsler space forms under specific conditions.

problem Understanding isoparametric functions in Finsler space forms.
method Proving transnormal functions as isoparametric functions and constructing global and local isoparametric functions using the distance function.
result Generalization of Theorem B to Finsler space forms.

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Robustifies elicitable functionals to handle small distribution misspecifications.

problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.

The paper characterizes strong Hamel functions using symmetries and proves their preservation properties.

problem Characterizing strong Hamel functions and their symmetries in Finsler spaces.
method Analyzing geodesic spray, strong dual symmetries, and strong dynamical symmetries.
result Strong Hamel functions can be characterized in terms of strong dual symmetries and strong dynamical symmetries.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

The paper connects convex functions to p-subharmonic functions and proves their equivalence.

problem Understanding the relationship between convex functions and p-subharmonic functions.
method Average principle, variational methods, and PDE techniques.
result Convex functions on R^n are p-subharmonic for every p > 1.

Study stabilizers of smooth functions on surfaces, focusing on Morse-Bott functions.

problem Understanding the homotopy type of stabilizers of smooth functions on surfaces.
method Analyzing the homotopy properties of stabilizers for a specific class of smooth functions.
result The homotopy type of the connected component of the identity map of the stabilizer is completely described for Morse-Bott functions.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.

New model for network analysis using functional data.

problem Existing network models treat nodes as functions, but this paper introduces functional edges.
method Transform adjacency matrix into functional adjacency tensor, apply Tucker decomposition, regularize basis matrices, and solve tensor completion problem.
result The model effectively captures community structure and handles irregular functional edge data.

The study finds a special type of smooth function on connected sums of manifolds.

problem Finding smooth functions that are Morse on preimages of non-extrema values.
method Investigates internally Morse (I-Morse) and neat with respect to Reeb graph (N-Reeb) functions.
result Constructs an IN-Morse-Reeb function on a connected sum of given manifolds.

NeuTSFlow models continuous functions behind time series forecasting.

problem Forecasting treats time series as discrete sequences, ignoring their continuous nature.
method NeuTSFlow uses Neural Operators to learn the transition between historical and future function families.
result NeuTSFlow outperforms traditional methods in forecasting accuracy and robustness.

New spectral functionals for Dirac operators with inner fluctuations computed.

problem Spectral functionals and Dirac operators with inner fluctuations.
method Extension of spectral functionals for Dirac operators with inner fluctuations.
result Computed spectral Einstein functional for Dirac operator with inner fluctuations on even-dimensional spin manifolds.

Regularizers change the geometric properties of loss functions in neural networks.

problem Understanding how different regularizers affect the geometric properties of loss functions in neural networks.
method Examined several regularizers, including weight decay, to determine if the regularized loss function becomes Morse.
result For certain regularizers, the regularized loss function becomes Morse, indicating a change in geometric properties.

Proposes an L1-regularized functional SVM for binary classification with functional covariates.

problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.

In this paper we propose and study a family of sparsity-inducing penalty functions. Since the penalty functions are related to the kinetic energy in special relativity, we call them \emph{kinetic energy plus} (KEP) functions. We construct the KEP function by using the concave conjugate of a χ2χ^2-distance function and …

2013-07-22abs ↗pdf ↗

The paper calculates asymptotic expansions for specific types of oscillatory integrals.

problem Analyzing oscillatory integrals with complex phase functions.
method Using asymptotic expansions of simpler phase functions to derive results for more complex cases.
result Explicit computation of coefficients in asymptotic expansions for certain integrals.

Defines 'nowhere coexpanding functions' and studies their fixed points.

problem Understanding fixed points of nowhere coexpanding functions.
method Defines and studies C1C^1 nowhere coexpanding functions, including C3C^3 functions with non-positive Schwarzian derivative.
result Establishes results on the number and nature of fixed points, generalizing Singer's result.