Related papers: On level-induced suborders
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…
Many tasks in natural language processing involve predicting structured outputs, e.g., sequence labeling, semantic role labeling, parsing, and machine translation. Researchers are increasingly applying deep representation learning to these…
A graph G = (V,E) is called fully regular if for every independent set $I\subset V$ , the number of vertices in $V\setminus$ I that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G…
Inductive inference in supervised classification context constitutes to methods and approaches to assign some objects or items into different predefined classes using a formal rule that is derived from training data and possibly some…
(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-series data or protein structures, a natural total ordering of…
An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
A poset $P = (X,\prec)$ is a unit OC interval order if there exists a representation that assigns an open or closed real interval $I(x)$ of unit length to each $x \in P$ so that $x \prec y$ in $P$ precisely when each point of $I(x)$ is less…
The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called a class of mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs.…
In this paper we define a functor-- leveled sub-cohomology. (It bears no relation with the level of elliptic curves). It is based on leveled cycles on a smooth projective variety, and will be expected to reveal a structure in the level.
A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by…
Let Lambda be a tiled R-order. We give a description of Aut_R(Lambda) as the semidirect product of Inn(Lambda) and a certain subgroup of Aut(Q(Lambda)), where Q(Lambda) is the link graph of Lambda. Additionally, we give criteria for…
In this work we define a class of injective-type norm on tensor products through the environment of sequence classes. Examples and results on this norm will be presented and the duality is studied in this context. As a byproduct, we present…
Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…
We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…
For any length category, we establish a set of rules (necessary and sufficient) that ensure a partial order on the isomorphism classes of simple objects such that the category is equivalent to the category of finite dimensional…
We show that the product of any number of sequentially pseudocompact topological spaces is still sequentially pseudocompact. The definition of sequential pseudocompactness can be given in (at least) two ways: we show their equivalence. Some…
In this paper, we consider subcategories consisting of the extensions of modules in two given Serre subcategories to find a method of constructing Serre subcategories of the category of modules. We shall give a criterion for this…
An r-partite graph is an interval r-graph if corresponding to each vertex we can assign an interval of the real line such that two vertices u and v of different partite sets are adjacent if and only if their corresponding intervals…