English
Related papers

Related papers: Systems formed by translates of one element in $L_…

200 papers

In the algorithmic (Kolmogorov) view, agents are programs that track and compress sensory streams using generative programs. We propose a framework where the relevant structural prior is simplicity (Solomonoff) understood as…

Machine Learning · Computer Science 2025-10-14 Giulio Ruffini

Word embeddings are a powerful natural language processing technique, but they are extremely difficult to interpret. To enable interpretable NLP models, we create vectors where each dimension is inherently interpretable. By inherently…

Computation and Language · Computer Science 2021-09-29 Adly Templeton

We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…

Machine Learning · Computer Science 2018-05-25 Anastasios Kyrillidis

A classification of weakly compact multiplication operators on L(L_p), $1<p<\infty$, is given. This answers a question raised by Saksman and Tylli in 1992. The classification involves the concept of $\ell_p$-strictly singular operators, and…

Functional Analysis · Mathematics 2007-08-06 William B. Johnson , Gideon Schechtman

Starting from a N=1 scalar supermultiplet in 2+1 dimensions, we demonstrate explicitly the appearance of induced N=1 vector and scalar supermultiplets of composite operators made out of the fundamental supersymmetric constituents. We…

High Energy Physics - Theory · Physics 2008-11-26 Jean Alexandre , Nick E. Mavromatos , Sarben Sarkar

The aim of the paper is to introduce the spaces $\ell_{\infty}^{\lambda}(\widehat{F})$ and $\ell_{p}^{\lambda}(\widehat{F})$ derived by the composition of the two infinite matrices $\Lambda=(\lambda_{nk})$ and $\widehat{F}=\left( f_{nk}…

Functional Analysis · Mathematics 2017-06-23 Anupam Das , Bipan Hazarika , Feyzi Başar

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

Given an L_{\omega_1 \omega}-elementary class C, that is the collection of the countable models of some L_{\omega_1 \omega}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations of, respectively, isomorphism and…

Logic · Mathematics 2011-12-05 Luca Motto Ros

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

The aim of this paper is twofold. On the one hand, we compute, in terms of $r$ and $s$, the indices $p$ for which $\ell_p$ isomorphically embeds into the mixed-norm separable spaces $L_s(L_r)$, $\ell_s(L_r)$, $L_s(\ell_r)$ and…

Functional Analysis · Mathematics 2025-03-04 José L. Ansorena , Glenier Bello

Let $p\geq 5$ be a prime number. We generalize the results of E. de Shalit about supersingular $j$-invariants in characteristic $p$. We consider supersingular elliptic curves with a basis of $2$-torsion over $\overline{\mathbf{F}}_p$, or…

Number Theory · Mathematics 2017-04-25 Adel Betina , Emmanuel Lecouturier

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Classical Analysis and ODEs · Mathematics 2018-01-31 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

In this paper, we investigate some topics around the closed image $S$ of a rational map $\lambda$ given by some homogeneous elements $f_1,...,f_n$ of the same degree in a graded algebra $A$. We first compute the degree of this closed image…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Jean-Pierre Jouanolou

Let $(X,\left\Vert \cdot \right\Vert )$ be a real normed space of dimension $N\in \mathbb{N}$ with a basis $(e_{i})_{1}^{N}$ such that the norm is invariant under coordinate permutations. Assume for simplicity that the basis constant is at…

Functional Analysis · Mathematics 2014-01-03 Daniel Fresen

Let $1<p\not=2<\infty$, $\epsilon>0$ and let $T:\ell_p(\ell_2)\overset{into}{\rightarrow}L_p[0,1]$ be an isomorphism. Then there is a subspace $Y\subset \ell_p(\ell_2)$ $(1+\epsilon)$-isomorphic to $\ell_p(\ell_2)$ such that: $T_{|Y}$ is an…

Functional Analysis · Mathematics 2011-03-02 Ran Levy , Gideon Schechtman

We study Calder\'on-type commutators $[M_b,T_i\mathcal R_j]$ in the rational Dunkl setting with a finite reflection group $G$. If $b$ belongs to the orbit Lipschitz class $\operatorname{Lip}_d$, then for every $1<p<\infty$ we prove…

Classical Analysis and ODEs · Mathematics 2026-05-26 Yongsheng Han , Ming-Yi Lee , Ji Li , Eric Sawyer , Liangchuan Wu

If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…

Logic · Mathematics 2023-06-27 Miloš S. Kurilić

We prove that for all $p>1$, every relatively hyperbolic group has $\ell^p$ compression exponent equal to the minimum of the exponents of its maximal parabolic subgroups. Moreover, this embedding can be explicitly described in terms of…

Metric Geometry · Mathematics 2013-10-17 David Hume

We prove that a WLD subspace of the space $\ell_\infty^c(\Gamma)$ consisting of all bounded, countably supported functions on a set $\Gamma$ embeds isomorphically into $\ell_\infty$ if and only if it does not contain isometric copies of…

Functional Analysis · Mathematics 2018-07-17 William B. Johnson , Tomasz Kania

The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…

Logic in Computer Science · Computer Science 2019-12-02 Ferruccio Guidi