相关论文: Coding rotations on intervals
We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…
In this note we study two index questions. In the first we establish the relationship between the Morse indices of the free time action functional and the fixed time action functional. The second is related to Rabinowitz Floer homology. Our…
A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of…
Repetition-based retransmission is used in Alamouti-modulation [1998] for $2\times 2$ MIMO systems. We propose to use instead of ordinary repetition so-called "scaled repetition" together with rotation. It is shown that the rotated and…
Complex multibody legged robots can have complex rotational control challenges. In this paper, we propose a concise way to understand and formulate a \emph{whole-body orientation} that (i) depends on system configuration only and not a…
Sequence rotation consists of a circular shift of the sequence's elements by a given number of positions. We present the four classic algorithms to rotate a sequence; the loop invariants underlying their correctness; detailed correctness…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
Stationary rotating strings can be viewed as geodesic motions in appropriate metrics on a two-dimensional space. We obtain all solutions describing stationary rotating strings in flat spacetime as an application. These rotating strings have…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
In this article, we study subword complexity of colorings of regular trees. We characterize colorings of bounded subword complexity and study Sturmian colorings, which are colorings of minimal unbounded subword complexity. We classify…
Factor complexity $b_\phi(n)$ for a vertex coloring $\phi$ of a regular tree is the number of colored $n$-balls up to color-preserving automorphisms. Sturmian colorings are colorings of minimal unbounded factor complexity $b_\phi(n) = n+2$.…
We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…
Consider infinite random words over a finite alphabet where the letters occur as an i.i.d. sequence according to some arbitrary distribution on the alphabet. The expectation and the variance of the waiting time for the first completed…
It is well known that a rigid motion of the Euclidean plane can be written as the composition of at most three reflections. It is perhaps not so widely known that a similar result holds for Euclidean space in any number of dimensions. The…
In this paper we continue our investigation of signatures of hermitian forms over Azumaya algebras with involution over commutative rings. We show that the approach used in an earlier paper for central simple algebras can be extended to…
In this paper, quantum mechanics on a circle with finite number of {\alpha}-uniformly distributed points is discussed. The angle operator and translation operator are defined. Using discrete angle representation, two types of discrete…
We develop a new approach to the representation theory of quantum algebras supporting a torus action via methods from the theory of finite-state automata and algebraic combinatorics. We show that for a fixed number $m$, the torus-invariant…
The "pyjama stripe" is the subset of $\mathbb{R}^2$ consisting of a vertical strip of width $2 \varepsilon$ around every integer $x$-coordinate. The "pyjama problem" asks whether finitely many rotations of the pyjama stripe around the…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…