相关论文: Identities in character tables of $S_n$

We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly"…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

If all of the entries of a large $S_n$ character table are covered up and you are allowed to uncover one entry at a time, then how can you quickly identify all of the indexing characters and conjugacy classes? We present a fast algorithmic…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

We present in this work a complete session in a Mathematica notebook. The aim of this notebook is to check identities in symmetric compositions. This notebook is a complement of our work [1] and it has all the explicit computations. We…

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

We explore a certain family $\{A_n\}_{n=1}^{\infty}$ of $n \times n$ tridiagonal real symmetric matrices. After deriving a three-term recurrence relation for the characteristic polynomials of this family, we find a closed form solution. The…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…

Proving a conjecture of Miller, we show that as $n$ tends to infinity almost all entries in the character table of $S_n$ are divisible by any given prime power. This extends our earlier work which treated divisibility by primes.

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

We prove that finite groups have the same complex character tables iff the group algebras are twisted forms of each other as Drinfel'd quasi-bialgebras or iff there is non-associative bi-Galois algebra over these groups. The interpretations…

Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…

Query answering routinely employs knowledge graphs to assist the user in the search process. Given a knowledge graph that represents entities and relationships among them, one aims at complementing the search with intuitive but effective…

In this article we shows some results about algebra with the group of units having special polynomial identity.

I revisit an automated proof of Andrews' pentagonal number theorem found by Riese. I uncover a simple polynomial identity hidden behind his proof. I explain how to use this identity to prove Andrews' result along with a variety of new…

In this paper, some zeros and non-zeros in the character tables of symmetric groups are displayed in the partition forms. In particular, more zeros of self conjugate partitions beside odd permutations are heavily investigated.

We show that almost every entry in the character table of $S_N$ is divisible by any fixed prime as $N\to\infty$. This proves a conjecture of Miller.

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…