Related papers: Preset Distinguishing Sequences and Diameter of Tr…

The metric dimension reduction modulus $k^\alpha_n(\ell_\infty)$ is the smallest $k$ such that every $n$--point metric space can be embedded into some $k$-dimensional normed space, with bi--Lipschitz distortion at most $\alpha$. Determining…

Quasi-uniformity is a fundamental geometric property of point sets, crucial for applications such as kernel interpolation, Gaussian process regression, and space-filling experimental designs. While quasi-Monte Carlo methods are widely…

For $1<p\le q<\infty$ and $n\in\{3\cdot 2^{k},2^{k}\}$ with $k\ge 1$, we prove that the Poisson-like semigroup $(P_t)_{t\in \mathbb{R}_+}$ on $\mathbb{Z}_n$, associated with the word length $\psi_n(k)=\min(k,n-k)$, is hypercontractive from…

Let $[n]=\{1,\ldots,n\}$ be the $n$-chain. We give presentations for the following transformation semigroups: the semigroup of full order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-decreasing mappings of $[n]$,…

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

The problem of determining whether or not a non-elementary subgroup of $PSL(2,\CC)$ is discrete is a long standing one. The importance of two generator subgroups comes from J{\o}rgensen's inequality which has as a corollary the fact that a…

Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the…

Given a simple digraph $D$ on $n$ vertices (with $n\ge2$), there is a natural construction of a semigroup $\langle D\rangle$ associated with $D$. For any edge $(a,b)$ of $D$, let $a\to b$ be the idempotent of defect $1$ mapping $a$ to $b$…

We study the reconstruction problem of permutation sequences from their $k$-minors, which are subsequences of length $k$ with entries renumbered by $1,2,\ldots,k$ preserving order. We prove that the minimum number $k$ such that any…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models. This applies in particular to the important case of…

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

In the Shortest Superstring problem we are given a set of strings $S=\{s_1, \ldots, s_n\}$ and integer $\ell$ and the question is to decide whether there is a superstring $s$ of length at most $\ell$ containing all strings of $S$ as…

Denniston \cite{D1969} constructed partial difference sets (PDS) with parameters $(2^{3m}, (2^{m+r}-2^m+2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m\geq…

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Let $S$ be a semi direct product $S=N\rtimes A$ where $N$ is a connected and simply connected, non-abelian, nilpotent meta-abelian Lie group and $A$ is isomorphic with $\R^k,$ $k>1.$ We consider a class of second order left-invariant…

An $(n,k,\ell)$-vector MDS code is a $\mathbb{F}$-linear subspace of $(\mathbb{F}^\ell)^n$ (for some field $\mathbb{F}$) of dimension $k\ell$, such that any $k$ (vector) symbols of the codeword suffice to determine the remaining $r=n-k$…

A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero…

Let $(k_n)_{n \in \mathbb{N}}$ be a sequence of positive integers growing to infinity at a sublinear rate, $k_n \rightarrow \infty$ and $k_n/n \rightarrow 0$ as $n \rightarrow \infty$. Given a sequence of $n$-dimensional random vectors…

We study the problem of reconfiguring one minimum $s$-$t$-separator $A$ into another minimum $s$-$t$-separator $B$ in some $n$-vertex graph $G$ containing two non-adjacent vertices $s$ and $t$. We consider several variants of the problem as…