Related papers: Counting Nodes in Smolyak Grids

We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and solve it by using bivariate exponential generating functions. The family of recurrence relations considered in the problem contains many…

We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski…

We consider certain generalizations of gentle algebras that we call semilinear locally gentle algebras. These rings are examples of semilinear clannish algebras as introduced by the second author and Crawley-Boevey. We generalise the notion…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

An important issue in clustering concerns the avoidance of false positives while searching for clusters. This work addressed this problem considering agglomerative methods, namely single, average, median, complete, centroid and Ward's…

Let $D\geq 1$ and $q\geq 3$ be two integers. Let $H(D)=H(D,q)$ denote the $D$-dimensional Hamming graph over a $q$-element set. Let ${\mathcal T}(D)$ denote the Terwilliger algebra of $H(D)$. Let $V(D)$ denote the standard ${\mathcal…

We give strong necessary conditions on the admissibility of a Polish group topology for an arbitrary graph product of groups $G(\Gamma, G_a)$, and use them to give a characterization modulo a finite set of nodes. As a corollary, we give a…

We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…

In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…

This paper introduces a novel algorithm for cardinality, i.e., the number of nodes, estimation in large scale anonymous graphs using statistical inference methods. Applications of this work include estimating the number of sensor devices,…

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous…

By the planarity rank of a semigroup variety we mean the largest number of generators of a free semigroup of a variety with respect to which the semigroup admits a planar Cayley graph. Since the time when L.M.Martynov formulated the problem…

The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential)…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Chern-Simons gauge theory for compact semisimple groups is analyzed from a perturbation theory point of view. The general form of the perturbative series expansion of a Wilson line is presented in terms of the Casimir operators of the gauge…

We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…

In this paper, we look at how to count the number of elements of a set within the frame of Sergeyev's numeral system. We also look at the connection between the number of elements of a set and the notion of bijection in this new setting. We…