Related papers: Limits of functions on groups

We consider the problem of characterizing derived endomorphism algebras of simple objects in length categories up to quasi-isomorphism. We give such a characterization for module categories, abelian categories, exact categories, as well as,…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

In this paper we propose an extension of the notion of deviation-based aggregation function tailored to aggregate multidimensional data. Our objective is both to improve the results obtained by other methods that try to select the best…

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

We study the problem of constructing positive representations of complex measures. In this paper we consider complex densities on a direct product of $U(1)$ groups and look for representations by probability distributions on the…

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…

We highlight a topological aspect of the graph limit theory. Graphons are limit objects for convergent sequences of dense graphs. We introduce the representation of a graphon on a unique metric space and we relate the dimension of this…

We prove new quantitative bounds on the additive structure of sets obeying an $L^3$ 'control' assumption, which arises naturally in several questions within additive combinatorics. This has a number of applications - in particular we…

We prove that any strongly mixing action of a countable abelian group on a probability space has higher order mixing properties. This is achieved via introducing and utilizing $\mathcal R$-limits, a notion of convergence which is based on…

Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

We study the algebraic entropy of continuous endomorphisms of compactly covered, locally compact, topologically quasihamiltonian groups. We provide a Limit-free formula which helps us to simplify the computations of this entropy. Moreover,…

The goal of this work is to introduce and study fuzzy limits of functions. Two approaches to fuzzy limits of a function are considered. One is based on the concept of a fuzzy limit of a sequence, while another generalizes the conventional…

The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization of bipartite $b$-matching. In the group-realizable setting,…

We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…

We prove limit theorems for row sums of a rowwise independent infinitesimal array of random variables with values in a locally compact Abelian group. First we give a proof of Gaiser's theorem, since it does not have an easy access and it is…

We study word metrics on Z^d by developing tools that are fine enough to measure dependence on the generating set. We obtain counting and distribution results for the words of length n. With this, we show that counting measure on spheres…

We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…