相关论文: Coding rotations on intervals

Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…

Let $\mathbf{X}^{(1)}_{n},\ldots,\mathbf{X}^{(m)}_{n}$, where $\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\ldots,X^{(i)}_{n})$, $i=1,\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their…

We discuss quantum fluctuations of a class of rotating strings in AdS_5 x S^5. In particular, we develop a systematic method to compute the one-loop sigma-model effective actions in closed forms as expansions for large spins. As examples,…

We give an elementary proof of a formula expressing the rotation number of a cyclic unimodular sequence of lattice vectors in terms of arithmetically defined local quantities. The formula has been originally derived by A. Higashitani and M.…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

Looping is one of the fundamental logical instructions used for repeating a block of code. It is used in programs across all programming languages. Traditionally, in languages like C, the for loop is used extensively for repeated execution…

The Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree orders, and those among the chains that exhibit a simple greedy…

Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…

The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in…

We characterize the infinite words determined by indexed languages. An infinite language $L$ determines an infinite word $\alpha$ if every string in $L$ is a prefix of $\alpha$. If $L$ is regular or context-free, it is known that $\alpha$…

The call-by-value language RML may be viewed as a canonical restriction of Standard ML to ground-type references, augmented by a "bad variable" construct in the sense of Reynolds. We consider the fragment of (finitary) RML terms of order at…

We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices.…

In this paper, we propose a procedure that given an integer reset timed automaton (IRTA) ${\cal A}$, produces a language equivalent deterministic one clock IRTA ${\cal B}$ whose size is at most doubly exponential in the size of ${\cal A}$.…

Analytic methods to investigate periodic orbits in galactic potentials. To evaluate the quality of the approximation of periodic orbits in the logarithmic potential constructed using perturbation theory based on Hamiltonian normal forms.…

It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…

We generalize the partial derivative automaton to regular expressions with shuffle and study its size in the worst and in the average case. The number of states of the partial derivative automata is in the worst case at most 2^m, where m is…

We consider exchange of three intervals with permutation $(3,2,1)$. The aim of this paper is to count the cardinality of the set $3\iet(N)$ of all words of length $N$ which appear as factors in infinite words coding such transformations. We…

In this paper, we use affine surfaces to describe completely the real-time trajectories of a homogeneous vector field in $\mathbf{C}^{2}$. We prove the existence of a continuous "rotation number" in $\mathbf{C}^{2}$ which is constant along…

Many sequences of $p$-adic integers project modulo $p^\alpha$ to $p$-automatic sequences for every $\alpha \geq 0$. Examples include algebraic sequences of integers, which satisfy this property for every prime $p$, and some cocycle…

This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem…