Results 51 to 60 of about 240,213 (310)
Recent developments in algebraic combinatorics
, 2004 A survey of three recent developments in algebraic combinatorics: (1) the Laurent phenomenon, (2) Gromov-Witten invariants and toric Schur functions, and (3) toric h-vectors and intersection cohomology. This paper is a continuation of "Recent progress in
Stanley, Richard P.
core +2 more sources
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
On the Combinatorics of Gentle Algebras [PDF]
Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 2017 For $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$.
T. Brüstle +4 more
semanticscholar +1 more source
Hopf algebras and the combinatorics of connected graphs in quantum field theory
, 2008 In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators.
Mestre, Angela, Oeckl, Robert
core +1 more source
Constructing elliptic curve isogenies in quantum subexponential time
Journal of Mathematical Cryptology, 2014 Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source
Backbone colouring and algorithms for TDMA scheduling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring ...
Julien Bensmail +4 more
doaj +1 more source
Toward a Solution of Archdeacon's Conjecture on Integer Heffter Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this article, we make significant progress on a conjecture proposed by Dan Archdeacon on the existence of integer Heffter arrays H(m,n;s,k) ${\rm{H}}(m,n;s,k)$ whenever the necessary conditions hold, that is, 3⩽s⩽n $3\leqslant s\leqslant n$, 3⩽k⩽m $3\leqslant k\leqslant m$, ms=nk $ms=nk$ and nk≡0,3(mod4) $nk\equiv 0,3\,(\mathrm{mod}\,4 ...
Marco Antonio Pellegrini +1 more
wiley +1 more source
Combinatorics of diagrams of permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 There are numerous combinatorial objects associated to a Grassmannian permutation $w_λ$ that index cells of the totally nonnegative Grassmannian. We study some of these objects (rook placements, acyclic orientations, various restricted fillings) and their q-analogues in the case of permutations $\mathcal{w}$ that are not necessarily Grassmannian.
Lewis, Joel Brewster +1 more
openaire +7 more sources
On the Rainbow Vertex-Connection
Discussiones Mathematicae Graph Theory, 2013 A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that ...
Li Xueliang, Shi Yongtang
doaj +1 more source
Teaching Combinatorial Principles Using Relations through the Placemat Method
Mathematics, 2021 The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific ...
Viliam Ďuriš +3 more
doaj +1 more source