Results 41 to 50 of about 654,082 (251)
Application of graph combinatorics to rational identities of type $A^\ast$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain permutations of the ...
Adrien Boussicault, Valentin Féray
doaj +1 more source
Orbits of strongly solvable spherical subgroups on the flag variety [PDF]
, 2017 Let G be a connected reductive complex algebraic group and B a Borel subgroup of G. We consider a subgroup H of B acting with finitely many orbits on the flag variety G/B, and we classify the H-orbits in G/B in terms of suitable combinatorial invariants.
Gandini, Jacopo, Pezzini, Guido
core +2 more sources
Partial categorification of Hopf algebras and representation theory of towers of \mathcalJ-trivial monoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 This paper considers the representation theory of towers of algebras of $\mathcal{J} -trivial$ monoids. Using a very general lemma on induction, we derive a combinatorial description of the algebra and coalgebra structure on the Grothendieck rings $G_0 ...
Aladin Virmaux
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2014 A general lattice theoretic construction of Reading constructs Hopf subalgebras of the Malvenuto-Reutenauer Hopf algebra (MR) of permutations. The products and coproducts of these Hopf subalgebras are defined extrinsically in terms of the embedding in MR.
Shirley Law
doaj +1 more source
Performance Evaluation of Demodulation Methods: a Combinatorial Approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 This paper provides a combinatorial approach for analyzing the performance of demodulation methods used in GSM. We also show how to obtain combinatorially a nice specialization of an important performance evaluation formula, using its connection with a ...
Daniel Krob, Ekaterina A. Vassilieva
doaj +1 more source
3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs
Mathematical and Computational Applications, 2017 The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block ...
Xiaolian Liao, Guohua Chen, Shangzhao Li
doaj +1 more source
Algebraic and Geometric Methods in Enumerative Combinatorics [PDF]
, 2014 Enumerative combinatorics is about counting. The typical question is to find the number of objects with a given set of properties. However, enumerative combinatorics is not just about counting.
Federico Ardila
semanticscholar +1 more source
Abstract involutions of algebraic groups and of Kac-Moody groups [PDF]
, 2010 Based on the second author's thesis in this article we provide a uniform treatment of abstract involutions of algebraic groups and of Kac-Moody groups using twin buildings, RGD systems, and twisted involutions of Coxeter groups. Notably we simultaneously
Berger M. +9 more
core +2 more sources
On Expansion of a Solution of General Non-autonomous Polynomial Differential Equation [PDF]
, 2014 We give a recursive formula for an expansion of a solution of a general non-autonomous polynomial differential equation. The formula is given on the algebraic level with a use of shuffle product. This approach minimizes the number of integrations on each
Pietrzkowski, Gabriel
core +2 more sources
Extending the parking space [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 The action of the symmetric group $S_n$ on the set $\mathrm{Park}_n$ of parking functions of size $n$ has received a great deal of attention in algebraic combinatorics.
Andrew Berget, Brendon Rhoades
doaj +1 more source