Related papers: Multisorted Boolean Clones Determined by Binary Re…

In this paper, we first define two classes of holomorphic mappings defined on the unit ball $B^n$ of n-dimensional complex space $\mathbb{C}^n$ and obtain the lower estimates for Bloch's constant for these classes. Also, we derive the…

We characterize minimal clones generated by a majority function containing at most seven ternary operations.

We propose a hierarchical correlation clustering method that extends the well-known correlation clustering to produce hierarchical clusters applicable to both positive and negative pairwise dissimilarities. Then, in the following, we study…

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

In the unidimensional unfolding model, given m objects in general position there arise 1+m(m-1)/2 rankings. The set of rankings is called the ranking pattern of the m given objects. By changing these m objects, we can generate various…

We show that any clone over a finite domain that has a quasi Maltsev operation and fully symmetric operations of all arities has an incoming minion homomorphism from I, the clone of all idempotent operations on a two element set. We use…

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

We introduce a notion of globular multicategory with homomorphism types. These structures arise when organizing collections of "higher category-like" objects such as type theories with identity types. We show how these globular…

Higher order group cohomology is defined and first properties are given. Using modular symbols, an Eichler-Shimura homomorphism is constructed mapping spaces of higher order cusp forms to higher order cohomology groups.

An ordered $r$-uniform matching of size $n$ is a collection of $n$ pairwise disjoint $r$-subsets of a linearly ordered set of $rn$ vertices. For $n=2$, such a matching is called an $r$-pattern, as it represents one of $\tfrac12\binom{2r}r$…

We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…

In the category of monoids we characterize monomorphisms that are normal, in an appropriate sense, to internal reflexive relations, preorders or equivalence relations. The zero-classes of such internal relations are first described in terms…

Clonoids are sets of finitary functions from an algebra $\mathbb{A}$ to an algebra $\mathbb{B}$ that are closed under composition with term functions of $\mathbb{A}$ on the domain side and with term functions of $\mathbb{B}$ on the codomain…

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…

We present a class of homogeneous ideals which are generated by monomials and binomials of degree two and are set-theoretic complete intersections. This class includes certain reducible varieties of minimal degree and, in particular, the…

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

We describe all binary simple homogeneous structures M in terms of 0-definable equivalence relations on M, which "coordinatize" M and control dividing, and extension properties that respect these equivalence relations.

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.…

We give an example of a finitely based locally finite variety which has uncountably many term clones. (Such varieties were known before.)

We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small…