Results 21 to 30 of about 211,771 (176)
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
, 2007 We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.Comment: Adv. in Appl. Math.
Baez +12 more
core +7 more sources
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
Combinatorics of free cumulants [PDF]
, 1999 We derive a formula for expressing free cumulants whose entries are products of random variables in terms of the lattice structure of non-crossing partitions. We show the usefulness of that result by giving direct and conceptually simple proofs for a lot
Krawczyk, Bernadette, Speicher, Roland
core +3 more sources
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction
Journal of Combinatorial Designs, EarlyView.ABSTRACT The directed Oberwolfach problem OP*(m1,…,mk) ${\text{OP}}^{* }({m}_{1},{\rm{\ldots }},{m}_{k})$ asks whether the complete symmetric digraph Kn* ${K}_{n}^{* }$, assuming n=m1+⋯+mk $n={m}_{1}+{\rm{\cdots }}+{m}_{k}$, admits a decomposition into spanning subdigraphs, each a disjoint union of k $k$ directed cycles of lengths m1,…,mk ${m}_{1},{\rm{
Suzan Kadri, Mateja Šajna
wiley +1 more source
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry
Journal of Combinatorial Designs, EarlyView.ABSTRACT We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction.
Alex Elzenaar, Shayne Waldron
wiley +1 more source
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
Independent Sets of Random Trees and Sparse Random Graphs
Journal of Graph Theory, EarlyView.ABSTRACT An independent set of size k $k$ in a finite undirected graph G $G$ is a set of k $k$ vertices of the graph, no two of which are connected by an edge. Let xk ( G ) ${x}_{k}(G)$ be the number of independent sets of size k $k$ in the graph G $G$ and let α ( G ) = max { k ≥ 0 : x k ( G ) ≠ 0 } $\alpha (G)=\max \{k\ge 0:{x}_{k}(G)\ne 0\}$. In 1987,
Steven Heilman
wiley +1 more source
Supersymmetry and Combinatorics
, 2006 We show how a recently proposed supersymmetric quantum mechanics model leads to non-trivial results/conjectures on the combinatorics of binary necklaces and linear-feedback shift-registers.
Onofri, E., Veneziano, G., Wosiek, J.
core +3 more sources
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Journal of Graph Theory, EarlyView.ABSTRACT Given a hypergraph H ${\rm{ {\mathcal H} }}$, the dual hypergraph of H ${\rm{ {\mathcal H} }}$ is the hypergraph of all minimal transversals of H ${\rm{ {\mathcal H} }}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another.
Endre Boros +3 more
wiley +1 more source