Results 21 to 30 of about 56,755 (205)
Generalized Polarization Modules (extended abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 This work enrols the research line of M. Haiman on the Operator Theorem (the old operator conjecture). This theorem states that the smallest $\mathfrak{S}_n$-module closed under taking partial derivatives and closed under the action of polarization ...
Héctor Blandin
doaj +1 more source
q-Partition algebra combinatorics
Journal of Combinatorial Theory, Series A, 2010 Introduction rewritten and minor mistakes ...
Tom Halverson, Nathaniel Thiem
openaire +3 more sources
New Hopf Structures on Binary Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +2 more
doaj +1 more source
Pauli channels can be estimated from syndrome measurements in quantum error correction [PDF]
Quantum, 2022 The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome measurements done
Thomas Wagner +3 more
doaj +1 more source
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
A noncommutative enumeration problem [PDF]
, 2010 In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of noncommutative formal ...
Bernabei, Maria Simonetta, Thaler, Horst
core +3 more sources
Dynamics of plane partitions: Proof of the Cameron–Fon-Der-Flaass conjecture
Forum of Mathematics, Sigma, 2020 One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995): consider a plane partition P in an $a \times b \times c$ box ${\sf B}$ . Let $\Psi (P)$
Rebecca Patrias, Oliver Pechenik
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
Noetherianity up to symmetry [PDF]
, 2013 These lecture notes for the 2013 CIME/CIRM summer school Combinatorial Algebraic Geometry deal with manifestly infinite-dimensional algebraic varieties with large symmetry groups.
Draisma, Jan
core +4 more sources
A survey on association schemes on triples
Electronic Journal of Graph Theory and Applications, 2023 Association schemes on triples (ASTs) are ternary analogues of classical association schemes, whose relations and adjacency algebras are ternary instead of binary.
Jose Maria P Balmaceda +1 more
doaj +1 more source