Related papers: Cardinality of Balls in Permutation Spaces

We prove that the Genocchi numbers of first and second kind give the cardinality of certain segments in permutation spaces, with respect to the $\ell_1$-distance. Experimental data suggests that those segments have maximal cardinality among…

In this paper we continue to study of properties of $S(n)$-spaces. We establish bounded on the cardinality of $S(n)$-spaces.

We prove a quantitative version of the bound on the smallest singular value of a Bernoulli covariance matrix (due to Bai and Yin). Then we use this bound, together with several recent developments, to show that the distance from a random…

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…

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…

Given any $\varepsilon>0$, we construct an orthonormal system of $n_k$ uniformly bounded polynomials of degree at most $k$ on the unit sphere in $\mathbb R^{m+1}$ where $n_k$ is bigger than $1-\varepsilon$ times the dimension of the space…

R. B. Kusner [R. Guy, Amer. Math. Monthly 90 (1983), 196--199] asked whether a set of vectors in a d-dimensional real vector space such that the l-p distance between any pair is 1, has cardinality at most d+1. We show that this is true for…

A subset of a metric space is a k-distance set if there are exactly k non-zero distances occuring between points. We conjecture that a k-distance set in a d-dimensional Banach space (or Minkowski space), contains at most (k+1)^d points,…

For fixed $k$ we prove exponential lower bounds on the equilateral number of subspaces of $\ell_{\infty}^n$ of codimension $k$. In particular, we show that if the unit ball of a normed space of dimension $n$ is a centrally symmetric…

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

Let $G_n$ be the group of permutations on $\mathbb{Z}_n$ that is induced by a Dickson polynomial, where $n$ is a positive integer. In this work, by solving special types of systems of linear congruences, we obtain $G_n$. In addition, we…

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…

The problem of computing the cardinality of the intersection of multiple balls in the Hamming space has attracted a lot of attention recently due to their applications in the list reconstruction problem and information retrieval in…

We study the set of numbers the total number of independent sets can admit in $n$-vertex graphs. In this paper, we prove that the cardinality $\mathcal{N}i(n)$ of this set is very close to $2^n$ in the following sense: $\mathcal{N}i(n)/2^n…

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…

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…

We investigate the set S(R) of shift-isomorphism classes of semidualizing R-complexes, ordered via the reflexivity relation, where R is a commutative noetherian local ring. Specifically, we study the question of whether S(R$ has cardinality…

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

Let $P_n$ denote the undirected path of length $n-1$. The cardinality of the set of congruence classes induced by the graph homomorphisms from $P_n$ onto $P_k$ is determined. This settles an open problem of Michels and Knauer (Disc. Math.,…

We consider an infinite graph G whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of [n] any pair of which differ…