scholarly journals Matroid Polytopes and Their Volumes

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Federico Ardila ◽  
Carolina Benedetti ◽  
Jeffrey Doker

International audience We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian $Gr_{k,n}$. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of $M$. Our proofs are based on a natural extension of Postnikov's theory of generalized permutohedra. On exprime le polytope matroïde $P_M$ d'un matroïde $M$ comme somme signée de Minkowski de simplices, et on obtient une formule pour le volume de $P_M$. Ceci donne une expression combinatoire pour le degré d'une clôture d'orbite de tore dans la Grassmannienne $Gr_{k,n}$. Ensuite, on déduit des résultats analogues pour le polytope ensemble indépendant et pour le polytope matroïde drapeau associé à $M$. Nos preuves sont fondées sur une extension naturelle de la théorie de Postnikov de permutoèdres généralisés.

2005 ◽  
Vol Vol. 7 ◽  
Author(s):  
Nesrine Abbas ◽  
Joseph Culberson ◽  
Lorna Stewart

International audience A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAX(U(k-SET)) and show that this problem is CO-NP-complete. This partially fills a gap in known complexity cases of maximal NP-complete problems, and raises some interesting open conjectures discussed in the conclusion.


2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Hortensia Galeana-Sánchez ◽  
Mucuy-Kak Guevara

International audience A kernel $N$ of a digraph $D$ is an independent set of vertices of $D$ such that for every $w \in V(D)-N$ there exists an arc from $w$ to $N$. If every induced subdigraph of $D$ has a kernel, $D$ is said to be a kernel perfect digraph. Minimal non-kernel perfect digraph are called critical kernel imperfect digraph. If $F$ is a set of arcs of $D$, a semikernel modulo $F$, $S$ of $D$ is an independent set of vertices of $D$ such that for every $z \in V(D)- S$ for which there exists an $Sz-$arc of $D-F$, there also exists an $zS-$arc in $D$. In this talk some structural results concerning critical kernel imperfect and sufficient conditions for a digraph to be a critical kernel imperfect digraph are presented.


2009 ◽  
Vol Vol. 11 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Raffaele Mosca

Graphs and Algorithms International audience We prove that on the class of (P6,diamond)-free graphs the Maximum-Weight Independent Set problem and the Minimum-Weight Independent Dominating Set problem can be solved in polynomial time.


2013 ◽  
Vol Vol. 15 no. 2 (Graph Theory) ◽  
Author(s):  
Shuchao Li ◽  
Huihui Zhang ◽  
Xiaoyan Zhang

Graph Theory International audience A maximal independent set is an independent set that is not a proper subset of any other independent set. Liu [J.Q. Liu, Maximal independent sets of bipartite graphs, J. Graph Theory, 17 (4) (1993) 495-507] determined the largest number of maximal independent sets among all n-vertex bipartite graphs. The corresponding extremal graphs are forests. It is natural and interesting for us to consider this problem on bipartite graphs with cycles. Let \mathscrBₙ (resp. \mathscrBₙ') be the set of all n-vertex bipartite graphs with at least one cycle for even (resp. odd) n. In this paper, the largest number of maximal independent sets of graphs in \mathscrBₙ (resp. \mathscrBₙ') is considered. Among \mathscrBₙ the disconnected graphs with the first-, second-, \ldots, \fracn-22-th largest number of maximal independent sets are characterized, while the connected graphs in \mathscrBₙ having the largest, the second largest number of maximal independent sets are determined. Among \mathscrBₙ' graphs have the largest number of maximal independent sets are identified.


2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Takeshi Ikeda ◽  
Leonardo Mihalcea ◽  
Hiroshi Naruse

International audience For each infinite series of the classical Lie groups of type $B$, $C$ or $D$, we introduce a family of polynomials parametrized by the elements of the corresponding Weyl group of infinite rank. These polynomials represent the Schubert classes in the equivariant cohomology of the corresponding flag variety. They satisfy a stability property, and are a natural extension of the (single) Schubert polynomials of Billey and Haiman, which represent non-equivariant Schubert classes. When indexed by maximal Grassmannian elements of the Weyl group, these polynomials are equal to the factorial analogues of Schur $Q$- or $P$-functions defined earlier by Ivanov. Pour chaque série infinie des groupe de Lie classiques de type $B$,$C$ ou $D$, nous présentons une famille de polynômes indexées par de éléments de groupe de Weyl correspondant de rang infini. Ces polynômes représentent des classes de Schubert dans la cohomologie équivariante des variétés de drapeaux. Ils ont une certain propriété de stabilité, et ils étendent naturellement des polynômes Schubert (simples) de Billey et Haiman, que représentent des classes de Schubert dans la cohomologie non-équivariante. Quand ils sont indexées par des éléments Grassmanniennes de groupes de Weyl, ces polynômes sont égaux à des analogues factorielles de fonctions $Q$ et $P$ de Schur, étudiées auparavant par Ivanov.


2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Robert Berke ◽  
Tibor Szabó

International audience We show that any graph of maximum degree at most $3$ has a two-coloring, such that one color-class is an independent set while the other color induces monochromatic components of order at most $189$. On the other hand for any constant $C$ we exhibit a $4$-regular graph, such that the deletion of any independent set leaves at least one component of order greater than $C$. Similar results are obtained for coloring graphs of given maximum degree with $k+ \ell$ colors such that $k$ parts form an independent set and $\ell$ parts span components of order bounded by a constant. A lot of interesting questions remain open.


2012 ◽  
Vol Vol. 14 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Zbigniew Lonc ◽  
Pawel Naroski

Discrete Algorithms International audience By an Euler walk in a 3-uniform hypergraph H we mean an alternating sequence v(0), epsilon(1), v(1), epsilon(2), v(2), ... , v(m-1), epsilon(m), v(m) of vertices and edges in H such that each edge of H appears in this sequence exactly once and v(i-1); v(i) is an element of epsilon(i), v(i-1) not equal v(i), for every i = 1, 2, ... , m. This concept is a natural extension of the graph theoretic notion of an Euler walk to the case of 3-uniform hypergraphs. We say that a 3-uniform hypergraph H is strongly connected if it has no isolated vertices and for each two edges e and f in H there is a sequence of edges starting with e and ending with f such that each two consecutive edges in this sequence have two vertices in common. In this paper we give an algorithm that constructs an Euler walk in a strongly connected 3-uniform hypergraph (it is known that such a walk in such a hypergraph always exists). The algorithm runs in time O(m), where m is the number of edges in the input hypergraph.


2012 ◽  
Vol Vol. 14 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Serge Gaspers ◽  
Mathieu Liedloff

Graphs and Algorithms International audience An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two vertices of D are adjacent in G. Finding a minimum independent dominating set in a graph is an NP-hard problem. Whereas it is hard to cope with this problem using parameterized and approximation algorithms, there is a simple exact O(1.4423^n)-time algorithm solving the problem by enumerating all maximal independent sets. In this paper we improve the latter result, providing the first non trivial algorithm computing a minimum independent dominating set of a graph in time O(1.3569^n). Furthermore, we give a lower bound of \Omega(1.3247^n) on the worst-case running time of this algorithm, showing that the running time analysis is almost tight.


2010 ◽  
Vol 62 (6) ◽  
pp. 1228-1245 ◽  
Author(s):  
Federico Ardila ◽  
Alex Fink ◽  
Felipe Rincón

AbstractWe prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Axel Hultman

International audience Let $G$ be a connected reductive linear algebraic group over $ℂ$ with an involution $θ$ . Denote by $K$ the subgroup of fixed points. In certain cases, the $K-orbits$ in the flag variety $G/B$ are indexed by the twisted identities $ι (θ ) = {θ (w^{-1})w | w∈W}$ in the Weyl group $W$. Under this assumption, we establish a criterion for rational smoothness of orbit closures which generalises classical results of Carrell and Peterson for Schubert varieties. That is, whether an orbit closure is rationally smooth at a given point can be determined by examining the degrees in a "Bruhat graph'' whose vertices form a subset of $ι (θ )$. Moreover, an orbit closure is rationally smooth everywhere if and only if its corresponding interval in the Bruhat order on $ι (θ )$ is rank symmetric. In the special case $K=\mathrm{Sp}_{2n}(ℂ), G=\mathrm{SL}_{2n}(ℂ)$, we strengthen our criterion by showing that only the degree of a single vertex, the "bottom one'', needs to be examined. This generalises a result of Deodhar for type A Schubert varieties. Soit $G$ un groupe algébrique connexe réductif sur $ℂ$, équipé d'une involution $θ$ . Soit $K$ le sousgroupe de ses points fixes. Dans certains cas, les orbites des points de la variété de drapeaux $G/B$ sous l'action de $K$ sont indexées par les identités tordues, $ι (θ ) = {θ (w^{-1})w | w∈W}$, du groupe de Weyl $W$. Sous cette hypothèse, on établit un critère pour la lissité rationnelle des adhérences des orbites, qui généralise des résultats classiques de Carrell et Peterson pour les variétés de Schubert. Plus précisément, on peut déterminer si l'adhérence d'une orbite est rationnellement lisse en examinant les degrés dans un "Graphe de Bruhat" dont les sommets forment un sous-ensemble de $ι (θ )$. En outre, l'adhérence d'une orbite est partout rationnellement lisse si et seulement si l'intervalle correspondant dans l'ordre de Bruhat de $ι (θ )$ est symétrique respectivement au rang. Dans le cas particulier $K=\mathrm{Sp}_{2n}(ℂ), G=\mathrm{SL}_{2n}(ℂ)$, nous améliorons notre critère en montrant qu'il suffit d'examiner le degré d'un seul sommet, celui "du bas". Ceci généralise un résultat de Deodhar pour les variétés de Schubert de type A.


Sign in / Sign up

Export Citation Format

Share Document