Results 21 to 30 of about 55,778 (257)
Applications of Algebraic Combinatorics to Algebraic Geometry [PDF]
Indagationes Mathematicae, 2021 We formulate a number of new results in Algebraic Geometry and outline their derivation from Theorem 2.12 which belongs to Algebraic Combinatorics.
David Kazhdan, Tamar Ziegler
openaire +3 more sources
On the Combinatorics of Gentle Algebras [PDF]
Canadian Journal of Mathematics, 2019 AbstractFor $A$ a gentle algebra, and $X$ and $Y$ string modules, we construct a combinatorial basis for $\operatorname{Hom}(X,\unicode[STIX]{x1D70F}Y)$. We use this to describe support $\unicode[STIX]{x1D70F}$-tilting modules for $A$. We give a combinatorial realization of maps in both directions realizing the bijection between support $\unicode[STIX]{
Kaveh Mousavand +4 more
openaire +4 more sources
Newton Polytopes in Algebraic Combinatorics [PDF]
Selecta Mathematica, 2017 30 ...
Cara Monical +2 more
openalex +5 more sources
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
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
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 combinatorics in bounded induction [PDF]
Annals of Pure and Applied Logic, 2021 In this paper, new methods for analyzing models of weak subsystems of Peano Arithmetic are proposed. The focus will be on the study of algebro-combinatoric properties of certain definable cuts. Their relationship with segments that satisfy more induction, with those limited by the standard powers/roots of an element, and also with definable sets in ...
openaire +3 more sources
Geometric and algebraic combinatorics
European Journal of Combinatorics, 2007 The present issue of the European Journal of Combinatorics contains papers on finite incidence geometries, combinatorial designs, and algebraic graph theory, captured by the name Geometric and Algebraic Combinatorics. This name, abbreviated to GAC, is also carried by a series of conferences held in Oisterwijk, The Netherlands.
Edwin van Dam, Willem H. Haemers
openaire +2 more sources
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