English
Related papers

Related papers: Frame-type families of translates

200 papers

We impose standard $ T1 $-type assumptions on a Calder\'on-Zygmund operator $ T $, and deduce that for bounded compactly supported functions $ f, g $ there is a sparse bilinear form $ \Lambda $ so that $$ \lvert \langle T f, g \rangle\rvert…

Classical Analysis and ODEs · Mathematics 2016-12-20 Michael T. Lacey , Darío Mena

We propose an implementation of lambda+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of lambda+ is a rewrite system modulo an equivalence relation, which makes its…

Logic in Computer Science · Computer Science 2018-11-06 Alejandro Díaz-Caro , Pablo E. Martínez López

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underline{\lambda} = (\lambda_{1}, \dots{} ,\lambda_{k})$ with $1 \le \lambda_{1} < \lambda_{2} < \dots{} < \lambda_{k}$, we…

Number Theory · Mathematics 2023-03-20 Sándor Z. Kiss , Csaba Sándor

Let $j\geq 3$ be any fixed integer and $f$ be a primitive holomorphic cusp form of even integral weight $\kappa\geq 2$ for the full modular group $SL(2,\mathbb{Z})$. We write $\lambda_{{\rm{sym}^j }f}(n)$ for the $n^\text{th}$ normalized…

Number Theory · Mathematics 2026-01-27 Kampamolla Venkatasubbareddy

For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c…

Classical Analysis and ODEs · Mathematics 2016-08-02 K. Kopotun , D. Leviatan , A. Prymak , I. A. Shevchuk

We use deep sparsely connected neural networks to measure the complexity of a function class in $L^2(\mathbb R^d)$ by restricting connectivity and memory requirement for storing the neural networks. We also introduce representation system -…

Machine Learning · Computer Science 2021-08-17 Khay Boon Hong

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Rafał Stefański

Let $\mathfrak{g}$ be a reductive Lie algebra over an algebraically closed, characteristic zero field or over $\mathbb{R}$. Let $\mathfrak{q}$ be a parabolic subalgebra of $\mathfrak{g}$. We characterize the derivations of $\mathfrak{q}$ by…

Rings and Algebras · Mathematics 2015-11-03 Daniel Brice

I continue the investigation of a q-analogue of the convolution on the line started in a joint work with Koornwinder and based on a formal definition due to Kempf and Majid. Two different ways of approximating functions by means of the…

Classical Analysis and ODEs · Mathematics 2016-09-07 Giovanna Carnovale

A $GL_d$-pseudocharacter is a function from a group $\Gamma$ to a ring $k$ satisfying polynomial relations which make it "look like" the character of a representation. When $k$ is an algebraically closed field, Taylor proved that…

Representation Theory · Mathematics 2020-08-21 Matthew Weidner

A finitely generated shift invariant space $V$ is a closed subspace of $L^2(\R^d)$ that is generated by the integer translates of a finite number of functions. A set of frame generators for $V$ is a set of functions whose integer translates…

Functional Analysis · Mathematics 2013-12-13 Carlos Cabrelli , Carolina A. Mosquera , Victoria Paternostro

Let $\mathfrak g$ be a simple Lie algebra over an algebraically closed field $\bf k$ of characteristic zero and $\bf G$ its adjoint group. Let $\mathfrak q$ be a biparabolic subalgebra of $\mathfrak g$. The algebra $Sy(\mathfrak q)$ of…

Representation Theory · Mathematics 2015-03-11 Florence Fauquant-Millet , Anthony Joseph

Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…

Number Theory · Mathematics 2022-09-22 Evan O'Dorney

We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive…

Logic in Computer Science · Computer Science 2019-07-02 Lê Thành Dũng Nguyên

We establish various results on the structure of approximate subgroups in linear groups such as SL_n(k) that were previously announced by the authors. For example, generalising a result of Helfgott (who handled the cases n = 2 and 3), we…

Group Theory · Mathematics 2010-05-12 Emmanuel Breuillard , Ben Green , Terence Tao

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Programming Languages · Computer Science 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

Given an infinite set \Lambda of characters on a compact abelian group we show that \Lambda is a \Lambda(p)-set for all p>2 if and only if the limit order of the ideal of all \Lambda-summing operators coincides with that of the ideal of all…

Functional Analysis · Mathematics 2007-05-23 Carsten Michels

Let G be the absolute Galois group of a global field. Let r1 and r2 be two p-adic, finite dimensional representations of G. Then there exists a finite number of primes q such that if the characteristic polynomials of r1(Frob_q) and…

Number Theory · Mathematics 2019-05-28 Loic Grenie

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

Number Theory · Mathematics 2022-11-03 Chun Yin Hui

Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework…

Logic in Computer Science · Computer Science 2015-10-30 Anthony W. Lin , Truong Khanh Nguyen , Philipp Rümmer , Jun Sun
‹ Prev 1 4 5 6 7 8 10 Next ›