相关论文: Linear limits of irreducible characters

In this note, we determine the irreducible characters for the simple algebraic groups of type $A_5$ over an algebraically closed field $K$ of characteristic 3, by using a theorem of Xi Nanhua and the Matlab software. In order to obtain…

Let $G$ be a group with a finite subgroup $H$. We define the $L^2$-multiplicity of an irreducible representation of $H$ in the $L^2$-homology of a proper $G$-CW-complex. These invariants generalize the $L^2$-Betti numbers. Our main results…

Let G be a p-solvable group, P a p-subgroup and chi in Irr(G) such that chi(1)_p \ge |G:P|_p. We prove that the restriction chi_P is a sum of characters induced from subgroups Q\le P such that chi(1)_p=|G:Q|_p. This generalizes previous…

Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample. However, many practical problems are characterized by temporal dependence and strong…

We carry on the study of the synthesis problem on data words for fragments of first order logic, and delineate precisely the border between decidability and undecidability.

Clozel, Harris and Taylor proposed conjectural generalizations of the classical Ihara's lemma for $\mathrm{GL}_2$, to higher dimensional similitude groups. We prove these conjectures in the so called limit case, which after base change is…

We prove that the number of irreducible ordinary characters in the principal $p$-block of a finite group $G$ of order divisible by $p$ is always at least $2\sqrt{p-1}$. This confirms a conjecture of H\'{e}thelyi and K\"{u}lshammer for…

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

It is known that extreme characters of several inductive limits of compact groups exhibit multiplicativity in a certain sense. In the paper, we formulate such multiplicativity for inductive limit quantum groups and provide explicit examples…

We derive concentration inequalities for sums of independent and identically distributed random variables that yield non-asymptotic generalizations of several strong laws of large numbers including some of those due to Kolmogorov [1930],…

We study the conditions under which the head characters of a finite solvable group, as defined by I. M. Isaacs, behave well with respect to restriction. We also determine the intersection of the kernels of all head characters of the group.…

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…

The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…

Inspired by the work of Tsiamis et al. \cite{tsiamis2022learning}, in this paper we study the statistical hardness of learning to stabilize linear time-invariant systems. Hardness is measured by the number of samples required to achieve a…

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

We complete the study of characters on higher rank semisimple lattices initiated in [BH19,BBHP20], the missing case being the case of lattices in higher rank simple algebraic groups in arbitrary characteristics. More precisely, we…

We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…