English
Related papers

Related papers: Inside s-inner product sets and Euclidean designs

200 papers

Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$…

Combinatorics · Mathematics 2018-06-13 Hiroshi Nozaki , Sho Suda

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…

Combinatorics · Mathematics 2012-06-29 Tsuyoshi Miezaki , Makoto Tagami

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…

Metric Geometry · Mathematics 2011-02-01 Hiroshi Nozaki

The midpoint set M(S) of a set S of points is the set of all midpoints of pairs of points in S. We study the largest cardinality of a midpoint set M(S) in a finite-dimensional normed space, such that M(S) is contained in the unit sphere,…

Metric Geometry · Mathematics 2011-08-26 Konrad J. Swanepoel

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Combinatorics · Mathematics 2025-09-03 Wei-Chun Chen , Wei-Hsuan Yu

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

Metric Geometry · Mathematics 2009-04-02 Oleg R. Musin

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

Combinatorics · Mathematics 2009-08-31 Aidan Roy , A. J. Scott

We give a new characterisation of inner product spaces amongst normed vector spaces in terms of the maximal cirumradius of spheres. It turns out that a normed vector space $(X,\norm{\cdot})$ with $\dim X\geq 2$ is an inner product space if…

Functional Analysis · Mathematics 2012-02-03 Sebastian Scholtes

A finite set $X$ in a complex sphere is called a complex spherical $2$-code if the number of inner products between two distinct vectors in $X$ is equal to $2$. In this paper, we characterize the tight complex spherical $2$-codes by doubly…

Combinatorics · Mathematics 2015-07-23 Hiroshi Nozaki , Sho Suda

A finite set $X$ in the Euclidean unit sphere is called an $s$-distance set if the set of distances between any distinct two elements of $X$ has size $s$. We say that $t$ is the strength of $X$ if $X$ is a spherical $t$-design but not a…

Combinatorics · Mathematics 2019-08-17 Hiroshi Nozaki , Sho Suda

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

Metric Geometry · Mathematics 2016-12-01 Alexey Glazyrin , Wei-Hsuan Yu

Magnitude is an isometric invariant of metric spaces inspired by category theory. Recent work has shown that the asymptotic behavior under rescaling of the magnitude of subsets of Euclidean space is closely related to intrinsic volumes.…

Metric Geometry · Mathematics 2020-04-02 Mark W. Meckes

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…

Combinatorics · Mathematics 2023-12-20 Hiroshi Nozaki , Masashi Shinohara , Sho Suda

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…

Combinatorics · Mathematics 2010-12-10 Djoko Suprijanto

A finite set X in a metric space M is called an s-distance set if the set of distances between any two distinct points of X has size s. The main problem for s-distance sets is to determine the maximum cardinality of s-distance sets for…

Combinatorics · Mathematics 2011-08-24 Oleg R. Musin , Hiroshi Nozaki

We prove that the inner products of spherical $s$-distance $t$-designs with $t \geq 2s-2$ (Delsarte codes) and $s \geq 3$ are rational with the only exception being the icosahedron. In other formulations, we prove that all sharp…

Combinatorics · Mathematics 2022-04-04 Peter Boyvalenkov , Hiroshi Nozaki , Navid Safaei

Let $X$ be a real normed space with unit sphere S. We prove that $X$ is an inner product space if and only if there exists a real number $\rho=\sqrt{(1+\cos\frac{2k\pi}{2m+1})/2}$, $(k=1,2,\ldots , m ;\:m=1,2,\ldots)$, such that every chord…

Functional Analysis · Mathematics 2017-07-31 Carlos Benítez , Pedro Martín , Diego Yáñez

A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…

Metric Geometry · Mathematics 2018-04-18 Ferenc Szöllősi , Patric R. J. Östergård

A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…

Functional Analysis · Mathematics 2015-02-26 Alexander Barg , Alexei Glazyrin , Kasso Okoudjou , Wei-Hsuan Yu
‹ Prev 1 2 3 10 Next ›