Related papers: Character theoretic techniques for nonabelian part…

Let $G$ be a finite solvable group, let $Irr(G)$ be the set of all complex irreducible characters of $G$ and let $cd(G)$ be the set of all degrees of characters in $Irr(G).$ Let $\rho(G)$ be the set of primes that divide degrees in $cd(G).$…

The paper relates character value of an irreducible representation of a compact connected Lie group at certain elements of finite order with the dimension of a representation on another group, up to some precise constants, which all have…

For each finite group G, we define the Grothendieck-Teichm\"uller group of G, denoted GT(G), and explore its properties. The theory of dessins d'enfants shows that the inverse limit of GT(G) as G varies can be identified with a group…

Partial differential equations are fundamental tools in mathematics,sciences and engineering. This book is mainly an exposition of the various algebraic techniques of solving partial differential equations for exact solutions developed by…

Let G be a finite group with Sylow p-subgroup P. We show that the character table of G determines whether P has maximal nilpotency class and whether P is a minimal non-abelian group. The latter result is obtained from a precise…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…

We review pedagogically non-Abelian discrete groups, which play an important role in the particle physics. We show group-theoretical aspects for many concrete groups, such as representations, their tensor products. We explain how to derive,…

A diagonal base of a Sylow 2-subgroup $P_n(2)$ of symmetric group $S_{2^n}$ is a minimal generating set of this subgroup consisting of elements with only one non-zero coordinate in the polynomial representation. For different diagonal bases…

We begin the study of character sheaves on a not necessarily connected reductive group, extending the known theory for connected groups.

For a finite non-abelian group $G$ let $\rat(G)$ denote the largest ratio of degrees of two nonlinear irreducible characters of $G$. We prove that the number of non-abelian composition factors of $G$ is bounded above by…

A linear algebraic group G over a field k is called a Cayley group if it admits a Cayley map, i.e., a G-equivariant birational isomorphism over k between the group variety G and the Lie algebra Lie(G). A Cayley map can be thought of as a…

The proximal stochastic gradient method (PSGD) is one of the state-of-the-art approaches for stochastic composite-type problems. In contrast to its deterministic counterpart, PSGD has been found to have difficulties with the correct…

Causal discovery aims to recover a causal graph from data generated by it; constraint based methods do so by searching for a d-separating conditioning set of nodes in the graph via an oracle. In this paper, we provide analytic evidence that…

Let $F$ be a non-archimedean local field of characteristic different from $2$ and $G$ be either an odd special orthogonal group ${\rm SO}_{2r+1}(F)$ or a symplectic group ${\rm Sp}_{2r}(F)$. In this paper, we establish the local converse…

A finite group $G$ is a "non-DCI group" if there exist subsets $S_1$ and $S_2$ of $G$, such that the associated Cayley digraphs $C\overrightarrow{ay}(G;S_1)$ and $C\overrightarrow{ay}(G;S_2)$ are isomorphic, but no automorphism of $G$…

Anomaly detection is crucial to ensure the security of cyber-physical systems (CPS). However, due to the increasing complexity of CPSs and more sophisticated attacks, conventional anomaly detection methods, which face the growing volume of…

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

By means of the nonlinear modeling technique (NM technique), we find the nonlinear deterministic structures in the promoter regions (PPRs) of DNA sequences, called deterministic valleys (DVs) in this paper. These DVs prefer to occur much…

Probabilistic dependency graphs (PDGs) are a flexible class of probabilistic graphical models, subsuming Bayesian Networks and Factor Graphs. They can also capture inconsistent beliefs, and provide a way of measuring the degree of this…

We analysis some singular partial differential equations systems(PDAEs) with boundary conditions in high dimension bounded domain with sufficiently smooth boundary. With the eigenvalue theory of PDE the systems initially is formulated as an…