English
Related papers

Related papers: Limits of functions on groups

200 papers

In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian group. We apply the inequalities to obtain new upper bounds for the additive energy of multiplicative subgroups and…

Combinatorics · Mathematics 2012-11-07 I. D. Shkredov

There has been some work in the literature on limit theorems for the trace of commutators for compact Lie groups. We revisit this from the perspective of combinatorial representation theory.

Representation Theory · Mathematics 2025-02-14 Jason Fulman

In recent studies, Bibiloni-Femenias, Mi\~{n}ana and Valero characterized the functions that aggregate a family of (quasi-)(pseudo)metric modulars defined over a fixed set $X$ into a single one. In this paper, we adopt a related but…

General Topology · Mathematics 2025-04-01 Alejandro Fructuoso-Bonet , Jesús Rodríguez-López

Problems of dense and closed extension of actions of compact transformation groups are solved. The method developed in the paper is applied to problems of extension of equivariant maps and of construction of equivariant compactifications.

General Topology · Mathematics 2011-08-08 Sergei M. Ageev , Dušan Repovš

Action convergence provides a limit theory for linear bounded operators $A_n:L^{\infty}(\Omega_n)\longrightarrow L^1(\Omega_n)$ where $\Omega_n$ are potentially different probability spaces. This notion of convergence emerged in graph…

Combinatorics · Mathematics 2025-01-24 Giulio Zucal

In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…

Complex Variables · Mathematics 2020-06-04 Sotiris Armeniakos , Giorgos Kotsovolis , Vassili Nestoridis

We show the boundedness of finite subgroups in any anisotropic reductive algebraic group over a perfect field that contains all roots of 1. Also, we provide explicit bounds for orders of finite subgroups of automorphism groups of…

Algebraic Geometry · Mathematics 2021-06-30 Constantin Shramov , Vadim Vologodsky

We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…

Numerical Analysis · Mathematics 2015-03-19 Adam M. Oberman

In this paper we study analogues of amenability for topological groups in the context of definable structures. We prove fixed point theorems for such groups. More importantly, we propose definitions for definable actions and continuous…

Logic · Mathematics 2018-12-14 Alf Onshuus , Luis Carlos Suárez

The classification of gradings by abelian groups on finite direct sums of simple finite-dimensional nonassociative algebras over an algebraically closed field is reduced, by means of the use of loop algebras, to the corresponding problem…

Rings and Algebras · Mathematics 2019-04-25 Alejandra S. Córdova-Martínez , Alberto Elduque

We define and study a natural category of graph limits. The objects are pairs $(\pi,\mu)$, where $\pi$ (the distribution of vertices) is an abstract probability measure on some abstract measurable space $(X,\mathcal{A})$ and $\mu$ (the…

Combinatorics · Mathematics 2026-03-04 Martin Doležal , Wiesław Kubiś

The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…

Dynamical Systems · Mathematics 2019-03-26 Gábor Elek

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

Number Theory · Mathematics 2016-12-15 Eknath Ghate , T. N. Venkataramana

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Logic · Mathematics 2009-05-19 Jaap van Oosten

Maximizing a submodular function has a wide range of applications in machine learning and data mining. One such application is data summarization whose goal is to select a small set of representative and diverse data items from a large…

Machine Learning · Computer Science 2023-03-10 Jing Yuan , Shaojie Tang

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

Combinatorics · Mathematics 2015-01-14 Felix Pogorzelski

We define a way of approximating actions on measure spaces using finite graphs; we then show that in quite general settings these graphs form a family of expanders if and only if the action is expanding in measure. This provides a somewhat…

Geometric Topology · Mathematics 2021-01-13 Federico Vigolo

We describe quantizations on monoidal categories of modules over finite groups. They are given by quantizers which are elements of a group algebra. Over the complex numbers we find these explicitly. For modules over S3 and A4 we are given…

Quantum Algebra · Mathematics 2012-05-04 Hilja L. Huru , Valentin V. Lychagin

An inequality for the variance of an additive function defined on random decomposable structures, called assemblies, is established. The result generalizes estimates obtained earlier in the cases of permutations and mappings of a finite set…

Combinatorics · Mathematics 2016-05-16 Eugenijus Manstavicius , Vytautas Stepas

We introduce a novel criterion in clustering that seeks clusters with limited range of values associated with each cluster's elements. In clustering or classification the objective is to partition a set of objects into subsets, called…

Data Structures and Algorithms · Computer Science 2018-05-15 Dorit S. Hochbaum