اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConjugacy and Iteration of Standard Interval Rank in Finite Ordered Sets
147
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In order theory, a rank function measures the vertical level of a poset element. It is an integer-valued function on a poset which increments with the covering relation, and is only available on a graded poset. Defining a vertical measure to an arbitrary finite poset can be accomplished by extending a rank function to be interval-valued. This establishes an order homomorphism from a base poset to a poset over real intervals, and a standard (canonical) specific interval rank function is available as an extreme case. Various ordering relations are available over intervals, and we begin in this paper by considering conjugate orders which partition the space of pairwise comparisons of order elements. For us, these elements are real intervals, and we consider the weak and subset interval orders as (near) conjugates. It is also natural to ask about interval rank functions applied reflexively on whatever poset of intervals we have chosen, and thereby a general iterative strategy for interval ranks. We explore the convergence properties of standard and conjugate interval ranks, and conclude with a discussion of the experimental mathematics needed to support this work.
قيم البحث
اقرأ أيضاً
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $mathcal J$ of intervals of some totally ordered abelian group, these intervals being
of the form $[x, x+ alpha[$ for some positive $alpha$. We describe ordered groups such that the ordering is a semiorder and we introduce threshold groups generalizing totally ordered groups. We show that the free group on finitely many generators and the Thompson group $mathbb F$ can be equipped with a compatible semiorder which is not a weak order. On another hand, a group introduced by Clifford cannot.
An $ntimes n$ matrix $M$ is called a textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,ell} M_{ell,k} = 0$ for every $k e ell$. Dietzfelbinger, Hromkovi{v{c}}, and Schnitger (1996) showed that $n le (mbox{rk} M)^2$,
regardless of over which field the rank is computed, and asked whether the exponent on $mbox{rk} M$ can be improved. We settle this question. In characteristic zero, we construct an infinite family of rational fooling-set matrices with size $n = binom{mbox{rk} M+1}{2}$. In nonzero characteristic, we construct an infinite family of matrices with $n= (1+o(1))(mbox{rk} M)^2$.
For a (finite) partially ordered set (poset) $P$, we call a dominating set $D$ in the comparability graph of $P$, an order-sensitive dominating set in $P$ if either $xin D$ or else $a<x<b$ in $P$ for some $a,bin D$ for every element $x$ in $P$ which
is neither maximal nor minimal, and denote by $gamma_{os}(P)$, the least size of an order-sensitive dominating set of $P$. For every graph $G$ and integer $kgeq 2$, we associate a graded poset $mathscr{P}_k(G)$ of height $k$, and prove that $gamma_{os}(mathscr{P}_3(G))=gamma_{text{R}}(G)$ and $gamma_{os}(mathscr{P}_4(G))=2gamma(G)$ hold, where $gamma(G)$ and $gamma_{text{R}}(G)$ are the domination and Roman domination number of $G$, respectively. Apart from these, we introduce the notion of a Helly poset, and prove that when $P$ is a Helly poset, the computation of order-sensitive domination number of $P$ can be interpreted as a weighted clique partition number of a graph, the middle graph of $P$. Moreover, we show that the order-sensitive domination number of a poset $P$ exactly corresponds to the biclique vertex-partition number of the associated bipartite transformation of $P$. Finally, we prove that the decision problem of order-sensitive domination on posets of arbitrary height is NP-complete, which is obtained by using a reduction from EQUAL-$3$-SAT problem.
The closed cone of flag vectors of Eulerian partially ordered sets is studied. It is completely determined up through rank seven. Half-Eulerian posets are defined. Certain limit posets of Billera and Hetyei are half-Eulerian; they give rise to extrem
e rays of the cone for Eulerian posets. A new family of linear inequalities valid for flag vectors of Eulerian posets is given.
An ntimes n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k e ell we have M_{k,ell} M_{ell,k} = 0. Dietzfelbinger, Hromkoviv{c}, and Schnitger (1996) showed that n le (rk M)^2, regardless of
over which field the rank is computed, and asked whether the exponent on rk M can be improved. We settle this question for nonzero characteristic by constructing a family of matrices for which the bound is asymptotically tight. The construction uses linear recurring sequences.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
