Related papers: Semi-isolation and the strict order property
In this paper, we introduce almost (strictly) semi-positive tensors, which extend the concept of almost (strictly) semimonotone matrices. Furthermore, we provide insights into the characteristics of the entries within these almost…
By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…
In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…
We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.
We introduce and study an abstract class of semirings, which we call exact semirings, defined by a Hahn-Banach-type separation property on modules. Our motivation comes from the tropical semiring, and in particular a desire to understand…
We introduce the notion of metric semilattice on the metric space and prove the criterion of $\R$-tree as connected geodesic metric space $X$ admitting the partial order, such that $X$ is semilinear metric semilattice. Also we state the…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…
Semi-supervised learning is an important and active topic of research in pattern recognition. For classification using linear discriminant analysis specifically, several semi-supervised variants have been proposed. Using any one of these…
Issues concerning intelligent data analysis occurring in machine learning are investigated. A scheme for synthesizing correct supervised classification procedures is proposed. These procedures are focused on specifying partial order…
This paper studies the zero-classes of monoid semi-congruences, understood as internal reflexive relations on a monoid. Classical examples include normal submonoids, which arise as zero-classes of congruences, and positive cones, which are…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
In the framework of semiclassical resonances, we make more precise the link between polynomial estimates of the extension of the resolvent and propagation of the singularities through the trapped set. This approach makes it possible to…
In this note, we present a relationship between Lelong numbers and complex singularity exponents. As an application, we obtain a new proof of Siu's semicontinuity theorem for Lelong numbers.
We consider two relations on a $\cap$-semigroup of partial functions of a given set: the inclusion of domains and the semiadjacencity (i.e., the inclusion of the image of the first function into the domain of the second), which…
On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…
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…
We determine when an orthodox semigroup S has a permutation that sends each member of S to one of its inverses and show that if such a permutation exists, it may be taken to be an involution. In the case of a finite orthodox semigroup the…