Results 31 to 40 of about 70,594,654 (57)
Local limits in p$p$‐adic random matrix theory
Proceedings of the London Mathematical Society, Volume 129, Issue 3, September 2024.Abstract We study the distribution of singular numbers of products of certain classes of p$p$‐adic random matrices, as both the matrix size and number of products go to ∞$\infty$ simultaneously. In this limit, we prove convergence of the local statistics to a new random point configuration on Z$\mathbb {Z}$, defined explicitly in terms of certain ...
Roger Van Peski
wiley +1 more source
Generation problems for finite groups [PDF]
, 2012 It can be deduced from the Burnside Basis Theorem that if G is a finite p-group with d(G)=r then given any generating set A for G there exists a subset of A of size r that generates G. We have denoted this property B.
McDougall-Bagnall, Jonathan M.
core +2 more sources
A natural adaptive process for collective decision‐making
Theoretical Economics, Volume 19, Issue 2, Page 667-703, May 2024.Consider an urn filled with balls, each labeled with one of several possible collective decisions. Now let a random voter draw two balls from the urn and pick her more preferred as the collective decision. Relabel the losing ball with the collective decision, put both balls back into the urn, and repeat.
Florian Brandl, Felix Brandt
wiley +1 more source
Singular estimates and uniform stability of coupled systems of hyperbolic/parabolic PDEs
, 2002 Abstract and Applied Analysis, Volume 7, Issue 4, Page 169-237, 2002.
F. Bucci, I. Lasiecka, R. Triggiani
wiley +1 more source
Computing in matrix groups without memory [PDF]
, 2013 Funding: UK Engineering and Physical Sciences Research Council award EP/K033956/1Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau +10 more
core +2 more sources
Banach algebras on semigroups and on their compactifications [PDF]
, 2010 Lau, A.T.-M. +2 more
core +4 more sources
Unary FA-presentable semigroups [PDF]
, 2012 Automatic presentations, also called FA-presentations, were introduced to extend nite model theory to innite structures whilst retaining the solubility of interesting decision problems.
Cain, Alan James +2 more
core +1 more source
Amenable actions, invariant means and bounded cohomology
, 2012 We show that topological amenability of an action of a countable discrete group on a compact spaceis equivalent to the existence of an invariant mean for the action.
Wright, Nick +3 more
core +1 more source
, 2012 In this thesis we consider in detail the following two fundamental problems for semigroup presentations: 1. Given a semigroup find a presentation defining it. 2. Given a presentation describe the semigroup defined by it.
Ruškuc, Nik
core +2 more sources
The Baum-Connes conjecture for free orthogonal quantum groups [PDF]
, 2011 We prove an analogue of the Baum–Connes conjecture for free orthogonal quantum groups. More precisely, we show that these quantum groups have a γ-element and that γ=1. It follows that free orthogonal quantum groups are K-amenable.
Voigt, C. +2 more
core +1 more source