中文
相关论文

相关论文: Classifying the Unclassifiables

200 篇论文

We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order…

数论 · 数学 2024-06-05 Barry Mazur , Karl Rubin , Alexandra Shlapentokh

A conjecture by Mackey and Higson claims that there is close relationship between irreducible representations of a real reductive group and those of its Cartan motion group. The case of irreducible tempered unitary representations has been…

表示论 · 数学 2016-10-14 Qijun Tan , Yijun Yao , Shilin Yu

We give a classification of unitary representations of certain Polish, not necessarily locally compact, groups: the groups of all measurable functions with values in the circle and the groups of all continuous functions on compact, second…

表示论 · 数学 2014-09-23 Slawomir Solecki

We compute rationally the topological (complex) K-theory of the classifying space BG of a discrete group provided that G has a cocompact G-CW-model for its classifying space for proper G-actions. For instance word-hyperbolic groups and…

K理论与同调 · 数学 2007-05-23 Wolfgang Lueck

The category of rational G-equivariant cohomology theories for a compact Lie group $G$ is the homotopy category of rational G-spectra and therefore tensor-triangulated. We show that its Balmer spectrum is the set of conjugacy classes of…

代数拓扑 · 数学 2017-06-27 J. P. C. Greenlees

The aim of the present paper is to expose two contributions of Mackey, together with a more recent result of Kawanaka and Matsuyama, generalized by Bump and Ginzburg, on the representation theory of a finite group equipped with an…

J. Dixmier asked in 1950 whether every non-amenable group admits uniformly bounded representations that cannot be unitarised. We provide such representations upon passing to extensions by abelian groups. This gives a new characterisation of…

群论 · 数学 2010-01-17 Nicolas Monod , Narutaka Ozawa

We consider smooth representations of the unit group $G = \mathcal{A}^{\times}$ of a finite-dimensional split basic algebra $\mathcal{A}$ over a non-Archimedean local field. In particular, we prove a version of Gutkin's conjecture, namely,…

表示论 · 数学 2019-11-01 Carlos A. M. André , João Dias

In this work, we show that verifying the order of a finite group given as a black-box is in the complexity class QCMA. This solves an open problem asked by Watrous in 2000 in his seminal paper on quantum proofs and directly implies that the…

量子物理 · 物理学 2026-01-22 François Le Gall , Harumichi Nishimura , Dhara Thakkar

In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…

逻辑 · 数学 2024-11-25 Emmanuel Rauzy

In the late 1990's, R. Coleman and R. Greenberg (independently) asked for a global property characterizing those $p$-ordinary cuspidal eigenforms whose associated Galois representation becomes decomposable upon restriction to a…

数论 · 数学 2023-10-03 Francesc Castella , Carl Wang-Erickson , Haruzo Hida

Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The…

群论 · 数学 2007-05-23 I. M. Isaacs , G. Navarro

We extend the 2-representation theory of finitary 2-categories to certain 2-categories with infinitely many objects, denoted locally finitary 2-categories, and extend the classical classification results of simple transitive…

范畴论 · 数学 2022-01-19 James Macpherson

Throughout this paper $G$ is a fixed group, and $k$ is a fixed field. All categories are assumed to be $k$-linear. First we give a systematic way to induce $G$-precoverings by adjoint functors using a 2-categorical machinery, which unifies…

表示论 · 数学 2024-02-08 Rasool Hafezi , Hideto Asashiba , Mohammad Hossein Keshavarz

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

逻辑 · 数学 2013-04-04 Mohammed Assem , Tarek Sayed Ahmed

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

离散数学 · 计算机科学 2017-08-08 Emmanuel Jeandel

The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced…

计算机科学中的逻辑 · 计算机科学 2025-06-03 Varad Joshi , Anantha Padmanabha

This paper gives a $p$-adic analogue of the Mackey theory, which relates representations of a group of type $G=H\times_{t} A $ to systems of imprimitivity.

表示论 · 数学 2007-05-23 BinYong Hsie

We show that a natural, two sorted $\cL_{\omega_1,\omega}$ theory involving the modular $j$-function is categorical in all uncountable cardinaities. It is also shown that a slight weakening of the adelic Mumford-Tate conjecture for products…

逻辑 · 数学 2013-04-18 Adam Harris

Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…