English
Related papers

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

200 papers

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postulates that high values of dimension be indicative of the presence…

Machine Learning · Computer Science 2016-11-17 Vladimir Pestov

Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…

Metric Geometry · Mathematics 2018-05-22 Ilya Dumer

Kusner asked if $n+1$ points is the maximum number of points in $\mathbb{R}^n$ such that the $\ell_p$ distance $(1<p<\infty)$ between any two points is $1$. We present an improvement to the best known upper bound when $p$ is large in terms…

Metric Geometry · Mathematics 2021-11-23 Richard Chen , Feng Gui , Jason Tang , Nathan Xiong

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

Invariant integrals of functions and forms over $q$ - deformed Euclidean space and spheres in $N$ dimensions are defined and shown to be positive definite, compatible with the star - structure and to satisfy a cyclic property involving the…

q-alg · Mathematics 2009-10-28 Harold Steinacker

The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…

Classical Analysis and ODEs · Mathematics 2009-02-04 Natalia Zorii

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

Number Theory · Mathematics 2024-11-12 Kevin O'Bryant

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

It has been known that the Cartesian product of two Suslin non-sigma-porous sets in topologically complete metric spaces is non-sigma-porous in the product space. The main aim of the present paper is to answer the natural question whether a…

Functional Analysis · Mathematics 2013-09-12 Martin Rmoutil

A set of vectors all of which have a constant (non-zero) norm value in an Euclidean lattice is called a shell of the lattice. Venkov classified strongly perfect lattices of minimum 3 (R\'{e}seaux et "designs" sph\'{e}rique, 2001), whose…

Combinatorics · Mathematics 2010-06-30 Junichi Shigezumi

We prove that if two finitely generated groups act on a metrically complete 2-dimensional Euclidean building, then the distance between their fixed-point sets is realised. Our proof uses the geometry of Euclidean buildings, which we view as…

Group Theory · Mathematics 2022-10-25 Harris Leung , Jeroen Schillewaert , Anne Thomas

In this article, we discuss the equality of two inner products on a vector space. Particularly, we look at some geometric properties that are given to a vector space by an inner product namely, length and angle, and we ask under what…

Metric Geometry · Mathematics 2023-10-24 Aniruddha Deshmukh , Ashisha Kumar

It is known that the spatial product of two product systems is intrinsic. Here we extend this result by analyzing subsystems of the tensor product of product systems. A relation with cluster systems is established. In a special case, we…

Functional Analysis · Mathematics 2015-02-12 Mithun Mukherjee

Let G = Z2 act on a finitistic space X having mod 2 cohomology of the product of three spheres S^n x S^m x S^l. In this paper, we have determined the fixed point sets of involutions on X. This generalizes J. C. Su [12] results for…

Algebraic Topology · Mathematics 2023-08-11 Dimpi , Hemant Kumar Singh

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

Geometric Topology · Mathematics 2017-04-24 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…

Metric Geometry · Mathematics 2025-06-02 S. Borodachov , P. Boyvalenkov , P. Dragnev. D. Hardin. E. Saff , M. Stoyanova

We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…

Functional Analysis · Mathematics 2015-06-17 Volker W. Thürey

We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of…

Logic in Computer Science · Computer Science 2011-04-04 Roman Kontchakov , Yavor Nenov , Ian Pratt-Hartmann , Michael Zakharyaschev
‹ Prev 1 3 4 5 6 7 10 Next ›