Related papers: Linear limits of irreducible characters

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…

In this paper, we prove the existence of a relation between the prime divisors of the order of a Sylow normalizer and the degree of characters having values in some small cyclotomic fields. This relation is stronger when the group is…

Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…

Let $N$ be normal subgroup of a finite group $G$, $p$ be a prime, $P$ be a Sylow $p$-subgroup of $G$ and $\theta$ be a $P$-invariant irreducible character of $N$. Suppose that $G/N$ is a $p$-solvable group. In this note we show that,…

We consider groups where the centers of the irreducible characters form a chain. We obtain two alternate characterizations of these groups, and we obtain some information regarding the structure of these groups. Using our results, we are…

The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a…

In this PhD thesis we discuss methods of recognizing finite groups by the structure of normalizers of certain 3-subgroups. We explain a method for characterizing groups using character theoretic and block theoretic methods and we use these…

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

In this article I describe my recent geometric localization argument dealing with actions of NONcompact groups which provides a geometric bridge between two entirely different character formulas for reductive Lie groups and answers the…

Answering a question of I. M. Isaacs, we show that the largest degree of irreducible complex representations of any finite non-abelian simple group can be bounded in terms of the smaller degrees. We also study the asymptotic behavior of…

This paper proposes a conjectural framework for Alperin's Main Problem of Block Theory from 1976. The character sets considered here are defined by nonvanishing at given elements, not only by degree conditions. From this point of view,…

The article presents a new interpretation for Zipf-Mandelbrot's law in natural language which rests on two areas of information theory. Firstly, we construct a new class of grammar-based codes and, secondly, we investigate properties of…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

In this paper we study characters on special linear groups SL_n(R), where R is either an infinite field or the localization of an order in a number field. We give several applications to the theory of measure preserving actions,…

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

Let $G$ be a finite group and $d$ the degree of a complex irreducible character of $G$, then write $|G|=d(d+e)$ where $e$ is a nonnegative integer. We prove that $|G|\leq e^4-e^3$ whenever $e>1$. This bound is best possible and improves on…

A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.