Related papers: The Moebius function on the lattice of normal subg…
Let $B$ be a finite Boolean algebra. Let $\mathcal A$ be the partial order of all implication sublattices of $B$. We will compute the M\"obius function on $\mathcal A$ in two different ways.
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…
Gcharacter tables of a finite group G were defined before. These tables can be very useful to obtain certain structural information of a normal subgroup from the character table of G. We analyze certain structural properties of normal…
The paper presents some results for reducing the computation of the M\"obius functon of a M\"obius category that arises from a combinatorial inverse semigroup to that of locally finite partially ordered sets. We illustrate the computation…
This article describes a practical approach for determining the lattice of subgroups U < V < G between given subgroups U and G, provided the total number of such subgroups is not too large. It builds on existing functionality for element…
We establish, for the character table of the symmetric group, the positivity of the row sums indexed by irreducible characters, when restricted to various subsets of the conjugacy classes. A notable example is that of partitions with all…
We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…
We give a recursive formula for the Moebius function of an interval $[\sigma,\pi]$ in the poset of permutations ordered by pattern containment in the case where $\pi$ is a decomposable permutation, that is, consists of two blocks where the…
We prove lower bounds on learning the M\"obius or Liouville function with a variety of standard learning techniques, including kernel methods, noisy gradient methods, and correlational statistical query algorithms. These results follow from…
Contrary to the finite-dimensional case, the Moebius group admits interesting self-representations when infinite-dimensional. We construct and classify all these self-representations. The proofs are obtained in the equivalent setting of…
We define a subgroup of the universal sofic group, obtained as the normaliser of a separable abelian subalgebra. This subgroup can be obtained as an extension by the group of automorphisms on a standard probability space. We show that each…
The M\"obius function for a group, $G$, was introduced in 1936 by Hall in order to count ordered generating sets of $G$. In this paper we determine the M\"obius function of the simple small Ree groups, $R(q)={}^2G_2(q)$ where $q=3^{2m+1}$…
We show that a large class of divisible abelian $\ell$-groups (lattice ordered groups) of continuous functions is interpretable (in a certain sense) in the lattice of the zero sets of these functions. This has various applications to the…
We extend the Euler's totient function (from arithmetic) to any irreducible subfactor planar algebra, using the Mobius function of its biprojection lattice, as Hall did for the finite groups. We prove that if it is nonzero then there is a…
The paper proposes a general notion of interaction between attributes, which can be applied to many fields in decision making and data analysis. It generalizes the notion of interaction defined for criteria modelled by capacities, by…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…
Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
In group theory the chief factors allow a group to be studied by its representation theory on particularly natural irreducible modules. It is to be expected, therefore, that they will play an important role in the study of Lie algebras. In…