Related papers: On shortening universal words for multi-dimensiona…

We analyse the spectrum of the D-dimensional Poincare invariant effective string model of Polchinski and Strominger. It is shown that the leading terms beyond the Casimir term in the long distance expansion of the spectrum have a universal…

A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…

An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class…

The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…

Let $R$ be an affine algebra of dimension $d\geq 4$ over a perfect field $k$ of char $\neq 2$ and $I$ be an ideal of $R$. Then - Um$_{d+1}(R,I)/{\rm E}_{d+1}(R,I)$ has nice group structure if $c.d._2(k)\leq 2$. - Um$_d(R,I)/{\rm E}_d(R,I)$…

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

We present an extension of the renormalisation procedure based on the R-operation in $D$ dimensions at two-loop level, in which the numerators of all Feynman diagrams can be constructed in four dimensions, and the rational terms stemming…

A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform…

A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…

Frobenius observed that the number of times an element of a finite group is obtained as a commutator is given by a specific combination of the irreducible characters of the group. More generally, for any word w the number of times an…

Let $w=w(x_1,\ldots,x_r)$ be a lower central word or a derived word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables, thus proving a generalized version…

Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

In this article, we prove that if $R$ is an affine algebra of dimension $d\geq 4$ over $\overline{\mathbb{F}}_{p}$ and $1/(d-1)! \in R,$ then any unimodular row over $R$ of length $d$ can be mapped to a factorial row by elementary…

Vogel's universality implies a unified description of the adjoint sector of representation theory for simple Lie algebras in terms of three parameters $\alpha,\beta,\gamma$, which are homogeneous coordinates of Vogel's plane. Actually this…

Overlap-free words are words over the binary alphabet $A=\{a, b\}$ that do not contain factors of the form $xvxvx$, where $x \in A$ and $v \in A^*$. We analyze the asymptotic growth of the number $u_n$ of overlap-free words of length $n$ as…

We represent in the universal form restricted one-instanton partition function of supersymmetric Yang-Mills theory. It is based on the derivation of universal expressions for quantum dimensions (universal characters) of Cartan powers of…

This is a brief discussion of the following features of the Universal Extra Dimension (UED) model: (i) Formulation, (ii) Indirect bounds, (iii) Collider search and the Inverse Problem, (iv) Astrophysical bounds, and (v) UED with two extra…

We propose a polynomial time construction of an $(n,d)$-universal set over alphabet $\Sigma=\{0,1\}$, of size $d\cdot 2^{d+o(d)}\cdot\log n$. This is an improvement over the size, $d^{5}2^{2.66d}\log n$, of an $(n,d)$-universal set…