Related papers: Real and complex spherical designs and their Grami…
Laplacian pyramid based Laurent polynomial (LP$^2$) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
We investigate the segregation pattern formations of strongly and weakly fluctuated Brownian particle mixtures, which are confined in spherical containers with finite volumes. We consider systems where the container restricts the motions of…
We introduce a new class of computationally tractable scattering problems in unbounded domains, which we call decomposable problems. In these decomposable problems, the computational domain can be split into a finite collection of…
System Gramian matrices are a well-known encoding for properties of input-output systems such as controllability, observability or minimality. These so-called system Gramians were developed in linear system theory for applications such as…
The computation of the effect of a simple monodromy defect in the case of a sphere with twisted boundary conditions is revisited and streamlined using earlier calculations for a similar system. Compact and explicit expressions are found for…
In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…
Let $G$ be a connected reductive algebraic group over $\mathbb{C}$ with a maximal compact subgroup $K$. Let $G/H$ be a (quasi-affine) spherical homogeneous space. In the first part of the paper, following Akhiezer's definition of spherical…
We introduce the notion of a "crystallographic sphere packing," defined to be one whose limit set is that of a geometrically finite hyperbolic reflection group in one higher dimension. We exhibit for the first time an infinite family of…
We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…
A higher order theory of gravitation is considered which is obtained by modifying Einstein field equations. The Lagrange used to modify this in the form a polynomial in (scalar curvature) R. In this equation we have studied spherical…
We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of…
Factorial designs have broad applications in agricultural, engineering and scientific studies. In constructing and studying properties of factorial designs, traditional design theory treats all factors as nominal. However, this is not…
We give a definition of the notion of spherical varieties in the world of complex supervarieties with actions of algebraic supergroups. A characterization of affine spherical supervarieties is given which generalizes a characterization in…
Spin-weighted spherical functions provide a useful tool for analyzing tensor-valued functions on the sphere. A tensor field can be decomposed into complex-valued functions by taking contractions with tangent vectors on the sphere and the…
The eigenfamilies of Gudmundsson and Sakovich can be used to generate harmonic morphisms, proper $r$-harmonic maps, and minimal co-dimension $2$ submanifolds. This article begins by characterising the globally defined eigenfamilies of the…
A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
We introduce and study the spherical dimension, a natural topological relaxation of the VC dimension that unifies several results in learning theory where topology plays a key role in the proofs. The spherical dimension is defined by…