Related papers: On mappings of terms determined by hypersubstituti…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…
Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…
Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.
We prove that any closed map between metrizable spaces can be extended to a closed map between completely metrizable spaces with the same extensional dimension.
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…
In this paper we analyze the notion of morphisms of rings of superfunctions which is the basic concept underlying the definition of supermanifolds as ringed spaces (i.e. following Berezin, Leites, Manin, etc.). We establish a representation…
We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…
Let H be a complex Hilbert space and denote by Bs(H) the set of all self-adjoint bounded linear operators on H. In this paper we describe the form of all bijective maps (no linearity or continuity is assumed) on Bs(H) which preserve the…
We describe an inventory of semantic relations that are expressed by prepositions. We define these relations by building on the word sense disambiguation task for prepositions and propose a mapping from preposition senses to the relation…
An ultrametric defined on a subset S of a metric space X can be extended to X while roughly preserving distances between pairs in S x X.
We construct a hierarchy of supersymmetric string theories by showing that the general N-extended superstrings may be viewed as a special class of the (N+1)-extended superstrings. As a side result, we find a twisted (N+2) superconformal…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…