Related papers: On a bi-lateral Adding Machine and its characteriz…

We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…

In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…

In this article, we develop and investigate a new classifier based on features extracted using spatial depth. Our construction is based on fitting a generalized additive model to the posterior probabilities of the different competing…

We treat the problem of lifting bicategories into double categories through categories of vertical morphisms. We make use of a specific instance of the Grothendieck construction to provide, for every bicategory equipped with a possible…

Let $M$ be a compact manifold of dimension at least 2. If $M$ admits a minimal homeomorphism then $M$ admits a minimal noninvertible map.

We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…

This paper describes a first step towards the definition of an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the…

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different letters. This in particular implies that any binary language…

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…

Let X be a real Banach space. We prove that the existence of an injective, positive, symmetric and not strictly singular operator from X into its dual implies that either X admits an equivalent Hilbertian norm or it contains a nontrivially…

In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…

We extend the well-known Dumont--Thomas numeration systems to $\mathbb{Z}$ using an approach inspired by the two's complement numeration system. Integers in $\mathbb{Z}$ are canonically represented by a finite word (starting with…

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

The paper is devoted to 2-local derivations and 2-local automorphisms on the algebra $B(H)$ of all bounded linear operators on a Hilbert space $H.$ We prove that every 2-local derivation on $B(H)$ is a derivation. A similar result is…

Document image has been the area of research for a couple of decades because of its potential application in the area of text recognition, line recognition or any other shape recognition from the image. For most of these purposes…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…