Related papers: Counting Nodes in Smolyak Grids
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
The problem of estimating the multiplicity of the zero of a polynomial when restricted to the trajectory of a non-singular polynomial vector field, at one or several points, has been considered by authors in several different fields. The…
We consider the theoretical and numerical aspects of the quadrature rules associated with a sequence of polynomials generated by a special $R_{II}$ recurrence relation. We also look into some methods for generating the nodes (which lie on…
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…
A word $w_1w_2\cdots w_n$ is said to be up-down if $w_1 < w_2 >w_3 \cdots$. Carlitz and Scoville found the generating function for the number of up-down words over an alphabet of size $k$. Using properties of the Chebyshev polynomials we…
Smoluchowski's coagulation equations can be used as elementary mathematical models for the formation of polymers. We review here some recent contributions on a variation of this model in which the number of aggregations for each atom is a…
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith respect to the degree of the extension. Recently, Randriambololona has generalized…
This work concerns with the following problem. Given a two-dimensional domain whose boundary is a closed polygonal line with internal boundaries defined also by polygonal lines, it is required to generate a grid consisting only of…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
The higher-order superintegrability of systems separable in polar coordinates is studied using an approch that was previously applied for the study of the superintegrability of a generalized Smorodinsky-Winternitz system. The idea is that…
Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by…
The Goulden-Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which…
Perturbation theory is a powerful tool for studying large-scale structure formation in the universe and calculating observables such as the power spectrum or bispectrum. However, beyond linear order, typically this is done by assuming a…
A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropy of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these…
We give an explicit combinatorial description of cluster structures in Schubert varieties of the Grassmannian in terms of (target labelings of) Postnikov's plabic graphs. This description is a natural generalization of the description given…
The paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete, and the binary aggregation alone governs the time evolution of the systems. By considering the growth…
A $p$-adic version of Gromov-Witten invariants for counting plane curves of genus $g$ and degree $d$ through a given number of points is discussed. The multiloop version of $p$-adic string theory considered by Chekhov and others motivates…
We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…
Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…
This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphisms from a complete bipartite graph into a general bipartite…