Results 71 to 80 of about 240,213 (310)
Enumerative and Algebraic Combinatorics in the 1960's and 1970's [PDF]
arXiv, 2021 A partly autobiographical survey of the development of enumerative and algebraic combinatorics in the 1960's and 1970's.
arxiv
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT We have studied possible applications of a particular pseudodifferential algebra in singular analysis for the construction of fundamental solutions and Green's functions of a certain class of elliptic partial differential operators. The pseudodifferential algebra considered in the present work, comprises degenerate partial differential ...
Heinz‐Jürgen Flad +1 more
wiley +1 more source
Graphs with 3-Rainbow Index n − 1 and n − 2
Discussiones Mathematicae Graph Theory, 2015 Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, 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.
Li Xueliang +3 more
doaj +1 more source
Coxeter-biCatalan combinatorics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider several counting problems related to Coxeter-Catalan combinatorics and conjecture that the problems all have the same answer, which we call the $W$ -biCatalan number. We prove the conjecture in many cases.
Emily Barnard, Nathan Reading
doaj +1 more source
Borel chain conditions of Borel posets [PDF]
arXiv, 2021 We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different chain conditions, similar to the classical case.
arxiv
Alexander Duality and Rational Associahedra [PDF]
, 2013 A recent pair of papers of Armstrong, Loehr, and Warrington and Armstrong, Williams, and the author initiated the systematic study of {\em rational Catalan combinatorics} which is a generalization of Fuss-Catalan combinatorics (which is in turn a ...
Rhoades, Brendon
core
Hopf Algebras in Combinatorics
, 2020 These notes -- originating from a one-semester class by their second author at the University of Minnesota -- survey some of the most important Hopf algebras appearing in combinatorics.
Grinberg, Darij, Reiner, Victor
core +1 more source
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), EarlyView.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
Generalized Rainbow Connection of Graphs and their Complements
Discussiones Mathematicae Graph Theory, 2018 Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +1 more source
Lecture notes on algebraic methods in combinatorics [PDF]
arXiv, 2023 These are lecture notes of a course taken in Leipzig 2023, spring semester. It deals with extremal combinatorics, algebraic methods and combinatorial geometry. These are not meant to be exhaustive, and do not contain many proofs that were presented in the course.
arxiv