Related papers: The inverse problem for canonically bounded rank-o…
We define the notion of canonical boundedness among rank-one transformations and use it to characterize the class of all bounded rank-one transformations with trivial centralizer. We also explicitly characterize totally ergodic rank-one…
In this paper some sufficient conditions are given for when two bounded rank-one transformations are isomorphic or disjoint. For commensurate, canonically bounded rank-one transformations, isomorphism and disjointness are completely…
We prove that for infinite rank-one transformations satisfying a property called "partial boundedness," the only commuting transformations are powers of the original transformation. This shows that a large class of infinite…
In this paper we give explicit characterizations, based on the cutting and spacer parameters, of (a) which rank-one transformations factor onto a given finite cyclic permutation, (b) which rank-one transformations factor onto a given…
Finding necessary and sufficient conditions for isomorphism between two semigroups of order-preserving transformations over an infinite domain with restricted range was an open problem in \cite{FHQS}. In this paper, we show a proof strategy…
We give a number of constructions where inverse limits seriously degrade properties of regular rings, such as unit-regularity, diagonalisation of matrices, and finite stable rank. This raises the possibility of using inverse limits to…
We give two examples of categorical axioms asserting that a canonically defined natural transformation is invertible where the invertibility of any natural transformation implies that the canonical one is invertible. The first example is…
Consider two inverse problems for Sturm-Liouville problems on the unit interval. It means that there are two corresponding mappings $F, f$ from a Hilbert space of potentials $H$ into their spectral data. They are called isomorphic if $F$ is…
We prove that every endomorphism which satisfies Axiom A and the strong transversality conditions is $C^1$-inverse limit structurally stable. These conditions were conjectured to be necessary and sufficient. This result is applied to the…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. This highly combinatorial problem in the field of…
We study topological mixing properties and the maximal equicontinuous factor of rank-one subshifts as topological dynamical systems. We show that the maximal equicontinuous factor of a rank-one subshift is finite. We also determine all the…
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…
We define the Polish space $\mathcal{R}$ of non-degenerate rank-1 systems. Each non-degenerate rank-1 system can be viewed as a measure-preserving transformation of an atomless, $\sigma$-finite measure space and as a homeomorphism of a…
While conformal transformations of the plane preserve Laplace's equation, Lorentz-conformal mappings preserve the wave equation. We discover how simple geometric objects, such as quadrilaterals and pairs of crossing curves, are transformed…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
Hamiltonians are 2-by-2 positive semidefinite real symmetric matrix-valued functions satisfying certain conditions. In this paper, we solve the inverse problem for which recovers a Hamiltonian from the solution of a first-order system…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
In a reconfiguration problem, we are given two feasible solutions of a combinatorial problem and our goal is to determine whether it is possible to reconfigure one into the other, with the steps dictated by specific reconfiguration rules.…
This paper is devoted to the study of unparameterized simple curves in the plane. We propose diverse canonical parameterizations of a 2D-curve. For instance, the arc-length parameterization is canonical, but we consider other natural…