Related papers: Counting Nodes in Smolyak Grids
A new method for the determination of open cluster membership based on a cumulative effect is proposed. In the field of a plate the relative x and y coordinate positions of each star with respect to all the other stars are added. The…
By closely following a construction by Ganelius, we construct Faber rational functions that allow us to derive tight and explicit bounds on Zolotarev numbers. We use our results to bound the singular values of matrices, including…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
We present a new method for the reconstruction of Sunyaev-Zel'dovich (SZ) galaxy clusters in future SZ-survey experiments using multiband bolometer cameras such as Olimpo, APEX, or Planck. Our goal is to optimise SZ-Cluster extraction from…
A scaled Chebyshev node distribution is studied in this paper. It is proved that the node distribution is optimal for interpolation in $C_M^{s+1}[-1,1]$, the set of $(s+1)$-time differentiable functions whose $(s+1)$-th derivatives are…
We determine the cardinality of the value sets of bivariate Chebyshev maps over finite fields. We achieve this using the dynamical properties of these maps and the algebraic expressions of their fixed points in terms of roots of unity.
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
The main purpose of this paper is to construct new families of special numbers with their generating functions. These numbers are related to the many well-known numbers, which are the Bernoulli numbers, the Fibonacci numbers, the Lucas…
In a series of two articles, we propose a comprehensive mathematical framework for Coupled-Cluster-type methods. These methods aim at accurately solving the many-body Schrodinger equation. In this first part, we rigorously describe the…
As demonstrated by Planck, SPT, and ACT, the abundance of Sunyaev-Zeldovich-detected galaxy clusters across mass and redshift is a powerful cosmological probe. Upcoming experiments such as the Simons Observatory (SO) will detect over an…
In previous works, the second author defined directional Robin constants associated to a compact, nonpolar subset $K$ of an algebraic curve $A$ in $\mathbb{C}^N$ and related these to a natural class of Chebyshev constants for $K$. We define…
An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.
Spherical needlets were introduced by Narcowich, Petrushev, and Ward to provide a multiresolution sequence of polynomial approximations to functions on the sphere. The needlet construction makes use of integration rules that are exact for…
We discuss the procedure of different partitions in the finite set of $N$ integer numbers and construct generic formulas for a bijective map of real numbers $s_y$, where $y=1,2,\ldots,N$, $N=\prod \limits_{k=1}^{n} X_k$, and $X_k$ are…
The feedback class of a locally Brunovsky linear system is fully determined by the decomposition of state space as direct sum of system invariants [4]. In this paper we attack the problem of enumerating all feedback classes of locally…
In this short note, we give simple proofs of several results and conjectures formulated by Stolarsky and Tran concerning generating functions of some families of Chebyshev-like polynomials.
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…