English
Related papers

Related papers: IP-rigidity and eigenvalue groups

200 papers

We construct discrete groups $G$ with infinite center that are nevertheless W*-superrigid, meaning that the group von Neumann algebra $L(G)$ fully remembers the group $G$. We obtain these rigidity results both up to isomorphisms and up to…

Operator Algebras · Mathematics 2025-09-15 Milan Donvil , Stefaan Vaes

We use reproducing kernel methods to study various rigidity problems. The methods and setting allow us to also consider the non-positive case.

Complex Variables · Mathematics 2007-09-18 Daniel Alpay , Simeon Reich , David Shoikhet

Recently we introduced a family of $U(N)$ invariant Random Matrix Ensembles which is characterized by a parameter $\lambda$ describing logarithmic soft-confinement potentials $V(H) \sim [\ln H]^{(1+\lambda)} \:(\lambda>0$). We showed that…

Disordered Systems and Neural Networks · Physics 2013-05-29 Jinmyung Choi , K. A. Muttalib

We investigate the homological behaviour of compactly generated triangulated categories under separable extensions. We show that homological invariants (finiteness of global dimension, gorensteinness and regularity) are preserved under such…

Representation Theory · Mathematics 2026-04-21 Miltiadis Karakikes , Panagiotis Kostas

We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…

Representation Theory · Mathematics 2017-08-08 Yury A. Neretin

We characterize the group property of being with infinite conjugacy classes (or icc, i.e. \not= 1 and of which all conjugacy classes except 1 are infinite) for finite extensions of group.

Group Theory · Mathematics 2007-05-23 Jean-Philippe Preaux

This work is a continuation of the description of some classes of nilpotent Zinbiel algebras. We focus on the study of Zinbiel algebras with restrictions to gradation and characteristic sequence. Namely, the classification of naturally…

Rings and Algebras · Mathematics 2014-10-29 J. K. Adashev , M. Ladra , B. A. Omirov

An explicit numerical strategy that practically preserves invariants is derived for conservative systems by combining an explicit high-order Runge-Kutta (RK) scheme with a simple modification of the standard projection approach, which is…

Numerical Analysis · Mathematics 2020-09-16 Wenjun Cai , Yuezheng Gong , Yushun Wang

We introduce the concept of natural connectivity as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formulation. It characterizes the redundancy of alternative paths…

Statistical Mechanics · Physics 2008-02-20 Jun Wu , Yue-Jin Tan , Hong-Zhong Deng , Yong Li , Bin Liu , Xin Lv

Heterogeneous k-core percolation is an extension of a percolation model which has interesting applications to the resilience of networks under random damage. In this model, the notion of node robustness is local, instead of global as in…

Disordered Systems and Neural Networks · Physics 2013-03-08 Davide Cellai , James P. Gleeson

In this paper, we study VC-density over indiscernible sequences (denoted VC_ind-density). We answer an open question in [1], showing that VC_ind-density is always integer valued. We also show that VC_ind-density and dp-rank coincide in the…

Logic · Mathematics 2013-07-26 Vincent Guingona , Cameron Donnay Hill

Given a finite residue field $k$, one looks for a smoothness basis that is invariant under the automorphism group of $k$. We construct models for some finite fields that admit such a basis. This work aims at accelerating algorithms for…

Number Theory · Mathematics 2007-05-23 Jean-Marc Couveignes

We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…

Algebraic Geometry · Mathematics 2019-02-20 Olivier Haution

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…

Computational Complexity · Computer Science 2013-10-15 Samuel Epstein

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Group Theory · Mathematics 2026-04-10 Angsuman Das , Hiranya Kishore Dey , Khyati Sharma

A sequence $a_n\da 0$ forms a rate of random mixing for a unitary system $(G,\mu, \pi, {\cal H})$ if for any $u, v\in {\cal H}$ $$\limsup {|<\pi (g_n^\omega)u, v>|\over a_n} < \infty$$ a.e. $\omega$ in the probability space $(G^{\mathbb N},…

Dynamical Systems · Mathematics 2007-05-23 C. R. E. Raja

A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…

Group Theory · Mathematics 2024-01-11 Nic Brody , Kasia Jankiewicz

We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique.

Group Theory · Mathematics 2010-08-09 David G. Radcliffe

We investigate $IPA$ - real closed fields, that is, real closed fields which admit an integer part whose non-negative cone is a model of Peano Arithmetic. We show that the value group of an $IPA$ - real closed field is an exponential group…

Logic · Mathematics 2018-11-02 Merlin Carl , Paola D'Aquino , Salma Kuhlmann

We study the centraliser of locally compact group extensions of ergodic probability preserving transformations. New methods establishing ergodicity of group extensions are introduced, and new examples of squashable and non-coalescent group…

Dynamical Systems · Mathematics 2007-05-23 Jon. Aaronson , Mariusz Lemanczyk , Dalibor Volny