Related papers: Cardinality of Balls in Permutation Spaces

We study the maximum cardinality problem of a set of few distances in the Hamming and Johnson spaces. We formulate semidefinite programs for this problem and extend the 2011 works by Barg-Musin and Musin-Nozaki. As our main result, we find…

A formalism is presented for analytically obtaining the probability density function, (P_{n}(s)), for the random distance (s) between two random points in an (n)-dimensional spherical object of radius (R). Our formalism allows (P_{n}(s)) to…

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…

The aim of this paper is to consider questions concerning the possible maximum cardinality of various separable pseudoradial (in short: SP) spaces. The most intriguing question here is if there is, in ZFC, a regular (or just Hausdorff) SP…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_\theta,\mathfrak{p}_\theta,\mathfrak{g}_\theta,\mathfrak{r}_\theta,\mathfrak{t}_\theta$ at uncountable regular…

A simple example of an $n$-dimensional admissible complex of planes is given for the overdetermined $k$-plane transform in $\mathbb{R}^n$. For the corresponding restricted $k$-plane transform sharp existence conditions are obtained and…

A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…

Let $n$, $s$ and $k$ be positive integers. For distinct $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a circle. So \[ ||i,j||_n=\min\{(i-j)\bmod…

Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

We prove a bound for the geodesic diameter of a subset of the unit ball in $\mathbb{R}^n$ described by a fixed number of quadratic equations and inequalities, which is polynomial in $n$, whereas the known bound for general degree is…

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

The Kneser-Poulsen conjecture says that if a finite collection of balls in a Euclidean (spherical or hyperbolic) space is rearranged so that the distance between each pair of centers does not increase, then the volume of the union of these…

A subset $D\subseteq V(G)$ is called a $k$-distance dominating set of $G$ if every vertex in $V(G)\setminus D$ is within distance $k$ from some vertex of $D$. The minimum cardinality among all $k$-distance dominating sets of $G$ is called…

When $K$ is a knot and $p \gg 0$ is a prime, we discuss a finite set whose cardinality is $\Delta_K(p^n)$, the value of the Alexander polynomial of $K$ at $p^n$.

A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every inversion $(j,i)$, where $1 \le i \textless{} j \le n$,…