相关论文: Type $1$ and $2$ sets for series of translates of …

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…

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…

This survey paper is based on a talk given at the 44th Summer Symposium in Real Analysis in Paris. This line of research was initiated by a question of Haight and Weizs\"aker concerning almost everywhere convergence properties of series of…

Denotational models of type theory, such as set-theoretic, domain-theoretic, or category-theoretic models use (actual) infinite sets of objects in one way or another. The potential infinite, seen as an extensible finite, requires a dynamic…

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…

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…

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

Previously, mathematicians Steven Krantz and Jeffery McNeal studied a type of positive numbers permutation called $\lambda$-permutation. This type of permutation, when applied to the index of terms of a series, is defined to be both…

Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type {\Omega}, the auto- autoapplication and they thus do not ensure any form of normalization/productivity. Moreover, in most…

It is well-known that the functions $f \in L^1(\mathbb{R}^d)$ whose translates along a lattice $\Lambda$ form a tiling, can be completely characterized in terms of the zero set of their Fourier transform. We construct an example of a…

This is the first part of our work which is devoted to the uniqueness sets for spaces of entire functions. In this part we consider a set $\Lambda$ with angular density with respect to the order $\rho>0,$ satisfying the Lindel\"of…

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

The Dirichlet lambda function $\lambda(s)$ is defined for $\mathrm{Re}(s) > 1$ by \[ \lambda(s) = \sum_{n=0}^{\infty} \frac{1}{(2n+1)^s}. \] This function was initially studied by Euler on the real line, where he denoted it by $N(s)$. In…

We prove that if $A,B$ are compact subsets of $\mathbb{R}$ such that the upper density of $B$ is positive at every point of $B$, then there is a closed null set $N\subset A$ such that $N+B=A+B$. As a corollary we find that if $A,B\subset…

It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…

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…

Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

We provide a characterization of discrete sets $\Lambda \subset \mathbb{R}$ that admit a function whose $\Lambda$-translates are complete in the Hardy space $H^1(\mathbb{R})$. In particular, we show that such a set cannot be uniformly…

Given a compact interval $I \subseteq \mathbb{R}$, and a function $f$ that is a product of a nonzero polynomial with a Gaussian, it will be shown that the translates $\{ f(\cdot - \lambda) : \lambda \in \Lambda \}$ are complete in $C(I)$ if…