Related papers: On a bi-lateral Adding Machine and its characteriz…
This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the…
A random construction of bipolar sensing matrices based on binary linear codes is introduced and its RIP (Restricted Isometry Property) is analyzed based on an argument on the ensemble average of the weight distribution of binary linear…
We study an expressive model of timed pushdown automata extended with modular and fractional clock constraints. We show that the binary reachability relation is effectively expressible in hybrid linear arithmetic with a rational and an…
In this paper we investigate operator Hilbert systems and their separable morphisms. We prove that the operator Hilbert space of Pisier is an operator system, which possesses the self-duality property. It is established a link between…
Let M be a closed simply connected 2n-dimensional manifold. The present paper is concerned with the cohomology of classifying spaces of connected groups of homeomorphisms of M.
We offer a classification of a broad and practically relevant class of symmetric double saddle-point system. At the core of the paper is the division of the associated matrices into ``block-arrow'' and ``block-tridiagonal'' forms. We…
We give two sufficient and necessary conditions for a Hochschild extension of a finite dimensional algebra by its dual bimodule and a Hochschild 2-cocycle to be a symmetric algebra.
We consider numeration systems where digits are integers and the base is an algebraic number $\beta$ such that $|\beta|>1$ and $\beta$ satisfies a polynomial where one coefficient is dominant in a certain sense. For this class of bases…
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…
We provide a complete characterization of those self-homeomorphisms of the unit circle that admit homeomorphic extensions to the unit disk belonging to bi--Orlicz--Sobolev spaces. Our results generalize classical criteria from the Sobolev…
We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
We provide sufficient conditions for a mapping between two Banach spaces to be a diffeomorphism using the approach of an auxiliary functional and also by the aid of a duality mapping corresponding to a normalization function. We simplify…
In this paper, we develop the theory of bimodules over von Neumann algebras, with an emphasis on categorical aspects. We clarify the relationship between dualizability and finite index. We also show that, for von Neumann algebras with…
The paper is devoted to a categorical study of the category of probabilistic metric spaces. The study is based on an isomorphic description of the category of probabilistic metric spaces. The isomorphic description was obtained in [3] and…
We study the classification of ultrametric spaces based on their small scale geometry (uniform homeomorphism), large scale geometry (coarse equivalence) and both (all scale uniform equivalences). We prove that these equivalences can be…
In this paper, we present a new approach to the semantic enrichment of mathematical expression problem. Our approach is a combination of statistical machine translation and disambiguation which makes use of surrounding text of the…
The results from the article [Strachan I.A.B., Szablikowski B.M., Stud. Appl. Math. 133 (2014), 84-117] are extended over consideration of central extensions allowing the introducing of additional independent variables. Algebraic conditions…
Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of rewrite rules. This paper presents a practical, yet…