Related papers: The discrete cosine transform on triangles
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…
Without recourse to the sophisticated machinery of twisted group algebras, projective character tables and explicit values of 2-cocycles, we here present a simple algorithm to study the gauge theory data of D-brane probes on a generic…
Several problems of trigonometric approximation on a hexagon and a triangle are studied using the discrete Fourier transform and orthogonal polynomials of two variables. A discrete Fourier analysis on the regular hexagon is developed in…
In this paper, we demonstrate that many of the computational tools for univariate orthogonal polynomials have analogues for a family of bivariate orthogonal polynomials on the triangle, including Clenshaw's algorithm and sparse…
We establish Diophantine type estimates on shifts of trigonometric polynomials on the torus $\mathbb{T}^d$, as well as that of their square roots. These estimates arise from the spectral analysis of the quasi-periodic Schr\"odinger and the…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…
The Christoffel-Darboux kernels for orthogonal polynomials in several real variables are investigated within the context of the three term recurrence relation reformulated for this purpose. Examples of orthogonal polynomials on the unit…
The purpose of this short note is to show that the Christoffel-Darboux polynomial, useful in approximation theory and data science, arises naturally when deriving the dual to the problem of semi-algebraic D-optimal experimental design in…
Classical approximation bases such as Chebyshev polynomials provide principled and interpretable representations, but their multivariate tensor-product constructions scale exponentially with dimension and impose axis-aligned structure that…
As an extension of the 2D fractional Fourier transform (FRFT) and a special case of the 2D linear canonical transform (LCT), the gyrator transform was introduced to produce rotations in twisted space/spatial-frequency planes. It is a useful…
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
In this paper, we show how to discretize the abelian Chern-Simons gauge theory on generic planar lattices/graphs (with or without translational symmetries) embedded in arbitrary 2D closed orientable manifolds. We find that, as long as a…
The present chapter [submitted for publication in "Fourier Transforms, Theory and Applications", G. Nikolic (Ed.), InTech (Open Access Publisher), Vienna, 2011] is concerned with the introduction and study of a quadratic discrete Fourier…
In the present paper, a discrete differential calculus is introduced and used to describe dynamical systems over arbitrary graphs. The discretization of space and time allows the derivation of Heisenberg-like uncertainty inequalities and of…
We observe a property of orthogonality of the Mellin-Barnes transformation of the triangle one-loop diagrams, which follows from our previous papers [JHEP {\bf 0808} (2008) 106, JHEP {\bf 1003} (2010) 051, JMP {\bf 51} (2010) 052304]. In…
This paper focuses on improved edge model based on Curvelet coefficients analysis. Curvelet transform is a powerful tool for multiresolution representation of object with anisotropic edge. Curvelet coefficients contributions have been…
In the present work, we propose new tensor Krylov subspace method for ill posed linear tensor problems such as in color or video image restoration. Those methods are based on the tensor-tensor discrete cosine transform that gives fast…
We consider the transformation $\ev$ which associates to any element in a K-algebra A a function on the the set of its K-points. This is the analogue of the fundamental Gelfand transform. Both $\ev$ and its dual $\ev^*$ are the maps from a…
A mathematical relation between elements of one- and multi-dimensional discrete Fourier transforms (DFT) is found. A method of analysing the multi-dimensional data by their single one-dimensional (1-D) DFT is offered. An experiment of…