Related papers: Counting Nodes in Smolyak Grids
We present an overview of recent developments in the numerical solution of Horndeski gravity theories, which are the class of all scalar-tensor theories of gravity that have second order equations of motion. We review several methods that…
This paper presents new quadrature rules for functions in a reproducing kernel Hilbert space using nodes drawn by a sampling algorithm known as randomly pivoted Cholesky. The resulting computational procedure compares favorably to previous…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
This article presents the construction of finitely generated branch groups with uncountably many maximal subgroups using embedding techniques. This addresses a question posed by Grigorchuk.
Using factorisation and Arov-Krein inequality results, we derive important inequalities (in terms of $S$-nodes) in interpolation problems.
We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…
We study algebraic algorithms for expressing the number of non-negative integer solutions to a unimodular system of linear equations as a function of the right hand side. Our methods include Todd classes of toric varieties via Gr\"obner…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
Smolyak's method, also known as hyperbolic cross approximation or sparse grid method, is a powerful tool to tackle multivariate tensor product problems solely with the help of efficient algorithms for the corresponding univariate problem.…
We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.
We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…
In this article, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets related to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
According to the idea of Ozsv\'ath, Stipsicz and Szab\'o, we define the knot invariant $\Upsilon$ without the holomorphic theory, using constructions from grid homology. We develop a homology theory using grid diagrams, and show that…
We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
Elliptic polylogarithms can be defined as iterated integrals on a genus-one Riemann surface of a set of integration kernels whose generating series was already considered by Kronecker in the 19th century. In this article, we employ the…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
Three new knot invariants are defined using cocycles of the generalized quandle homology theory that was proposed by Andruskiewitsch and Gra\~na. We specialize that theory to the case when there is a group action on the coefficients. First,…
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…