Related papers: Linear limits of irreducible characters
Non-linear renewal theory is extended to include random walks perturbed by both a slowly changing sequence and a stationary one. Main results include a version of the Key Renewal Theorem, a derivation of the limiting distribution of the…
In default theories, outliers denote sets of literals featuring unexpected properties. In previous papers, we have defined outliers in default logics and investigated their formal properties. Specifically, we have looked into the…
We construct a new parametrization of double sequences $\{A_{n,k}(s)\}_{n,k}$ between $A_{n,k}(0)= \binom{n-1}{k-1}$ and $A_{n,k}(1)= \frac{1}{n!}\stirl{n}{k}$, where $\stirl{n}{k}$ are the unsigned Stirling numbers of the first kind. For…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
Some limit theorems are proven for the linear oscillator with random coefficients. The asymptotic behaviour of the moments is studied in detail. The technique presented in this paper can be applied to general linear systems with noise and…
In many scenarios, the interpretability of machine learning models is a highly required but difficult task. To explain the individual predictions of such models, local model-agnostic approaches have been proposed. However, the process…
The abstract boundary has, in recent years, proved a general and flexible way to define the singularities of space-time. In this approach an essential singularity is a non-regular boundary point of an embedding which is accessible by a…
In this paper, several results concerning attraction and asymptotic stability in the large of nonlinear ordinary differential equations are presented. The main result is very simple to apply yielding a sufficient condition under which the…
Limit theorems for a linear dynamical system with random interactions are established. These theorems enable us to characterize the dynamics of a large complex system in details and assess whether a large complex system is stable or…
We prove that for any prime $\ell$, any finite group has as many irreducible complex characters of degree prime to $\ell$ as the normalizers of its Sylow $\ell$-subgroups. This equality was conjectured by John McKay. The conjecture was…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with…
We prove the existence of a limit shape and give its explicit description for certain probability distribution on signatures (or highest weights for unitary groups). The distributions have representation theoretic origin-they encode…
We determine the action of the automorphism group Aut$(G)$ on the set of irreducible characters Irr$(G)$ for all finite quasi-simple groups $G$. For groups of Lie type, this includes the construction of an Aut$(G)$-equivariant Jordan…
Let N be a finite group of odd order and A a finite group that acts on N such that the orders of N and A are coprime. Isaacs constructed a natural correspondence between the set Irr_A(N) of irreducible complex characters invariant under the…
In this paper we study the convergence in distribution and the local limit theorem for the partial sums of linear random fields with i.i.d. innovations that have infinite second moment and belong to the domain of attraction of a stable law…
In this paper, we determine new characterizations of nested and nested GVZ-groups, including character-free characterizations, but we additionally show that nested groups and nested GVZ-groups can be defined in terms of the existence of…
We prove for finite reductive groups $G$ of classical type, that every irreducible character of $L$ extends to its inertia group in $N$, where $L$ is an abelian centraliser of a Sylow $d$-torus $\mathbf S$ of $G$ and $N:=N_G(\mathbf S)$.…
We prove a variant of the Theorem of Ito-Michler, investigating the properties of finite groups where a prime number $p$ does not divide the degree of any irreducible character left invariant by some Galois automorphism $\sigma$ of order…
A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…