English
Related papers

Related papers: Commensurability and representation equivalent ari…

200 papers

We prove an operator algebraic superrigidity statement for homomorphisms of irreducible lattices, and also their commensurators, in certain higher-rank groups into unitary groups of finite factors. This extends the authors' previous work…

Operator Algebras · Mathematics 2022-03-23 Darren Creutz , Jesse Peterson

In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components…

Representation Theory · Mathematics 2026-01-21 Lucien Hennecart

Starting from the classical results of Shubnikov and Zamorzayev, computer models of shapes are implemented, which allow to visualize the action of discrete subgroups of continuous topological groups. The action is visualize by performing…

Metric Geometry · Mathematics 2019-03-15 Alexander S. Prokhoda

We prove that the class of Banach function lattices in which all relatively weakly compact sets are equi-integrable sets (i.e. spaces satisfying the Dunford-Pettis criterion) coincides with the class of 1-disjointly homogeneous Banach…

Functional Analysis · Mathematics 2019-12-18 Karol Lesnik , Lech Maligranda , Jakub Tomaszewski

We prove some new relations between weak approximation and some rational equivalence relations (Brauer and R-equivalence) in algebraic groups over arithmetical fields. By using weak approximation and local - global approach, we compute…

alg-geom · Mathematics 2007-05-23 Nguyen Quoc Thang

For a countably infinite group $\Gamma$, let $\mathcal{W}_\Gamma$ denote the space of all weak equivalence classes of measure-preserving actions of $\Gamma$ on atomless standard probability spaces, equipped with the compact metrizable…

Dynamical Systems · Mathematics 2019-03-14 Anton Bernshteyn

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…

Combinatorics · Mathematics 2016-03-04 Francesco Marigo , Davide Schipani

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

Group Theory · Mathematics 2023-07-11 Lev Glebsky , Alexander Lubotzky , Nicolas Monod , Bharatram Rangarajan

Canonical relativized cylindric set algebras are used to sharpen the relative representation theorem for weakly associative relation algebras, that every complete atomic weakly associative relation algebra is isomorphic with the…

Logic · Mathematics 2021-06-30 Roger D. Maddux

A dual pair formulation for asymmetric locally convex spaces is developed that strictly generalises the ordinary vector space setting. The concept of a polar topology carries over to the asymmetric case and some familiar results are…

General Topology · Mathematics 2026-02-24 Jobst Ziebell

Let $\Lambda$ be a subgroup of an arithmetic lattice in SO(n+1,1). The quotient $\mathbb{H}^{n+1} / \Lambda$ has a natural family of congruence covers corresponding to primes in some ring of integers. We establish a super-strong…

Spectral Theory · Mathematics 2013-10-14 Michael Magee

A theorem of Davis, Figiel, Johnson and Pe{\l}czy\'nski tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method,…

Functional Analysis · Mathematics 2007-05-23 Matthew Daws

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…

Logic in Computer Science · Computer Science 2012-01-23 Pascal Hitzler , Markus Krötzsch , Guo-Qiang Zhang

We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building…

Group Theory · Mathematics 2009-04-20 Frederic Haglund

Motivated by recent applications to entropy theory in dynamical systems, we generalise notions introduced by Matthews and define weakly weighted and componentwisely weakly weighted (generalised) quasi-metrics. We then systematise and extend…

Information Theory · Computer Science 2022-12-19 Ilaria Castellano , Anna Giordano Bruno , Nicolò Zava

Let Gamma be a lattice in a simply-connected solvable Lie group. We construct a Q-defined algebraic group A such that the abstract commensurator of Gamma is isomorphic to A(Q) and Aut(Gamma) is commensurable with A(Z). Our proof uses the…

Group Theory · Mathematics 2015-05-01 Daniel Studenmund

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

Algebraic Geometry · Mathematics 2026-01-21 Alejandro González Nevado

We classify the Rauzy-Veech groups of all connected components of all strata of the moduli space of translation surfaces in absolute homology, showing, in particular, that they are commensurable to arithmetic lattices of symplectic groups.…

Dynamical Systems · Mathematics 2019-04-09 Rodolfo Gutiérrez-Romo

Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize…

Logic · Mathematics 2010-02-05 Leonard Kwuida , Hajime Machida

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

Computational Complexity · Computer Science 2025-09-05 Lunjia Hu , Salil Vadhan