Results 31 to 40 of about 654,082 (251)
Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2016 Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule.
P. Giscard, P. Rochet
semanticscholar +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
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
Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry [PDF]
Memoirs of the American Mathematical Society, 2015 In recent years it has been noted that a number of combinatorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular band.
S. Margolis +2 more
semanticscholar +1 more source
UNLIKELY INTERSECTIONS IN FINITE CHARACTERISTIC
Forum of Mathematics, Sigma, 2018 We present a heuristic argument based on Honda–Tate theory against many conjectures in ‘unlikely intersections’ over the algebraic closure of a finite field; notably, we conjecture that every abelian variety of dimension 4 is isogenous to a Jacobian ...
ANANTH N. SHANKAR, JACOB TSIMERMAN
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
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
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
Graph Theory and Additive Combinatorics
, 2023 Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics.
Yufei Zhao
semanticscholar +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