相关论文: Subfunction relations defined by the clones contai…

From a theoretical view, this paper addresses the general problem of designing ordinal classification methods based on comparing actions with subset of actions, which are representative of their classes (categories). The basic demand of the…

A parking function $(c_1,\ldots,c_n)$ can be viewed as having $n$ cars trying to park on a one-way street with $n$ parking spots, where car $i$ tries to park in spot $c_i$, and otherwise he parks in the leftmost available spot after $c_i$.…

We consider holomorphic functions on the unit disc whose images are contained in a strip of the complex plane. Under an additional condition, such functions are constants. We also consider appropriate operator valued versions. Applications…

Two subsets $A, B$ of the plane are betweenness isomorphic if there is a bijection $f\colon A\to B$ such that, for every $x,y,z\in A$, the point $f(z)$ lies on the line segment connecting $f(x)$ and $f(y)$ if and only if $z$ lies on the…

Let $X$ be a topological space. A subset of $C(X)$, the space of continuous real-valued functions on $X$, is a partially ordered set in the pointwise order. Suppose that $X$ and $Y$ are topological spaces, and $A(X)$ and $A(Y)$ are subsets…

The well-behaved representations of the coordinate algebra of a 2-dimensional quantum complex plane are classified and a C*-algebra is defined which can be viewed as the algebra of continuous functions on the 2-dimensional quantum complex…

It is well-known that a C-monoid is completely integrally closed if and only if its reduced class semigroup is a group and if this holds, then the C-monoid is a Krull monoid and the reduced class semigroup coincides with the usual class…

In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…

A hemiimplicative semilattice is a bounded semilattice $(A, \wedge, 1)$ endowed with a binary operation $\to$, satisfying that for every $a, b, c \in A$, $a \leq b \to c$ implies $a \wedge b \leq c$ (that is to say, one of the conditionals…

The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…

Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…

Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…

Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft…

This unpublished note contains some materials taken from my old study note on groupoids and small categories. It contains a proof for the fact that any groupoid is a group bundle over an equivalence relation. Moreover, the action of a…

A set with a group action is referred to as a $G$-set, and the set of functions that commute with this action forms a monoid under function composition. This paper examines the case where the $G$-set is finite, which implies that the monoid…

In this paper, we develop a semi-classical analysis on H-type groups. We define semi-classical pseudodifferential operators, prove the boundedness of their action on square integrable functions and develop a symbolic calculus. Then, we…

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…

The near-unanimity-closed minions of Boolean functions, i.e., the clonoids whose target algebra contains a near-unanimity function, are completely described. The key concept towards this result is the minorant-minor partial order and its…

Let a function $F: [0,1]^2\rightarrow [0,1]$ be given by $F(x,y)= f^{(-1)}(T(f(x), f(y)))$ where $f :[0,1]\rightarrow [0,1]$ is a monotone function, $f^{(-1)}$ is the pseudo-inverse of $f$ and $T$ is a triangular norm. This article…

We introduce a new approach to the description of multi-sorted clones (sets of $k$-tuples of operations of the same arity, closed under coordinatewise composition and containing all projection tuples) on a two-element domain. Leveraging the…