English
Related papers

Related papers: Character theoretic techniques for nonabelian part…

200 papers

In representation theory of finite groups an important role is played by irreducible characters of p-defect 0, for a prime p dividing the group order. These are exactly those vanishing at the p-singular elements. In this paper we generalize…

Group Theory · Mathematics 2014-11-13 M. A. Pellegrini , A. Zalesski

We single out a class of difference families which is widely used in some constructions of Hadamard matrices and which we call Goethals--Seidel (GS) difference families. They consist of four subsets (base blocks) of a finite abelian group…

Combinatorics · Mathematics 2024-01-23 Dragomir Z. Djokovic , Ilias S. Kotsireas

Difference sets have been studied for more than 80 years. Techniques from algebraic number theory, group theory, finite geometry, and digital communications engineering have been used to establish constructive and nonexistence results. We…

Bayesian network classifiers are used in many fields, and one common class of classifiers are naive Bayes classifiers. In this paper, we introduce an approach for reasoning about Bayesian network classifiers in which we explicitly convert…

Machine Learning · Computer Science 2012-12-12 Hei Chan , Adnan Darwiche

We give two new constructions of almost difference sets. The first is a generic construction of $(q^{2}(q+1),q(q^{2}-1),q(q^{2}-q-1),q^{2}-1)$ almost difference sets in certain groups of order $q^{2}(q+1)$ ($q$ is an odd prime power) having…

Combinatorics · Mathematics 2018-07-27 Jerod Michel , Qi Wang

The conformal Galilei algebra (CGA) and the exotic conformal Galilei algebra (ECGA) are applied to construct partial differential equations (PDEs) and systems of PDEs, which admit these algebras. We show that there are no single…

Mathematical Physics · Physics 2010-05-19 Roman Cherniha , Malte Henkel

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic

Partial Least Squares (PLS) refer to a class of dimension-reduction techniques aiming at the identification of two sets of components with maximal covariance, to model the relationship between two sets of observed variables…

Methodology · Statistics 2023-02-23 Lola Etievant , Vivian Viallon

The problem of computing differential constraints for a family of evolution PDEs is discussed from a constructive point of view. A new method, based on the existence of generalized characteristics for evolution vector fields, is proposed in…

Mathematical Physics · Physics 2020-08-04 Francesco C. De Vecchi , Paola Morando

We study the character theory of metabelian and polycyclic groups. It is used to investigate Hilbert-Schmidt stability via the character-theoretic criterion of Hadwin and Shulman. There is a close connection between stability and dynamics…

Group Theory · Mathematics 2023-07-14 Arie Levit , Itamar Vigdorovich

In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…

Combinatorics · Mathematics 2020-05-18 Joy Morris , Mariapia Moscatiello , Pablo Spiga

In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…

Computational Complexity · Computer Science 2013-05-01 Sixia Chen , Cristopher Moore , Alexander Russell

Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…

Group Theory · Mathematics 2011-02-23 Hung P. Tong-Viet

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…

Combinatorics · Mathematics 2016-10-21 Yoshiharu Kohayakawa , Vojtěch Rödl , Mathias Schacht

In 1973, I. M. Isaacs described a correspondence between characters of degree not divisible by a fixed prime $p$ of a finite solvable group $G$ and those of the normalizer of Sylow $p$-subgroup of $G$, whenever the index of the normalizer…

Representation Theory · Mathematics 2019-09-10 Carolina Vallejo

Dynamic processes of interacting units on a network are out of equilibrium in general. In the case of a directed tree, the dynamic cavity method provides an efficient tool that characterises the dynamic trajectory of the process for the…

Disordered Systems and Neural Networks · Physics 2022-05-25 Giuseppe Torrisi , Reimer Kühn , Alessia Annibale

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_k)$ of its elements such that the partial sums $(s_0, s_1, \ldots, s_k)$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i a_i$ for $1 \leq i \leq k$,…

Combinatorics · Mathematics 2022-05-25 Simone Costa , Stefano Della Fiore

Using the tri-hamiltonian splitting method, the authors of [Anco and Mobasheramini, Physica D, 355:1--23, 2017] derived two $U(1)$-invariant nonlinear PDEs that arise from the hierarchy of the nonlinear Schr\"{o}dinger equation and admit…

Exactly Solvable and Integrable Systems · Physics 2017-11-07 Stephen C. Anco , Xiangke Chang , Jacek Szmigielski

We point out how to use the classical characteristic method, that is used to solve quasilinear PDE's, to obtain the matrix exponential of some lower triangle infinite matrices. We use the Lie Frechet structure of the Riordan group described…

Dynamical Systems · Mathematics 2023-01-03 Pedro J. Chocano , Ana Luzón , Manuel Alonso Morón , Luis Felipe Prieto Martínez

we obtain a necessary condition for the character degree graph with all of its vertices are odd degree of a finite solvable group G.

Group Theory · Mathematics 2023-05-23 G. Sivanesan , C. Selvaraj
‹ Prev 1 8 9 10 Next ›