相关论文: The Number of Hierarchical Orderings

The present work is dedicated to searching parameters, alternative to entropy, applicable for description of highly organized systems. The general concept has been offered, in which the system complexity and order are functions of the order…

An n-element set contains an unknown number of excellent elements, and our goal is to identify at least one of these elements. The members of a family of subsets can be asked if they contain at least one excellent element or not. At most…

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

The Stirling number of a simple graph is the number of partitions of its vertex set into a specific number of non-empty independent sets. In 2015, Engbers et al. showed that the coefficients in the normal ordering of a word $w$ in the…

Bell scenarios are multipartite scenarios that exclude any signalling between parties. This leads to a strict hierarchy of classical, quantum, and non-signalling correlations in such scenarios. Here we consider a minimal relaxation of…

Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…

An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

In this paper, we consider a natural generalization of the concept of order of an element in a group: an element $g \in G$ is said to have order $k$ in a subgroup $H$ of $G$ (\resp \wrt a coset $Hu$) if $k$ is the first strictly positive…

We define a Carmichael number of order m to be a composite integer n such that nth-power raising defines an endomorphism of every Z/nZ-algebra that can be generated as a Z/nZ-module by m elements. We give a simple criterion to determine…

A random graph order is a partial order achieved by independently sprinkling relations on a vertex set (each with probability $p$) and adding relations to satisfy the requirement of transitivity. A \textit{post} is an element in a partially…

Higher-order networks effectively represent complex systems with group interactions. Existing methods usually overlook the relative contribution of group interactions (hyperlinks) of different sizes to the overall network structure. Yet,…

We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number of pairs in T. Special cases include sorting by comparisons,…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

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…

We consider group orders and right-orders which are discrete, meaning there is a least element which is greater than the identity. We note that free groups cannot be given discrete orders, although they do have right-orders which are…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Levine defined the rational algebraic knot concordance group and proved that each nontrivial element is of order two, of order four, or of infinite order. The determination of the order of an element depends on a p-adic analysis for all…

Label ranking is a prediction task which deals with learning a mapping between an instance and a ranking (i.e., order) of labels from a finite set, representing their relevance to the instance. Boosting is a well-known and reliable ensemble…