Results 11 to 20 of about 305,985 (193)
Algebraic proof of recursive relation for Boros-Moll polynomial sequence [PDF]
Journal of Hebei University of Science and Technology, 2023 In order to expand the basic theory of the recurrence relationship of Boros-Moll polynomial sequence, a new proof method for the recurrence relationship of Boros-Moll polynomial sequence was studied.
Yujie DOU +3 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
Arc Spaces and Rogers-Ramanujan Identities [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan Identities.
Clemens Bruschek +2 more
doaj +1 more source
A pair of dual Hopf algebras on permutations
AIMS Mathematics, 2021 Hopf algebras are important objects in algebraic combinatorics since they have strong stability. In particular, its dual space is an important tool to study the properties of the original Hopf algebra.
Mingze Zhao, Huilan Li
doaj +1 more source
Chromatic roots as algebraic integers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on Combinatorics and Statistical Mechanics in 2008, two conjectures were proposed on the subject of which algebraic integers can be chromatic roots, known ...
Adam Bohn
doaj +1 more source
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
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
The algebraic combinatorics of snakes [PDF]
, 2011 Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations.
Josuat-Vergès, Matthieu +2 more
core +6 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
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