اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Class of Orderings in the Range of Bordas Rule
231
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a class of orderings L for which there exists a profile u of preferences for a fixed odd number of individuals such that Bordas rule maps u to L.
قيم البحث
اقرأ أيضاً
We show that, for every linear ordering of $[2]^n$, there is a large subcube on which the ordering is lexicographic. We use this to deduce that every long sequence contains a long monotone subsequence supported on an affine cube. More generally, we
prove an analogous result for linear orderings of $[k]^n$. We show that, for every such ordering, there is a large subcube on which the ordering agrees with one of approximately $frac{(k-1)!}{2(ln 2)^k}$ orderings.
The concept of energy of a signed digraph is extended to iota energy of a signed digraph. The energy of a signed digraph $S$ is defined by $E(S)=sum_{k=1}^n|text{Re}(z_k)|$, where $text{Re}(z_k)$ is the real part of eigenvalue $z_k$ and $z_k$ is the
eigenvalue of the adjacency matrix of $S$ with $n$ vertices, $k=1,2,ldots,n$. Then the iota energy of $S$ is defined by $E(S)=sum_{k=1}^n|text{Im}(z_k)|$, where $text{Im}(z_k)$ is the imaginary part of eigenvalue $z_k$. In this paper, we consider a special graph class for bicyclic signed digraphs $mathcal{S}_n$ with $n$ vertices which have two vertex-disjoint signed directed even cycles. We give two iota energy orderings of bicyclic signed digraphs, one is including two positive or two negative directed even cycles, the other is including one positive and one negative directed even cycles.
Let $D=(V,A)$ be an acyclic digraph. For $xin V$ define $e_{_{D}}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is a one-to-one map $g: V rightarrow [1,|V|] $ that has the property that
for all $x,yin V$ if $(x,y)in A$, then $g(x) < g(y)$. We prove that for every acyclic ordering $g$ of $D$ the following inequality holds: [sum_{xin V} e_{_{D}}(x)cdot g(x) ~geq~ frac{1}{2} sum_{xin V}[e_{_{D}}(x)]^2~.] The class of acyclic digraphs for which equality holds is determined as the class of comparbility digraphs of posets of order dimension two.
In this note, a new concept called {em $SDR$-matrix} is proposed, which is an infinite lower triangular matrix obeying the generalized rule of David star. Some basic properties of $SDR$-matrices are discussed and two conjectures on $SDR$-matrices are
presented, one of which states that if a matrix is a $SDR$-matrix, then so is its matrix inverse (if exists).
We introduce a quasisymmetric class function associated with a group acting on a double poset or on a directed graph. The latter is a generalization of the chromatic quasisymmetric function of a digraph introduced by Ellzey, while the latter is a gen
eralization of a quasisymmetric function introduced by Grinberg. We prove representation-theoretic analogues of classical and recent results, including $F$-positivity, and combinatorial reciprocity theorems. We also deduce results for orbital quasisymmetric functions. We also study a generalization of the notion of strongly flawless sequences.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
