Related papers: Multiple contractions of permutation arrays

We study Hamiltonian walks (HWs) on the family of three--dimensional modified Sierpinski gasket fractals, as a model for compact polymers in nonhomogeneous media in three dimensions. Each member of this fractal family is labeled with an…

In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These…

For all $s\in[0,1]$ and $t\in(0,s]\cup [2-s,2)$, we find the supremum of numbers $\omega\in(0,2)$ such that $\text{I}_\omega(\mu\ast\sigma) \lesssim 1$, where $\mu$ is any Borel measure on $B(1)$ with $\text{I}_t(\mu)\leq 1$ and $\sigma$ is…

The central problem in sequence reconstruction is to find the minimum number of distinct channel outputs required to uniquely reconstruct the transmitted sequence. According to Levenshtein's work in 2001, this number is determined by the…

In this paper, for an $\lambda$-strict pseudocontraction $T$, we prove strong convergence of the modified Mann's iteration defined by $$x_{n+1}=\beta_{n}u+\gamma_nx_n+(1-\beta_{n}-\gamma_n)[\alpha_{n}Tx_n+(1-\alpha_{n})x_n],$$ where…

The $r$-th generalized Hamming metric and the $b$-symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of the reading…

Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…

The Hamiltonian limit of the corner transfer matrix (CTM) of a generalised free Fermion vertex system of finite size leads to a quantum spin Hamiltonian of the particular form: \[ {\cal H}_N=-\sum_{n=1}^{N-1}\left\{ n\left(…

Gauge symmetries lead to first-class constraints. This assertion is of course true only for non trivial gauge symmetries, i.e., gauge symmetries that act non trivially on-shell on the dynamical variables. We illustrate this well-appreciated…

The subdivision graph $S(\Sigma)$ of a graph $\Sigma$ is obtained from $\Sigma$ by `adding a vertex' in the middle of every edge of $\Si$. Various symmetry properties of $\S(\Sigma)$ are studied. We prove that, for a connected graph…

Using a multivariable Faa di Bruno formula we give conditions on transformations $\tau:[0,1]^m\to\mathcal{X}$ where $\mathcal{X}$ is a closed and bounded subset of $\mathbb{R}^d$ such that $f\circ\tau$ is of bounded variation in the sense…

A $7$-tuple of commuting bounded operators $\textbf{T} = (T_1, \dots, T_7)$ on a Hilbert space $\mathcal{H}$ is called a \textit{$\Gamma_{E(3; 3; 1, 1, 1)} $-contraction} if $\Gamma_{E(3; 3; 1, 1, 1)}$ is a spectral set for $\textbf{T}. $…

A code $C$ in the Hamming graph $\varGamma=H(m,q)$ is $2\it{\text{-neighbour-transitive}}$ if ${\rm Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three parts of the distance partition of $V\varGamma$ with respect…

Coupling $N$ large $m$ minimal models and flowing to IR fixed points is a systematic way to build new classes of compact unitary 2d CFTs which are likely to be irrational, and potentially have a positive Virasoro twist gap above the…

We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. The task is to output the Hamming distance between a fixed string of length n and the last n symbols of a stream. We give a lower bound…

Let $\tau$ and $\sigma$ be two polygonal curves in $\mathbb{R}^d$ for any fixed $d$. Suppose that $\tau$ and $\sigma$ have $n$ and $m$ vertices, respectively, and $m\le n$. While conditional lower bounds prevent approximating the Fr\'echet…

Previously, the authors reported direct evidence of channel saturation and conductance quantization in atomic-sized gold constrictions through mechanical perturbation studies, and also showed that peaks in conductance histograms are…

Let $S_n$ be the set of all permutations of $\{1,2,\ldots,n\}$ and let $\sigma=(\sigma_1,\sigma_2,\ldots,\sigma_n)\in S_n$. The {\it initial longest increasing sequence} (ILIS) in $\sigma$ has length $m$ if, for $1\le m\le n-1$,…

A permutation $\sigma=[\sigma_1,\dots,\sigma_n] \in S_n$ is called a {\em cylindrical king permutation} if $ |\sigma_{i+1}-\sigma_{i}|>1$ for each $1\leq i \leq n-1$ and $|\sigma_1-\sigma_n|>1$. The name comes from the the way one can see…

Massive neutrinos suppress the growth of structure below their free-streaming scale and leave an imprint on large-scale structure. Measuring this imprint allows us to constrain the sum of neutrino masses, $M_\nu$, a key parameter in…