Related papers: Fusion invariant characters of p-groups

Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…

P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…

We generalize type $A$ quivers to continuous type $A$ quivers and prove initial results about pointwise finite-dimensional (pwf) representations. We classify the indecomosable pwf representations and provide a decomposition theorem,…

We show that stationary characters on irreducible lattices $\Gamma < G$ of higher-rank connected semisimple Lie groups are conjugation invariant, that is, they are genuine characters. This result has several applications in representation…

We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r)…

A graph G(V, E) is word-representable if there exists a word w over V such that distinct letters x and y alternate in w iff $xy \in E$. We introduce p-complete squares and p-complete square-free word-representable graphs. A word is…

In this work, we generalize the notion of character for 2-representations of finite 2-groups. The properties of 2-characters bear strong similarities to those classical characters of finite groups, including conjugation invariance,…

Dade's conjecture predicts that if p is a prime, then the number of irreducible characters of a finite group of a given p-defect is determined by local subgroups. In this paper we replace $p$ by a set of primes pi and prove a pi-version of…

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…

A canonical system of basic invariants is a system of invariants satisfying a set of differential equations. The properties of a canonical system are related to the mean value property for polytopes. In this article, we naturally identify…

Let A be a commutative noetherian ring. Call a functor <<commutative A-algebras>> --> <<sets>> coherent if it can be built up (via iterated finite limits) from functors of the form B \mapsto M tensor_A B, where M is a f.g. A-module. When…

We give a combinatorial consistency-inconsistency configuration that is equivalent to the failure of the following form of Kim's lemma for a given $k$: $(\star)$ For any set of parameters $A$, formula $\varphi(x,b)$, and $A$-bi-invariant…

We determine, for $p$ odd, all saturated fusion systems on a Sylow $p$-subgroup $S$ of the unitary group $SU_4(p)$ and we prove that they are all realizable by finite groups. In particular, we prove that $S$ does not support any exotic…

A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Let p be a prime number. Let G be a finite p-group and $\chi \in Irr(G)$. Denote by $\bar{\chi} \in Irr(G)$ the complex conjugate of $\chi$. Assume that $\chi(1)=p^n$. We show that the number of distinct irreducible constituents of the…

In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…

Let $B$ be a $p$-block of a finite group, and set $m=$ $\sum \chi(1)^2$, the sum taken over all height zero characters of $B$. Motivated by a result of M. Isaacs characterising $p$-nilpotent finite groups in terms of character degrees, we…

We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series. We construct combinatorial models whose…