Related papers: Real and complex spherical designs and their Grami…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way,…
We investigate projection constants within classes of multivariate polynomials over finite-dimensional real Hilbert spaces. Specifically, we consider the projection constant for spaces of spherical harmonics and spaces of homogeneous…
We classify all spherical 2-designs that arise as orbits of finite group actions on real inner product spaces. Although it is well known that such designs can occur in representations without trivial components, we give a complete…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
Candidate microstates of a spherically symmetric geometry are constructed in the group field theory formalism for quantum gravity, for models including both quantum geometric and scalar matter degrees of freedom. The latter are used as a…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…
Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…
We give a complete classification of Riemannian and Lorentzian surfaces of arbitrary codimension in a pseudo-sphere whose pseudo-spherical Gauss maps are of 1-type or, in particular, harmonic. In some cases a concrete global classification…
Space-filling designs are popular choices for computer experiments. A sliced design is a design that can be partitioned into several subdesigns. We propose a new type of sliced space-filling design called sliced rotated sphere packing…
A finite subset $Y$ on the unit sphere $S^{n-1} \subseteq \mathbb{R}^n$ is called a spherical design of harmonic index $t$, if the following condition is satisfied: $\sum_{\mathbf{x}\in Y}f(\mathbf{x})=0$ for all real homogeneous harmonic…
A finite set $X \seq \RR^n$ with a weight function $w : X \longrightarrow \RR_{>0}$ is called \emph{Euclidean $t$-design} in $\RR^n$ (supported by $p$ concentric spheres) if the following condition holds: \[ \sum_{i=1}^p…
This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
This paper deals with a kind of design of a ruled surface. It combines concepts from the fields of computer aided geometric design and kinematics. A dual unit spherical B\'ezier-like curve on the dual unit sphere (DUS) is obtained with…
Given a connected simply connected semisimple group G and a connected spherical subgroup K we determine the generators of the extended weight monoid of G/K, based on the homogeneous spherical datum of G/K. Let H be a reductive subgroup of G…
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
Let G be a connected reductive group. Recall that a G-variety X is called spherical if X is normal and a Borel subgroup of G has an open orbit on X. To a spherical homogeneous G-space one assigns certain combinatorial invariants: the weight…