Related papers: Frame-type families of translates
Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $2$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ does not satisfy a zero-one law. This means that we can find a…
Frames of translates of f in L^2(G) are characterized in terms of the zero-set of the so-called spectral symbol of f in the setting of a locally compact abelian group G having a compact open subgroup H. We refer to such a G as a number…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
We propose a local Legendre frame (LLF) method for function approximation from equispaced data on a finite interval. Motivated by the difficulty of stable high-order polynomial approximation at equispaced points, especially in the presence…
Approximate solutions to functional evolution equations are constructed through a combination of series and conjugation methods, and relative errors are estimated. The methods are illustrated, both analytically and numerically, by…
We have for positive integers $n$, $k$ and finite field $\mathbb{F}_q$, $c(n,k,q)$, as the number of simultaneous similarity classes of $k$-tuples of commuting $n\times n$ matrices over the $\mathbb{F}_q$. In this paper, it has been shown…
It is shown that path algebras modulo relations of the form $\Lambda = KQ/I$, where $Q$ is a quiver, $K$ a coefficient field, and $I \subseteq KQ$ the ideal generated by all paths of a given length, can be readily analyzed homologically,…
There are several ways to formally represent families of data, such as lambda terms, in a type theory such as the dependent type theory of Coq. Mathematical representations are very compact ones and usually rely on the use of dependent…
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…
We prove that if $G$ is a finite simple group, then all irreducible complex representations of $G$ by be realized over the real numbers if and only if every element of $G$ may be written as a product of two involutions in $G$. This follows…
Let p at least 5 be prime. We construct a fully faithful functor from the derived category of all smooth p-adic representations of GL_2(Q_p) (with a fixed central character) to a derived category of Ind-coherent sheaves on a stack of…
The L-function $ L(\rho_\lambda, s) $ of an almost everywhere unramified $ \lambda $-adic representation $ \rho_\lambda $ of a global function field $ \mathbb{F}_q(C) $ is known to be a rational function in $ q^{-s} $ satisfying a…
We consider ways to construct a transducer for a given set of input word to output symbol pairs. This is motivated by the need for representing game playing programs in a low-level mathematical format that can be analyzed by algebraic…
The main step in numerical evaluation of classical Sl2 (Z) modular forms and elliptic functions is to compute the sum of the first N nonzero terms in the sparse q-series belonging to the Dedekind eta function or the Jacobi theta constants.…
Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…
We introduce an alternative to the notion of `fast rate' in Learning Theory, which coincides with the optimal error rate when the given class happens to be convex and regular in some sense. While it is well known that such a rate cannot…
In solving $q$-difference equations, and in the definition of $q$-special functions, we encounter formal power series in which the $n$th coefficient is of size $q^{-\binom{n}{2}}$ with $q\in(0,1)$ fixed. To make sense of these formal…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…