English
Related papers

Related papers: Isoperimetric and isodiametric functions of groups

200 papers

A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…

Logic in Computer Science · Computer Science 2015-07-01 Dimiter Skordev

Basis functions which are invariant under the operations of a rotational point group $G$ are able to describe any 3-D object which exhibits the rotational point group symmetry. However, in order to characterize the spatial statistics of an…

Group Theory · Mathematics 2021-03-09 Nan Xu , Peter C. Doerschuk

In this paper asymptotic equalities are found for the least upper bounds of deviations in the uniform metric of de la Vallee Poussin sums on classes of 2\pi-periodic (\psi,\beta)-differentiable functions admitting an analytic continuation…

Classical Analysis and ODEs · Mathematics 2012-08-31 A. S. Serdyuk , Ie. Yu. Ovsii , A. P. Musienko

The higher divergence of a metric space describes its isoperimetric behaviour at infinity. It is closely related to the higher-dimensional Dehn functions, but has more requirements to the fillings. We prove that these additional…

Metric Geometry · Mathematics 2018-07-30 Moritz Gruber

We give an infinite family of monoids $\Pi_N$ (for $N=2, 3, \dots$), each with a single defining relation of the form $bUa = a$, such that the Dehn function of $\Pi_N$ is at least exponential. More precisely, we prove that the Dehn function…

Group Theory · Mathematics 2022-10-31 Carl-Fredrik Nyberg-Brodda

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Number Theory · Mathematics 2025-08-05 Mihai Prunescu , Joseph M. Shunia

We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant $\Delta_K$, given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step…

Number Theory · Mathematics 2010-01-26 Felix Fontein , Michael J. Jacobson

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

Group Theory · Mathematics 2018-02-23 Igor Lima , Martino Garonzi

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

Geometric Topology · Mathematics 2018-10-03 Greg Kuperberg , Eric Samperton

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…

Group Theory · Mathematics 2011-03-01 Martin R Bridson , Henry Wilton

We obtain asymptotic formulae for the second discrete moments of the Riemann zeta function over arithmetic progressions $\frac{1}{2} + i(a n + b)$. It reveals noticeable relation between the discrete moments and the continuous moment of the…

Number Theory · Mathematics 2024-01-04 Hirotaka Kobayashi

Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$ discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector whose entries are ${\bf{h}}({\cal{A}})\triangleq H(X_{\cal{A}}),\cal{A}\subset{\cal N}…

Information Theory · Computer Science 2016-09-29 Qi Chen , Raymond W. Yeung

In this paper we observe that isomorphism classes of certain metrized vector bundles over P^1-{0,infinity} can be parameterized by arithmetic quotients of loop groups. We construct an asymptotic version of theta functions, which are defined…

Representation Theory · Mathematics 2015-05-12 Dongwen Liu

The aim of this paper is to undertake an experimental investigation of the trade-offs between program-size and time computational complexity. The investigation includes an exhaustive exploration and systematic study of the functions…

Computational Complexity · Computer Science 2015-03-19 Joost J. Joosten , Fernando Soler-Toscano , Hector Zenil

The mathematics of crystalline structures connects analysis, geometry, algebra, and number theory. The planar crystallographic groups were classified in the late 19th century. One hundred years later, B\'erard proved that the fundamental…

Spectral Theory · Mathematics 2021-04-28 Julie Rowlett , Max Blom , Henrik Nordell , Oliver Thim , Jack Vahnberg

According to Haar's Theorem, every compact group $G$ admits a unique (regular, right and) left-invariant Borel probability measure $\mu_G$. Let the Haar integral (of $G$) denote the functional $\int_G:\mathcal{C}(G)\ni f\mapsto \int…

Logic in Computer Science · Computer Science 2019-10-30 Arno Pauly , Dongseong Seon , Martin Ziegler

Building on our previous work (arXiv:1405.5711), we develop the first practical algorithm for computing topological zeta functions of nilpotent groups, non-associative algebras, and modules. While we previously depended upon non-degeneracy…

Group Theory · Mathematics 2014-09-18 Tobias Rossmann

This paper considers the effect of least squares procedures for nearly unstable linear time series with strongly dependent innovations. Under a general framework and appropriate scaling, it is shown that ordinary least squares procedures…

Statistics Theory · Mathematics 2009-09-29 Boris Buchmann , Ngai Hang Chan

We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…

Mathematical Physics · Physics 2022-05-26 David Cimasoni

An extremity is a vertex such that the removal of its closed neighbourhood does not increase the number of connected components. Let $Ext_{\alpha}$ be the class of all connected graphs whose quotient graph obtained from modular…

Data Structures and Algorithms · Computer Science 2023-02-28 Guillaume Ducoffe