A combinatorial approach to Harada's conjecture II of the groups related to the symmetric groups

  • Abstract
  • Literature Map
  • Similar Papers
Abstract
Translate article icon Translate Article Star icon
Take notes icon Take Notes

A combinatorial approach to Harada's conjecture II of the groups related to the symmetric groups

Similar Papers
  • Research Article
  • Cite Count Icon 5
  • 10.1006/aima.2001.2043
Fischer Matrices for Generalised Symmetric Groups—A Combinatorial Approach
  • May 25, 2002
  • Advances in Mathematics
  • Mohammed Almestady + 1 more

Fischer Matrices for Generalised Symmetric Groups—A Combinatorial Approach

  • Research Article
  • Cite Count Icon 33
  • 10.1016/s0012-365x(01)00361-2
Factorizations of large cycles in the symmetric group
  • Nov 27, 2001
  • Discrete Mathematics
  • Dominique Poulalhon + 1 more

Factorizations of large cycles in the symmetric group

  • Research Article
  • Cite Count Icon 7
  • 10.1023/a:1021287622494
Enantiomeric and Diastereomeric Relationships of Ethylene Derivatives. Restructuring Stereochemistry by a Group-Theoretical and Combinatorial Approach
  • Jan 1, 2002
  • Journal of Mathematical Chemistry
  • Shinsaku Fujita

To restructure stereochemistry into a systematic format, enantiomeric and diastereomeric relationships have been investigated by using ethylene derivatives as examples in the light of a new group-theoretical and combinatorial approach. On one hand, enantiomeric relationship for ethylene derivatives has been characterized by means of a point group of order 8 (D 2h ), where chirality fittingness based on the sphericity concept has been applied to the enumeration of stereoisomers. On the other hand, diastereomeric relationship for ethylene derivatives has been examined by a permutation group of order 8 (S 9 [4]), which is a subgroup of the symmetric group of order 4 (S [4]) and isomorphic to a point group D 2d . The subgroups of S 9 [4] have been classified into stereogenic and astereogenic ones. A stereogenic subgroup corresponds to a pair of diastereomers, while an astereogenic subgroup is assigned to a self-diastereomer. The relationship between diastereomers and constitutional isomers have been also discussed.

  • Research Article
  • Cite Count Icon 3
  • 10.1016/j.aam.2021.102283
A versatile combinatorial approach of studying products of long cycles in symmetric groups
  • Oct 20, 2021
  • Advances in Applied Mathematics
  • Ricky X.F Chen

A versatile combinatorial approach of studying products of long cycles in symmetric groups

  • Research Article
  • Cite Count Icon 7
  • 10.1142/s021821651843006x
Simply connected latin quandles
  • Oct 1, 2018
  • Journal of Knot Theory and Its Ramifications
  • Marco Bonatto + 1 more

A (left) quandle is connected if its left translations generate a group that acts transitively on the underlying set. In 2014, Eisermann introduced the concept of quandle coverings, corresponding to constant quandle cocycles of Andruskiewitsch and Graña. A connected quandle is simply connected if it has no nontrivial coverings, or, equivalently, if all its second constant cohomology sets with coefficients in symmetric groups are trivial. In this paper, we develop a combinatorial approach to constant cohomology. We prove that connected quandles that are affine over cyclic groups are simply connected (extending a result of Graña for quandles of prime size) and that finite doubly transitive quandles of order different from [Formula: see text] are simply connected. We also consider constant cohomology with coefficients in arbitrary groups.

  • Research Article
  • 10.26493/1855-3974.765.46c
On some generalization of the Möbius configuration
  • Feb 19, 2017
  • Ars Mathematica Contemporanea
  • Krzysztof Petelczyc

The Mobius (8 4 ) configuration is generalized in a purely combinatorial approach. We consider (2 n n ) configurations M ( n , φ ) depending on a permutation φ in the symmetric group S n . Classes of non-isomorphic configurations of this type are determined. The parametric characterization of M ( n , φ ) is given. The uniqueness of the decomposition of M ( n , φ ) into two mutually inscribed n -simplices is discussed. The automorphisms of M ( n , φ ) are characterized for n ≥ 3 .

  • Research Article
  • Cite Count Icon 4
  • 10.1016/j.disc.2016.10.009
Stability properties of the plethysm: A combinatorial approach
  • Nov 21, 2016
  • Discrete Mathematics
  • Laura Colmenarejo

Stability properties of the plethysm: A combinatorial approach

  • Research Article
  • 10.46298/dmtcs.3629
Combinatorial interpretation and positivity of Kerov's character polynomials
  • Jan 1, 2008
  • Discrete Mathematics & Theoretical Computer Science
  • Valentin Féray

Kerov's polynomials give irreducible character values of the symmetric group in term of the free cumulants of the associated Young diagram. Using a combinatorial approach with maps, we prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Les polynômes de Kerov expriment les valeurs des caractères irréductibles du groupe symétrique en fonction des cumulants libres du diagramme de Young associé. Grâce à une approche combinatoire à base de cartes, nous prouvons dans cet article un résultat de positivité sur leurs coefficients, qui généralise une conjecture de S. Kerov.

  • Research Article
  • Cite Count Icon 16
  • 10.1006/eujc.1998.0242
A Combinatorial Approach to the Fusion Process for the Symmetric Group
  • Oct 1, 1998
  • European Journal of Combinatorics
  • Valentina Guizzi + 1 more

A Combinatorial Approach to the Fusion Process for the Symmetric Group

  • Research Article
  • Cite Count Icon 14
  • 10.1006/eujc.1996.0056
A Combinatorial Approach to the Double Cosets of the Symmetric Group with respect to Young Subgroups
  • Oct 1, 1996
  • European Journal of Combinatorics
  • Andrew R Jones

A Combinatorial Approach to the Double Cosets of the Symmetric Group with respect to Young Subgroups

  • Research Article
  • Cite Count Icon 8
  • 10.1016/j.nuclphysb.2006.05.027
Character decomposition of Potts model partition functions, II: Toroidal geometry
  • Jun 15, 2006
  • Nuclear Physics, Section B
  • Jean-François Richard + 1 more

Character decomposition of Potts model partition functions, II: Toroidal geometry

  • Book Chapter
  • 10.1007/978-88-470-2107-5_21
A combinatorial approach to the theory of Pi-algebras and exponential growth
  • Jan 1, 2001
  • A. Giambruno

The theory of Pi-algebras has been developed in the last decade mainly through combinatorial methods pertaining to the representation theory of the symmetric group in characteristic zero. These methods together with the study of the asymptotic behavior of a numerical sequence related to a PI-algebra have lead to the notion of the PIexponent of an algebra. Through the scale determined by the exponent many results have been obtained in the last few years shedding new light on the understanding of the polynomial identities of an algebra.

  • Research Article
  • 10.4171/jncg/568
Automorphisms of quantum polynomial rings and Drinfeld Hecke algebras
  • Apr 18, 2024
  • Journal of Noncommutative Geometry
  • Anne V Shepler + 1 more

We consider quantum (skew) polynomial rings and observe that their graded automorphisms coincide with those of quantum exterior algebras. This allows us to define a quantum determinant that gives a homomorphism of groups acting on quantum polynomial rings. We use quantum subdeterminants to classify the resulting Drinfeld Hecke algebras for the symmetric group, other infinite families of Coxeter and complex reflection groups, and mystic reflection groups (which satisfy a version of the Shephard–Todd–Chevalley theorem). This direct combinatorial approach replaces the technology of Hochschild cohomology used by Naidu and Witherspoon over fields of characteristic zero and allows us to extend some of their results to fields of arbitrary characteristic and also locate new deformations of skew group algebras.

Save Icon
Up Arrow
Open/Close
  • Ask R Discovery Star icon
  • Chat PDF Star icon

AI summaries and top papers from 250M+ research sources.