Related papers: Functional Decomposition using Principal Subfields

This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…

A knotted surface in the 4-sphere may be described by means of a hyperbolic diagram that captures the 0-section of a special Morse function, called a hyperbolic decomposition. We show that every hyperbolic decomposition of a knotted surface…

Let C be the complex field and K=C((x,y)) or K=C((x))(y). Let G be a connected linear algebraic group over K. Under the assumption that the K-variety G is K-rational, i.e. that the function field is purely transcendant, it was proved that a…

In a previous paper [1] it was discussed the viability of functional analysis using as a basis a couple of generic functions, and hence vectorial decomposition. Here we complete the paradigm exploiting one of the analysis methodologies…

Let $\mathcal{K}=\mathbb{F}_q((x^{-1}))$. Analogous to orthogonality in the Euclidean space $\mathbb{R}^n$, there exists a well-studied notion of ultrametric orthogonality in $\mathcal{K}^n$. In this paper, we extend the work of…

For a family of functionals defined on a Hilbert manifold and smoothly depending on a compact finite dimensional manifold, we give a sufficient condition on the parameter space in such a way the family bifurcate from the trivial branch.

Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…

Let F be a non Archimedean locally compact field of residue characteristic different from 2, let G be a connected reductive group defined over F, let s be an involutive F-automorphism of G and H an open F-subgroup of the fixed points group…

Kernelization algorithms, usually a preprocessing step before other more traditional algorithms, are very special in the sense that they return (reduced) instances, instead of final results. This characteristic excludes the freedom of…

Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed…

We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…

The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the first subdiagonal) and a projection onto Sp(N). The lattice admits solutions such that the entries of the matrix L are rational in the time…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…

We give explicit, practical conditions that determine whether or not a closed, connected subgroup H of G = SU(2,n) has the property that there exists a compact subset C of G with CHC = G. To do this, we fix a Cartan decomposition G = K A K…

In this paper, we propose a new regression-based algorithm to compute Graph Fourier Transform (GFT). Our algorithm allows different regularizations to be included when computing the GFT analysis components, so that the resulting components…

Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

We present an algorithm for computing the structure of any submodule of the module of points of a Drinfeld $A$-module over a finite field, where $A$ is a function ring over $\mathbb F_q$. When the function ring is $A = \mathbb F_q[T]$, we…

We find the solution of the $\hat{sl}(3)_k$ singular vector decoupling equations on 3-point functions for the particular case when one of the fields is of weight $w_0\cdot k\Lambda_0$. The result is a function with non-trivial singularities…