Related papers: On mappings of terms determined by hypersubstituti…
Semantics of a sentence is defined with much less ambiguity than semantics of a single word, and we assume that it should be better preserved by translation to another language. If multilingual sentence embeddings intend to represent…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…
We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…
Let $X$ be an arbitrary set. Then a topology $t$ on $X$ is said to be completely useful if every upper semicontinuous linear (total) preorder $\precsim$ on $X$ can be represented by an upper semicontinuous real-valued order preserving…
In this study, multivalued generalizations of certain classes of single-valued transformations defined on metric spaces are obtained. Building upon recently introduced concepts such as mappings contracting perimeters of triangles, new…
A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as…
Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…
We prove that a meromorphic map defined on the complement of a compact subset of a three-dimensional Stein manifold M and with values in a compact complex three-fold X extends to the complement of a finite set of points. If X is simply…
Linear relations, defined as submodules of the direct sum of two modules, can be viewed as objects that carry dynamical information and reflect the inherent uncertainty of sampled dynamics. These objects also provide an algebraic structure…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…
We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…
We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…
We construct some examples of polynomial maps over finite fields that admit subvarieties with a peculiar property: every geometric point is mapped to a fixed point by some iteration of the map, while the whole subvariety is not. Several…
A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…
We prove extension-dimensional versions of finite dimensional selection and approximation theorems. As applications, we obtain several results on extension dimension.
A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…