English
Related papers

Related papers: Optimal Results on ITRM-recognizability

200 papers

Let $G$ be a finite group of Lie type and $\ell$ be a prime which is not equal to the defining characteristic of $G$. In this note we discuss some open problems concerning the $\ell$-modular irreducible representations of $G$. We also…

Representation Theory · Mathematics 2011-07-04 Meinolf Geck

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Group Theory · Mathematics 2025-12-23 Zeev Dvir

Let $R$ be a standard graded polynomial ring that is finitely generated over a field, and let $I$ be a homogenous prime ideal of $R$. Bhatt, Blickle, Lyubeznik, Singh, and Zhang examined the local cohomology of $R/I^t$, as $t$ grows…

Commutative Algebra · Mathematics 2020-05-26 Jennifer Kenkel

Let $G$ be a locally compact totally disconnected topological group. Under a necessary mild assumption, we show that the irreducible unitary representations of $G$ are uniformly admissible if and only if the irreducible smooth…

Representation Theory · Mathematics 2018-10-16 Uriya A. First , Thomas Rüd

A countable discrete group $\Gamma$ is said to have the relative ISR-property if for every non-trivial normal subgroup $N\trianglelefteq\Gamma$ and every von Neumann subalgebra $\mathcal{M}\subseteq L(\Gamma)$ invariant under conjugation by…

Operator Algebras · Mathematics 2026-04-07 Tattwamasi Amrutam

Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise. If a given model has parameters for which there may be infinitely many values, such…

Symbolic Computation · Computer Science 2022-04-05 Ilia Ilmer , Alexey Ovchinnikov , Gleb Pogudin , Pedro Soto

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota

We determine the finite groups whose real irreducible representations have different degrees.

Group Theory · Mathematics 2025-05-08 Thomas Breuer , Frank Calegari , Silvio Dolfi , Gabriel Navarro , Pham Huu Tiep

We study randomness beyond $\Pi^1_1$-randomness and its Martin-L\"of type variant, introduced in \cite{MR2340241} and further studied in \cite{Continuous-higher-randomness}. The class given by the infinite time Turing machines (\ITTM s),…

Logic · Mathematics 2026-05-19 Merlin Carl , Philipp Schlicht

We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…

Representation Theory · Mathematics 2021-08-24 Yury A. Neretin

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

Rings and Algebras · Mathematics 2026-02-04 Chandrasekhar Gokavarapu , Dr D Madhusudhana Rao

We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by…

Formal Languages and Automata Theory · Computer Science 2022-05-23 Léo Exibard , Emmanuel Filiot , Ayrat Khalimov

As reinforcement learning (RL) achieves more success in solving complex tasks, more care is needed to ensure that RL research is reproducible and that algorithms herein can be compared easily and fairly with minimal bias. RL results are,…

Machine Learning · Computer Science 2019-09-12 Nicolai A. Lynnerup , Laura Nolling , Rasmus Hasle , John Hallam

A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We extend a construction of Ziegler and (among other…

Logic · Mathematics 2023-07-21 Brian Tyrrell

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…

Logic in Computer Science · Computer Science 2007-05-23 Bruno Courcelle , Pascal Weil

It is well-known that if R is a domain with finite character, each locally principal nonzero ideal of R is invertible. We address the problem of understanding when the converse is true and survey some recent results.

Commutative Algebra · Mathematics 2013-05-17 Stefania Gabelli

Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…

Representation Theory · Mathematics 2012-04-11 Erhard Neher , Alistair Savage , Prasad Senesi

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Logic · Mathematics 2020-11-09 Noam Greenberg , Matthew Harrison-Trainor , Ludovic Patey , Dan Turetsky

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…

Number Theory · Mathematics 2024-06-05 Barry Mazur , Karl Rubin , Alexandra Shlapentokh

The main result: for every sequence $\{\omega_m\}_{m=1}^\infty$ of positive numbers ($\omega_m>0)$ there exists an isometric embedding $F:[0,1]\to L_1[0,1]$ which is nowhere differentiable, but for each $t\in [0,1]$ the image $F_t$ is…

Functional Analysis · Mathematics 2018-11-13 Florin Catrina , Mikhail I. Ostrovskii