English
Related papers

Related papers: Frame-type families of translates

200 papers

The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…

Logic in Computer Science · Computer Science 2012-03-29 Pablo Buiras , Alejandro Díaz-Caro , Mauro Jaskelioff

We study spanning properties of a family of functions translated along simple model sets. We characterize tight frame and dual frame generators for such irregular translates and we apply the results to Gabor systems. We use the connection…

Functional Analysis · Mathematics 2019-02-21 Ewa Matusiak

We discuss the nearest lambda_q--multiple continued fractions and their duals for lambda_q = 2 cos(pi/q) which are closely related to the Hecke triangle groups G_q, q=3,4,... . They have been introduced in the case q=3 by Hurwitz and for…

Number Theory · Mathematics 2010-04-27 Dieter Mayer , Tobias Mühlenbruch

We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan

A shift-invariant system is a collection of functions $\{g_{m,n}\}$ of the form $g_{m,n}(k) = g_m(k-an)$. Such systems play an important role in time-frequency analysis and digital signal processing. A principal problem is to find a dual…

Numerical Analysis · Mathematics 2025-10-20 Thomas Strohmer

Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…

Numerical Analysis · Mathematics 2023-07-13 Richard Mikael Slevinsky

The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…

Logic in Computer Science · Computer Science 2015-07-01 Pablo Arrighi , Alejandro Diaz-Caro

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2012-08-01 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

We show that if $\mathcal{L}_1$ and $\mathcal{L}_2$ are linear transformations from $\mathbb{Z}^d$ to $\mathbb{Z}^d$ satisfying certain mild conditions, then, for any finite subset $A$ of $\mathbb{Z}^d$, $$|\mathcal{L}_1 A+\mathcal{L}_2…

Combinatorics · Mathematics 2024-11-21 David Conlon , Jeck Lim

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

Functional Analysis · Mathematics 2009-12-22 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

Let $(T,{\cal F},\mu)$ be a $\sigma$-finite measure space, $E$ a separable real Banach space and $p\geq 1$. Given a sequence of functions $f, f_1, f_2,...$ from $T\times E$ to ${\bf R}$, under general assumptions, we prove that, for each…

Functional Analysis · Mathematics 2025-12-10 Biagio Ricceri

We describe several families of permutation polynomials obtained using functions with linear translators.

Number Theory · Mathematics 2009-05-08 Gohar M. Kyureghyan

Let a sequence $\Lambda\subset\mathbb{C}$ be such that the corresponding system of exponential functions $\mathcal{E}(\Lambda):=\{e^{i\lambda t}\}_{\lambda\in\Lambda}$ is complete and minimal in $L^2(-\pi,\pi)$ and thus each function $f\in…

Complex Variables · Mathematics 2015-02-04 Yurii Belov , Yurii Lyubarskii

We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…

Logic in Computer Science · Computer Science 2008-06-12 Fritz Müller

We characterize, in terms of the Beurling-Malliavin density, the discrete spectra $\Lambda\subset\R$ for which a generator exists, that is a function $\phi\in L^1(\R)$ such that its $\Lambda$-translates $\phi(x-\lambda), \lambda\in\Lambda$,…

Classical Analysis and ODEs · Mathematics 2007-05-23 Joaquim Bruna , Alexander Olevskii , Alexander Ulanovskii

Let $G$ be a group with a finite subgroup $H$. We define the $L^2$-multiplicity of an irreducible representation of $H$ in the $L^2$-homology of a proper $G$-CW-complex. These invariants generalize the $L^2$-Betti numbers. Our main results…

Group Theory · Mathematics 2020-03-25 Steffen Kionke

Let $\mathbb N$ be the set of positive integers, and denote by $\lambda(A)=\inf\{t>0:\sum_{a\in A} a^{-t}<\infty\}$ the convergence exponent of $A\subset\mathbb N$. For $0<q\le 1$, $0\le q\le 1$, respectively, the admissible ideals…

Number Theory · Mathematics 2020-05-11 János T. Tóth , József Bukor , Ferdinánd Filip , László Zsilinszky

Given lacunary sequence of integers, $n_k$, $n_{k+1}/n_k>\lambda>1$, we define a new sequence $\{m_k\}$ formed by all possible $l$-wise sums $\pm n_{k_1}\pm n_{k_2}\pm \ldots\pm n_{k_l}$. We prove if $\lambda>\lambda_l$, then any series…

Classical Analysis and ODEs · Mathematics 2022-04-05 Grigori A. Karagulyan , Vahe G. Karagulyan

In this paper, we prove the pointwise convergence and the rate of pointwise convergence for a family of singular integral operators in two-dimensional setting in the following form: \begin{equation*} L_{\lambda }\left( f;x,y\right)…

Functional Analysis · Mathematics 2017-01-26 Mine Menekse Yilmaz , Lakshmi Narayan Mishra , Gumrah Uysal

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

Information Theory · Computer Science 2016-12-13 Nastja Cepak , Pascale Charpin , Enes Pasalic