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

The contact number of a packing of finitely many balls in Euclidean $d$-space is the number of touching pairs of balls in the packing. A prominent subfamily of sphere packings is formed by the so-called totally separable sphere packings:…

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

We find a one-to-one correspondence between full extrinsic symmetric spaces in (possibly degenerate) inner product spaces and certain algebraic objects called (weak) extrinsic symmetric triples. In particular, this yields a description of…

We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

We obtain a complete characterization of the norm attainment set of a bounded linear functional on a normed space, in terms of a semi-inner-product defined on the space. Motivated by this result, we further apply the concept of…

We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.

Let $G$ be a group, and $S$ a non-empty subset of $G$. Then $S$ is \emph{product-free} if $ab\notin S$ for all $a, b \in S$. We say $S$ is \emph{locally maximal product-free} if $S$ is product-free and not properly contained in any other…

We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

We establish upper bounds for the distance to finite-dimensional subspaces in inner product spaces and improve some generalisations of Bessel's inequality obtained by Boas, Bellman and Bombieri. Refinements of the Hadamard inequality for…

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound…

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

The aim of this paper is to continue the study of sg-compact spaces. The class of sg-compact spaces is a proper subclass of the class of hereditarily compact spaces. In our paper we shall consider sg-compactness in product spaces. Our main…