相关论文: On semi-open codes and bi-continuing almost everyw…
We investigate the response of an open chain of bidirectionally coupled chaotic homoclinic systems to external periodic stimuli. When one end of the chain is driven by a periodic signal, the system propagates a phase synchronization state…
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
We show that a factor $M$ is full if and only if the $C^*$-algebra generated by its left and right regular representations contains the compact operators. We prove that the bicentralizer flow of a type $\mathrm{III}_1$ factor is always…
We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duality. In the process, we prove that A also allows a strong duality, and that the duality may be induced by a dualizing structure of finite…
Within the differential equation method for multiloop calculations, we examine the systems irreducible to $\epsilon$-form. We argue that for many cases of such systems it is possible to obtain nontrivial quadratic constraints on the…
We consider a semi-algebraic function defined on a closed semi-algebraic set X. We give formulas relating the topology of X to the indices of the critical points of the function and to the topological behavior of the function at infinity.…
We present a \emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared…
Let $\Sigma$ and $\bar\Sigma$ be finite alphabets. For topologically transitive sofic systems $ X\subset \Sigma^{\Bbb Z}$ and $\widetilde X\subset \widetilde\Sigma^{\Bbb Z}$ we give a necessary and sufficient condition for the existence of…
We study open zooming systems and potentials with uniqueness of equilibrium states. The uniqueness is established for a certain class of zooming potentials when the map is topologically exact, including the null one. Also, with equilibrium…
In this article we study orbits of proximal pairs in almost automorphic subshifts. The corresponding orbits in the maximal equicontinuous factor are precisely those orbits that intersect the boundary of the subshift's separating cover. We…
Given a non-invertible dynamical system with a transfer operator, we show there is a minimal cover with a transfer operator that preserves continuous functions. We also introduce an essential cover with even stronger continuity properties.…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
We show that a totally dissipative system has all nonsingular systems as factors, but that this is no longer true when the factor maps are required to be finitary. In particular, if a nonsingular Bernoulli shift satisfies the Doeblin…
We study a number of categorical quasi-uniform structures induced by functors. We depart from a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, then define the continuity of a $\mathcal{C}$-morphism…
We describe a type system for a synchronous pi-calculus formalising the notion of affine usage in signal-based communication. In particular, we identify a limited number of usages that preserve affinity and that can be composed. As a main…
Sharing, downloading, and reusing software is common-place, some of which is carried out legally with open source software. When it is not legal, it is unclear just how many copyright infringements and trade secret violations have taken…
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…
In this paper, we continue studying the properties of $\gamma$-semi-continuous and $\gamma$-semi-open functions introduced in [5].