相关论文: On semi-open codes and bi-continuing almost everyw…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
We prove that in a semi-bounded o-minimal expansion of an ordered group every non-empty open definable set is a finite union of open cells.
We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…
In this paper, we first give a necessary and sufficient condition for a factor code with an unambiguous symbol to admit a subshift of finite type restricted to which it is one-to-one and onto. We then give a necessary and sufficient…
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
The deformed supersymmetric sine-Gordon model, obtained through known deformation of the corresponding potential, is found to be quasi-integrable, like its non-supersymmetric counterpart, which was observed earlier. The system expectedly…
In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
If $\pi:(X,T)\to(Z,S)$ is a topological factor map between uniquely ergodic topological dynamical systems, then $(X,T)$ is called an isomorphic extension of $(Z,S)$ if $\pi$ is also a measure-theoretic isomorphism. We consider the case when…
A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. It was previously shown that, for a fixed given $k$, one…
Fully observable non-deterministic (FOND) planning is becoming increasingly important as an approach for computing proper policies in probabilistic planning, extended temporal plans in LTL planning, and general plans in generalized…
In this paper we establish a connection between categorical closedness and topologizability of semigroups. In particular, for a class $\mathsf T_{\!1}\mathsf S$ of $T_1$ topological semigroups we prove that a countable semigroup $X$ with…
It was recently shown that the nonseparable density operators for a bipartite system are trace norm dense if either factor space has infinite dimension. We show here that non-local states -- i.e., states whose correlations cannot be…
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem…
In this paper, by reviewing the concept of subcovering and semicovering maps, we extend the notion of subcovering map to subsemicovering map. We present some necessary or sufficient conditions for a local homeomorphism to be a…
This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of…
We prove that the composition of a quasi-nearly subharmonic function and a quasiregular mappings of bounded multiplicity is quasi-nearly subharmonic. Also, we prove that if $u\circ f$ is quasi-nearly subharmonic for all quasi-nearly…
We present a new sufficient criterion to prove that a non-sofic half-synchronized subshift is direct prime. The criterion is based on conjugacy invariant properties of Fischer graphs of half-synchronized shifts. We use this criterion to…
It is shown that the synchronization behavior of a system of chaotic maps subject to either an external forcing or a coupling function of their internal variables can be inferred from the behavior of a single element in the system, which…
The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…