Results 21 to 30 of about 1,043,180 (331)
Symmetries among Multivariate Information Measures Explored Using Möbius Operators
Entropy, 2019 Relations between common information measures include the duality relations based on Möbius inversion on lattices, which are the direct consequence of the symmetries of the lattices of the sets of variables (subsets ordered by inclusion).
David J. Galas, Nikita A. Sakhanenko
doaj +1 more source
Some properties of Square element graphs over semigroups
AKCE International Journal of Graphs and Combinatorics, 2020 The Square element graph over a semigroup is a simple undirected graph whose vertex set consists precisely of all the non-zero elements of , and two vertices are adjacent if and only if either or belongs to the set , where 1 is the identity of the ...
Bijon Biswas +3 more
doaj +1 more source
Closed subgroups of the infinite symmetric group [PDF]
, 2004 Let S=Sym(\Omega) be the group of all permutations of a countably infinite set \Omega, and for subgroups G_1, G_2\leq S let us write G_1\approx G_2 if there exists a finite set U\subseteq S such that = .
Bergman, George M., Shelah, Saharon
core +4 more sources
Conjectures on the normal covering number of finite symmetric and alternating groups [PDF]
International Journal of Group Theory, 2014 Let gamma(Sn) be the minimum number of proper subgroups Hi, i = 1,...,ell, of the symmetric group Sn such that each element in Sn lies in some conjugate of one of the Hi.
Daniela Bubboloni +2 more
doaj
Chromatic Properties of the Pancake Graphs
Discussiones Mathematicae Graph Theory, 2017 Chromatic properties of the Pancake graphs Pn, n ⩾ 2, that are Cayley graphs on the symmetric group Symn generated by prefix-reversals are investigated in the paper.
Konstantinova Elena
doaj +1 more source
Pseudo-Permutations II: Geometry and Representation Theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we provide the second part of the study of the pseudo-permutations. We first derive a complete analysis of the pseudo-permutations, based on hyperplane arrangements, generalizing the usual way of translating the permutations. We then study
François Boulier +3 more
doaj +1 more source
Harmonic analysis on the infinite symmetric group [PDF]
, 2003 Let S be the group of finite permutations of the naturals 1,2,... The subject of the paper is harmonic analysis for the Gelfand pair (G,K), where G stands for the product of two copies of S while K is the diagonal subgroup in G.
Anatoly Vershik +33 more
core +1 more source
On the Genus of Symmetric Groups [PDF]
Transactions of the American Mathematical Society, 1981 A new method for determining genus of a group is described. It involves first getting a bound on the sizes of the generating set for which the corresponding Cayley graph could have smaller genus. The allowable generating sets are then examined by methods of computing average face sizes and by voltage graph techniques to find the best embeddings.
openaire +2 more sources
Words and polynomial invariants of finite groups in non-commutative variables [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let $V$ be a complex vector space with basis $\{x_1,x_2,\ldots,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, \ldots, x_n$ with ...
Anouk Bergeron-Brlek +2 more
doaj +1 more source
Kronecker coefficients: the tensor square conjecture and unimodality [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We consider two aspects of Kronecker coefficients in the directions of representation theory and combinatorics. We consider a conjecture of Jan Saxl stating that the tensor square of the $S_n$-irreducible representation indexed by the staircase partition
Igor Pak, Greta Panova, Ernesto Vallejo
doaj +1 more source