Related papers: Counting Nodes in Smolyak Grids

We constructed linear algorithms of sampling recovery and cubature formulas on Smolyak grids parametrized by $m \in \mathbb{N}$ of periodic $d$-variate functions having Lipschitz-H\"older mixed smoothness $\alpha > 0$ based on B-spline…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

In this paper, we develop a systematic approach to enumerate curves with a certain number of nodes and one further singularity which maybe more degenerate. As a result, we obtain an explicit formula for the number of curves in a…

This work outlines an exact combinatorial approach to finite coagulating systems through recursive equations and use of generating function method. In the classic approach the mean-field Smoluchowski coagulation is used. However, the…

Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…

By using an approach of the invariant theory we obtain a new formula for the ordinary generating function of the numbers of the simple graphs with $n$ nodes.

For the purpose of uncertainty quantification with collocation, a method is proposed for generating families of one-dimensional nested quadrature rules with positive weights and symmetric nodes. This is achieved through a reduction…

Over the past decade, a combinatorial framework for discrete, finite, and irreversibly aggregating systems has emerged. This work reviews its progress, practical applications, and limitations. We outline the approach's assumptions and…

The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…

The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a…

We consider the problem of the combinatorial computation of the first Chern class of a circle bundle. N.Mnev found such a formula in terms of canonical shellings. It represents certain invariant of a triangulation computed by analyzing…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings…

We give Chebyshev-type quadrature formulas for certain new weight classes. These formulas are of highest possible degree when the number of nodes is a power of 2. We also describe the nodes in a constructive way, which is important for…

We show that interpolation results in the $S$-nodes theory may be considered as Khrushchev-type formulas. If separation of the well-known Verblunsky (Schur) coefficients occurs in Khrushchev formulas, the separation of the so the called new…

In the present paper we suggest a simple approach for counting Jacobian group of the $Y$-graph $Y(n; k, l, m).$ In the case $Y(n; 1, 1, 1)$ the structure of the Jacobian group will be find explicitly. Also, we obtain a closed formula for…

We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

We describe higher-order chain rules for multivariate functions and tensor fields. We estimate Sobolev-Slobodeckij norms, Musielak-Orlicz norms, and the total variation seminorms of the higher derivatives of tensor fields after a change of…

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…