Related papers: Counting Nodes in Smolyak Grids
One of the possible variants of the classification of trigonometric interpolation splines is considered, depending on the chosen convergence factors, the distribution of signs of the basis functions and the interpolation factors. The…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the…
A brief summary of the development of perturbative Chern-Simons gauge theory related to the theory of knots and links is presented. Emphasis is made on the progress achieved towards the determination of a general combinatorial expression…
A coarse grid correction (CGC) approach is proposed to enhance the efficiency of the matrix exponential and $\varphi$ matrix function evaluations. The approach is intended for iterative methods computing the matrix-vector products with…
We propose a new numerical algorithm to construct a structured numerical elliptic grid of a doubly connected domain. Our method is applicable to domains with boundaries defined by two contour lines of a two-dimensional function. The…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…
The Marchenko method is developed in the inverse scattering problem for a linear system of first-order differential equations containing potentials proportional to the spectral parameter. The corresponding Marchenko system of integral…
Fixing a subgroup $\Gamma$ in a group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] = n$. For pairs…
The theory of Gauss diagrams and Gauss diagram formulas provides convenient ways to compute knot invariants, such as coefficients of the HOMFLYPT polynomial. In \cite{4,5}, the author uses Gauss diagram formulas to find combinatorial…
We investigate two examples of node-based cluster summation rules that have been proposed for the quasicontinuum method: a force-based approach (Knap & Ortiz, J. Mech. Phys. Solids 49, 2001), and an energy-based approach which is a…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
We discuss methods for calculating Chern numbers of two-dimensional lattice systems using spiral boundary conditions, which sweep all lattice sites in one-dimensional order. Specifically, we establish the one-dimensional representation of…
Let $G$ be a simple, connected graph on $n$ vertices, and further assume that $G$ has disjoint cycles. Let $h$ be a real symmetric matrix supported on $G$ (for example, a discrete Schr\"odinger operator). The eigenvalues of $h$ are ordered…
Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…
A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…
Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…
In this note, we first review the novel approach to power sums put forward recently by Muschielok in arXiv:2207.01935v1, which can be summarized by the formula $S_m^{(a)}(n) = \sum_{k} c_{mk} \psi_k^{(a)}(n)$, where the $c_{mk}$'s are the…
I give a conjectural generating function for the numbers of $\delta$-nodal curves in a linear system of dimension $\delta$ on an algebraic surface. It reproduces the results of Vainsencher for the case $\delta\le 6$ and Kleiman-Piene for…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…