English
Related papers

Related papers: Linear limits of irreducible characters

200 papers

Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…

Statistics Theory · Mathematics 2008-12-18 François Roueff , Murad S. Taqqu

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…

Group Theory · Mathematics 2019-09-23 S. P. Glasby , Cheryl E. Praeger , Colva M. Roney-Dougal

M. Field [5] refers to an unpublished work by J. Ize for a result that loss of stability through an absolutely irreducible representation of a compact Lie group leads to bifurcation of steady states. The main ingredient of the proof is the…

Dynamical Systems · Mathematics 2021-01-27 Reiner Lauterbach

We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. Probab. 5 (1977) 616--621] and motivated by Gordin [Soviet Math.…

Probability · Mathematics 2007-05-23 Magda Peligrad , Sergey Utev

This is an exposition of our joint work with Kakde, Silliman, and Wang, in which we prove a version of Ribet's Lemma for $\mathrm{GL}_2$ in the residually indistinguishable case. We suppose we are given a Galois representation taking values…

Number Theory · Mathematics 2023-10-26 Samit Dasgupta

We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types)…

Logic in Computer Science · Computer Science 2021-04-30 Toby Cathcart Burn , Luke Ong , Steven Ramsay , Dominik Wagner

By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (ESO formulas). Subsequent research refined this…

Logic in Computer Science · Computer Science 2023-10-03 Max Bannach , Florian Chudigiewitsch , Till Tantau

In Theorem 3.1 of [12], we proved a rigidity result for self-shrinkers under the integral condition on the norm of the second fundamental form. In this paper, we relax the such bound to any finite constant (see Theorem 4.4 for details).

Differential Geometry · Mathematics 2023-12-27 Qi Ding

The classification of irreducible, spherical characters of the infinite-dimensional unitary/orthogonal/symplectic groups can be obtained by finding all possible limits of normalized, irreducible characters of the corresponding…

Representation Theory · Mathematics 2018-12-18 Cesar Cuenca , Vadim Gorin

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: PR-groups, IPR-groups and weak IPR-groups. We show that IPR-groups and weak…

Group Theory · Mathematics 2014-12-18 Tobias Kildetoft

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…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

Let $G$ be a finite group, let $N$ be a normal subgroup of $G$ and let $\theta$ be an irreducible character of $N$. We count the real irreducible characters of $G$ lying over $\theta$

Group Theory · Mathematics 2023-01-04 John C. Murray

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

Representation Theory · Mathematics 2020-02-19 Robert M. Guralnick , Michael Larsen , Pham Huu Tiep

We show that stationary characters on irreducible lattices $\Gamma < G$ of higher-rank connected semisimple Lie groups are conjugation invariant, that is, they are genuine characters. This result has several applications in representation…

Group Theory · Mathematics 2021-08-24 Rémi Boutonnet , Cyril Houdayer

Let $n$ and $k$ be natural numbers such that $2^k < n$. We study the restriction to $\mathfrak{S}_{n-2^k}$ of odd-degree irreducible characters of the symmetric group $\mathfrak{S}_n$. This analysis completes the study begun in [Ayyer A.,…

Representation Theory · Mathematics 2017-09-06 Christine Bessenrodt , Eugenio Giannelli , Jorn B. Olsson

In this paper, we study boundedness, uniform stability and asymptotic stability of a class of nonlinear neutral delay differential equations by using Krasnoselskii's fixed point theorem. The results obtained in this paper extend and improve…

Dynamical Systems · Mathematics 2023-12-13 Yang Li , Guiling Chen

We propose an abstract approach to prove local uniqueness and conditional H\"older stability to non-linear inverse problems by linearization. The main condition is that, in addition to the injectivity of the linearization $A$, we need a…

Functional Analysis · Mathematics 2008-09-02 Plamen Stefanov , Gunther Uhlmann

We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…

Logic · Mathematics 2012-08-13 M. Malliaris , S. Shelah

We investigate the action of outer automorphisms of finite groups of Lie type on their irreducible characters. We obtain a definite result for cuspidal characters. As an application we verify the inductive McKay condition for some further…

Representation Theory · Mathematics 2017-09-13 Gunter Malle

We verify the inductive McKay condition for simple groups of Lie type C, namely finite projective symplectic groups. This contributes to the program of a complete proof of the McKay conjecture for all finite groups via the reduction theorem…

Representation Theory · Mathematics 2016-12-13 Marc Cabanes , Britta Späth