Related papers: More on the corner-vector construction for spheric…
We show how the variational characterisation of spherical designs can be used to take a union of spherical designs to obtain a spherical design of higher order (degree, precision, exactness) with a small number of points. The examples that…
Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…
This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…
We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…
A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…
In this paper we introduce the concept of corner element of a generalized numerical semigroup, which extends in a sense the idea of conductor of a numerical semigroup to generalized numerical semigroups in higher dimensions. We present…
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
Archimedes' hat-box theorem states that uniform measure on a sphere projects to uniform measure on an interval. This fact can be used to derive Simpson's rule. We present various constructions of, and lower bounds for, numerical cubature…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
Victoir (2004) developed a method to construct cubature formulae with various combinatorial objects. Motivated by this, we generalize Victoir's method with one more combinatorial object, called regular t-wise balanced designs. Many cubature…
This article provides an overview of the techniques related to classification of spherical and more general objects within triangulated categories, and its relationship with algebraic geometry, representation theory and symplectic geometry.…
A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…
Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…
In this work we will investigate a certain generalization of the so called S-lemma in higher degrees. The importance of this generalization is, that it is closely related to Hilbert's 1888 theorem about tenary quartics. In fact, if such a…
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…
Spherical $t$-design is a finite subset on sphere such that, for any polynomial of degree at most $t$, the average value of the integral on sphere can be replaced by the average value at the finite subset. It is well-known that an…
In this paper, we give a uniform upper bound on the rational points of bounded height provided by conics in a cubic surface. For this target, we give a generalized version of the global determinant method of Salberger by Arakelov geometry.
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…