Related papers: Dot product chains

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

Given $n$ distinct points $t_1,\ldots,t_n$ on the unit circle $\T$ and equally many target values $\f_1,\ldots,\f_n\in\T$, we describe all Blaschke products $f$ of degree at most $n-1$ such that $f(t_i)=\f_i$ for $i=1,\ldots,n$. We also…

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…

We study the unit distance and distinct distances problems over the planar hypercomplex numbers: the dual numbers $\mathbb{D}$ and the double numbers $\mathbb{S}$. We show that the distinct distances problem in $\mathbb{S}^2$ behaves…

We present some problems and results about variants of sunflowers in families of sets. In particular, we improve an upper bound of the first author, K\"orner and Monti on the maximum number of binary vectors of length $n$ so that every four…

We analyze the joint extremal behavior of $n$ random products of the form $\prod_{j=1}^m X_j^{a_{ij}}, 1 \leq i \leq n,$ for non-negative, independent regularly varying random variables $X_1, \ldots, X_m$ and general coefficients $a_{ij}…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

We establish the order of the maximum length of an increasing sequence, bounded by $n$, in which the largest prime divisor of the elements form a decreasing sequence.

Let $R$ be a finite valuation ring of order $q^r$ where $q$ is odd and $A$ be a subset of $R$. In the present paper, we prove that there exists a point $u$ in the Cartesian product set $A\times A\subset R^2$ such that the size of the pinned…

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…

We introduce the $k$-variable-occurrence fragment, which is the set of terms having at most $k$ occurrences of variables. We give a sufficient condition for the decidability of the equational theory of the $k$-variable-occurrence fragment…

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…

We present a numerical model for determining a finite Blaschke product of degree $n+1$ having $n$ preassigned distinct critical points $z_1,\dots,z_n$ in the complex (open) unit disk $\mathbb{D}$. The Blaschke product is uniquely determined…

We investigate the existence and multiplicity of solutions for higher order discrete boundary value problems via critical point theory.

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

This short note contains a simple argument that allows us to go from fixed-time to any-time bounds for the concentration of matrix products. The result presented here is motivated by the analysis of Oja's algorithms.

Let $G$ be a multiplicative finite group and $S=a_1\cdot\ldots\cdot a_k$ a sequence over $G$. We call $S$ a product-one sequence if $1=\prod_{i=1}^ka_{\tau(i)}$ holds for some permutation $\tau$ of $\{1,\ldots,k\}$. The small Davenport…

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…