Meng Li,Ron Goldman Meng Li

We provide a probabilistic approach using renewal theory to derive some novel identities involving Eulerian numbers and uniform B-splines. The renewal perspective leads to a unified treatment for the normalized binomial coefficients and the...

Tim Boykett Tim Boykett

The quasivariety of groupoids [Formula: see text] satisfying the implication [Formula: see text] generalises rectangular semigroups and central groupoids. We call them rectangular groupoids and find three combinatorial structures based upon...

Felix Breuer,Aaron Dall,Martina Kubitzke Felix Breuer

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes-a purely combinatorial one and two geometric ones. It is shown, that most of ...

Herwig Hauser,Christoph Koutschan Herwig Hauser

Bousquet-Mélou and Petkovšek investigated the generating functions of multivariate linear recurrences with constant coefficients. We will give a reinterpretation of their results by means of division theorems for formal power series, whic...

Horst Trinker Horst Trinker

We study the distribution of triples of codewords of codes and ordered codes. Schrijver [A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (8) (2005) 2859-2866] used...

Wolfgang Woess Wolfgang Woess

This is a continuation of the study, begun by Ceccherini-Silberstein and Woess (2009) [5], of context-free pairs of groups and the related context-free graphs in the sense of Muller and Schupp (1985) [22]. The graphs under consideration are...

Clemens Heuberger,Stephan Wagner Clemens Heuberger

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) [Formula: see text] of a tree T of given order. While the trees that attain the lower bound are easily characterised, the trees...

Hongliang Lu,Wei Wang,Bing Bai Hongliang Lu

Let k, m, and r be three integers such that 2≤k≤m≤r. Let G be a 2r-regular, 2m-edge-connected graph of odd order. We obtain some sufficient conditions for G-v to contain a k-factor for all v∈V(G).

L A Székely,Hua Wang,Taoyang Wu L A Székely

Various topological indices have been put forward in different studies from bio-chemistry to pure mathematics. Among them the Wiener index, the number of subtrees and the Randić index have received great attention from mathematicians. Whil...