Related papers: Computing Haar Measures

We give a probabilistic proof of the Weyl integration formula on U(n), the unitary group with dimension $n$. This relies on a suitable definition of Haar measures conditioned to the existence of a stable subspace with any given dimension…

It is introduced a certain approach for equipment of an arbitrary set of the cardinality of the continuum by structures of Polish groups and two-sided (left or right) invariant Haar measures. By using this approach we answer positively…

In this paper we develop a rigorous foundation for the study of integration and measures on the space $\mathscr{G}(V)$ of all graphs defined on a countable labelled vertex set $V$. We first study several interrelated $\sigma$-algebras and a…

A subset $X$ of a Polish group $G$ is called \emph{Haar null} if there exists a Borel set $B \supset X$ and Borel probability measure $\mu$ on $G$ such that $\mu(gBh)=0$ for every $g,h \in G$. We prove that there exists a set $X \subset…

This note presents some equalities in law for $Z_N:=\det(\Id-G)$, where $G$ is an element of a subgroup of the set of unitary matrices of size $N$, endowed with its unique probability Haar measure. Indeed, under some general conditions,…

We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the…

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

We describe the formalization of the existence and uniqueness of Haar measure in the Lean theorem prover. The Haar measure is an invariant regular measure on locally compact groups, and it has not been formalized in a proof assistant…

We provide a general expression of the Haar measure $-$ that is, the essentially unique translation-invariant measure $-$ on a $p$-adic Lie group. We then argue that this measure can be regarded as the measure naturally induced by the…

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…

The Haar measure on some locally compact quantum groups is constructed. The main example we treat is the az+b-group of Woronowicz. We also briefly consider some other examples (like the ax+b-group). We get the first examples of a locally…

Suppose $G$ is a compact semisimple Lie group, $\mu$ is the normalized Haar measure on $G$, and $A, A^2 \subseteq G$ are measurable. We show that $$\mu(A^2)\geq \min\{1, 2\mu(A)+\eta\mu(A)(1-2\mu(A))\}$$ with the absolute constant $\eta>0$…

Let $G$ be a second countable locally compact groupoid equipped with a Haar system $\lambda$.In this work, we introduce and develop the notion of amenability for continuous unitary representations of $G$, formulated in terms of Hilbert…

Haar measure is a fundamental structure in harmonic analysis on locally compact groups. Its existence reflects the compatibility between topology and the associative algebraic structure of groups. In this paper we propose a framework for…

Consider a group word w in n letters. For a compact group G, w induces a map G^n \rightarrow G$ and thus a pushforward measure {\mu}_w on G from the Haar measure on G^n. We associate to each word w a 2-dimensional cell complex X(w) and…

On unitary compact groups the decomposition of a generic element into product of reflections induces a decomposition of the characteristic polynomial into a product of factors. When the group is equipped with the Haar probability measure,…

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

We find necessary and sufficient conditions on a family $\mathcal{R} = (r_i)_{i \in I}$ in a Boolean algebra $\mathcal{B}$ under which there exists a unique positive probability measure $\mu$ on $\mathcal{B}$ such that $\mu (…