Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Combinatorial identities"”.
-
On the Solvability of Beta-Ensembles when Beta is a Square Integer
We use combinatorial identities in the shuffle and exterior algebra to present hyperpfaffian formulations of partition functions for ß-ensembles with arbitrary probability measure when ß is a square integer. This is an analogue of the de Bruijn integral identities for the ß = 1 and ß = 4 ensembles. …
-
On the Dynamical Wilf-Zeilberger Problem
… a dynamical analog of the problem of certifying combinatorial identities by Wilf-Zeilberger pairs. Given two sequences generated in a dynamical setting, we calculate an upper bound N ≥ 1 such that whenever the first N terms of the two sequences agree pairwise, the two sequences agree …
-
From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers
… terms and odd terms for Dr. Edward's original combinatorial expression, are two distinct combinatorial expressions that are in fact equal. But there is no obvious algebraic evidence to show that they are equal. There are induction proofs in the paper. But I wondered if there is a better way to …
-
Parity Theorems for Combinatorial Statistics
… <em>G<em>n</em></em>(<em>q</em>) of a combinatorial sequence <em>G<em>n </em></em>which reduces to that sequence when <em>q </em>= 1 is obtained by <em>q</em>-counting a statistic defined on a sequence of finite discrete structures enumerated by <em>G<em>n</em></em>. In what follows, we …
-
Generalizations of Pascal's Triangle: A Construction Based Approach
… we are able to derive several interesting combinatorial identities from our construction.
-
Random allocations: new and extended models and techniques with applications and numerics.
… size distribution. Models are analysed using combinatorial analysis and Markov Chains. Global attributes are measured, including maximum waits, maximum room required, moments and the clustering of completions. Various conversion formulae have been devised to reduce calculation times by several …
-
Generating function proofs of identities and congruences
Thesis (Ph. D.)--Michigan State University, Department of Mathematics, 2003