scholarly journals Triangulations of root polytopes and reduced forms (Extended abstract)

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Karola Mészáros

International audience The type $A_n$ root polytope $\mathcal{P}(A_n^+)$ is the convex hull in $\mathbb{R}^{n+1}$ of the origin and the points $e_i-e_j$ for $1 \leq i < j \leq n+1$. Given a tree $T$ on vertex set $[n+1]$, the associated root polytope $\mathcal{P}(T)$ is the intersection of $\mathcal{P}(A_n^+)$ with the cone generated by the vectors $e_i-e_j$, where $(i, j) \in E(T)$, $i < j$. The reduced forms of a certain monomial $m[T]$ in commuting variables $x_{ij}$ under the reduction $x_{ij} x_{jk} \to x_{ik} x_{ij} + x_{jk} x_{ik} + \beta x_{ik}$, can be interpreted as triangulations of $\mathcal{P}(T)$. If we allow variables $x_{ij}$ and$x_{kl}$ to commute only when $i, j, k, l$ are distinct, then the reduced form of $m[T]$ is unique and yields a canonical triangulation of $\mathcal{P}(T)$ in which each simplex corresponds to a noncrossing alternating forest. Le polytope des racines $\mathcal{P}(A_n^+)$ de type $A_n$ est l'enveloppe convexe dans $\mathbb{R}^{n+1}$ de l'origine et des points $e_i-e_j$ pour $1 \leq i < j \leq n+1$. Étant donné un arbre $T$ sur l'ensemble des sommets $[n+1]$, le polytope des racines associé, $\mathcal{P}(T)$, est l'intersection de $\mathcal{P}(A_n^+)$ avec le cône engendré par les vecteurs $e_i-e_j$, où $(i, j) \in E(T)$, $i < j$. Les formes réduites d'un certain monôme $m[T]$ en les variables commutatives $x_{ij}$ sous la reduction $x_{ij} x_{jk} \to x_{ik} x_{ij} + x_{jk} x_{ik} + \beta x_{ik}$ peuvent être interprétées comme des triangulations de $\mathcal{P}(T)$. Si on impose la restriction que les variables $x_{ij}$ et $x_{kl}$ commutent seulement lorsque les indices $i, j, k, l$ sont distincts, alors la forme réduite de $m[T]$ est unique et produit une triangulation canonique de $\mathcal{P}(T)$ dans laquelle chaque simplexe correspond à une forêt alternée non croisée.


2020 ◽  
Vol 25 (5) ◽  
pp. 29-35
Author(s):  
M. Yu. Maksimova ◽  
A. V. Ivanov ◽  
K. A. Nikiforova ◽  
F. R. Ochtova ◽  
E. T. Suanova ◽  
...  

Ischemic stroke (IS) and type 2 diabetes mellitus are factors that affect the homeostasis of low-molecularweight aminothiols (cysteine, homocysteine, glutathione etc.). It has already been shown that IS in the acute period led to a decrease a level of reduced forms of aminothiols, but it is not clear whether type 2 diabetes mellitus has a noticeable effect there. Objective: to reveal the features of homeostasis of aminothiols in patients with type 2 diabetes mellitus in acute IS. Material and methods. The study involved 76 patients with primary middle cerebral artery IS in the first 10–24 hours after development of neurological symptoms. Group 1 included 15 patients with IS and type 2 diabetes mellitus, group 2 — 61 patients with IS and stress hyperglycemia. Their total plasma levels of cysteine, homocysteine, and glutathione, their reduced forms, and redox status were determined at admission (in the first 24 hours after IS). Results. There was a decrease in the level of total glutathione level (1.27 vs. 1.65 μM, p = 0.021), as well as its reduced form (0.03 vs. 0.04 μM, p = 0.007) in patients with IS and type 2 diabetes mellitus. Patients with type 2 diabetes mellitus who had a low redox status of homocysteine (0.65–1.2%) and glutathione (0.7–2.0%) were also characterized by a decrease in total glutathione level (p = 0.02; p = 0.03). Conclusion. Thus, type 2 diabetes mellitus is associated with a decrease in the level of total glutathione in acute IS. Probably, type 2 diabetes mellitus is characterized by a particular relationship between the metabolism of homocysteine, glutathione and glucose. Therefore, the search for homocysteine-dependent approaches to correct glutathione metabolism in type 2 diabetes mellitus may be of interest as an adjuvant therapy for IS.



2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Francesco M. Malvestuto

Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under intersection and every set in is connected in . The members of are called convex sets. The convex hull of a subset X of V is the smallest convex set containing X. By a cluster of we mean any nonempty subset of V in which every two vertices are separated by no convex set. We say that a convexity space on is decomposable if it satisfies the following three axioms: (i) the maximal clusters of form an acyclic hypergraph, (ii) every maximal cluster of is a convex set, and (iii) for every nonempty vertex set X, a vertex does not belong to the convex hull of X if and only if it is separated from X by a convex cluster. We prove that a decomposable convexity space on is fully specified by the maximal clusters of in that (1) there is a closed formula which expresses the convex hull of a set in terms of certain convex clusters of and (2) is a convex geometry if and only if the subspaces of induced by maximal clusters of are all convex geometries. Finally, we prove the decomposability of some known convexities in graphs and hypergraphs taken from the literature (such as “monophonic” and “canonical” convexities in hypergraphs and “all-paths” convexity in graphs).



1995 ◽  
Vol 41 (3) ◽  
pp. 361-366 ◽  
Author(s):  
A Andersson ◽  
A Lindgren ◽  
B Hultberg

Abstract Changes in concentration of reduced and oxidized low-M(r) thiols were measured in blood and plasma before and after the separation of blood cells. If centrifugation of blood was postponed, the reduced form of homocysteine in plasma increased with time at 22 degrees C; in contrast, the concentrations of other reduced thiols (cysteine, glutathione, and cysteinylglycine) decreased. In plasma the reduced forms of all thiols disappeared at a rate that followed first-order kinetics. The rates of disappearance ("half-lives") were temperature-dependent; they were about the same for glutathione and homocysteine (11.7 and 14.3 min, respectively, at 22 degrees C) and somewhat higher for cysteinylglycine and cysteine. After establishing proper sampling conditions for reduced thiols, we measured this thiol fraction as well as free (non-protein-bound) and total thiols in 10 reference subjects and 19 patients with cerebral infarction. Mild but significant hyperhomocysteinemia involving total and free homocysteine (but not reduced homocysteine) was found in the patients.



2012 ◽  
Vol 65 (11) ◽  
pp. 2193-2220 ◽  
Author(s):  
Susanne Brouwer ◽  
Holger Mitterer ◽  
Falk Huettig

In listeners' daily communicative exchanges, they most often hear casual speech, in which words are often produced with fewer segments, rather than the careful speech used in most psycholinguistic experiments. Three experiments examined phonological competition during the recognition of reduced forms such as [pjutər] for computer using a target-absent variant of the visual world paradigm. Listeners' eye movements were tracked upon hearing canonical and reduced forms as they looked at displays of four printed words. One of the words was phonologically similar to the canonical pronunciation of the target word, one word was similar to the reduced pronunciation, and two words served as unrelated distractors. When spoken targets were presented in isolation (Experiment 1) and in sentential contexts (Experiment 2), competition was modulated as a function of the target word form. When reduced targets were presented in sentential contexts, listeners were probabilistically more likely to first fixate reduced-form competitors before shifting their eye gaze to canonical-form competitors. Experiment 3, in which the original /p/ from [pjutər] was replaced with a “real” onset /p/, showed an effect of cross-splicing in the late time window. We conjecture that these results fit best with the notion that speech reductions initially activate competitors that are similar to the phonological surface form of the reduction, but that listeners nevertheless can exploit fine phonetic detail to reconstruct strongly reduced forms to their canonical counterparts.



2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Anton Pierre Burger ◽  
Alewyn Petrus Villiers ◽  
Jan Harm Vuuren

Graph Theory International audience A subset X of the vertex set of a graph G is a secure dominating set of G if X is a dominating set of G and if, for each vertex u not in X, there is a neighbouring vertex v of u in X such that the swap set (X-v)∪u is again a dominating set of G. The secure domination number of G is the cardinality of a smallest secure dominating set of G. A graph G is p-stable if the largest arbitrary subset of edges whose removal from G does not increase the secure domination number of the resulting graph, has cardinality p. In this paper we study the problem of computing p-stable graphs for all admissible values of p and determine the exact values of p for which members of various infinite classes of graphs are p-stable. We also consider the problem of determining analytically the largest value ωn of p for which a graph of order n can be p-stable. We conjecture that ωn=n-2 and motivate this conjecture.



2016 ◽  
Vol Vol. 17 no. 3 (Graph Theory) ◽  
Author(s):  
Susana López ◽  
Francesc-Antoni Muntaner-Batle

International audience An arc colored eulerian multidigraph with $l$ colors is rainbow eulerian if there is an eulerian circuit in which a sequence of $l$ colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno et al. as follows: let $D$ be a digraph and let $\Gamma$ be a family of digraphs such that $V(F)=V$ for every $F\in \Gamma$. Consider any function $h:E(D) \longrightarrow \Gamma$. Then the product $D \otimes_h \Gamma$ is the digraph with vertex set $V(D) \times V$ and $((a,x),(b,y)) \in E(D \otimes_h \Gamma)$ if and only if $(a,b) \in E(D)$ and $(x,y) \in E(h (a,b))$. In this paper we use rainbow eulerian multidigraphs and permutations as a way to characterize the $\otimes_h$-product of oriented cycles. We study the behavior of the $\otimes_h$-product when applied to digraphs with unicyclic components. The results obtained allow us to get edge-magic labelings of graphs formed by the union of unicyclic components and with different magic sums.



2001 ◽  
Vol Vol. 4 no. 2 ◽  
Author(s):  
C.R. Subramanian

International audience Fix positive integers k and l. Consider a random k-partite graph on n vertices obtained by partitioning the vertex set into V_i, (i=1, \ldots,k) each having size Ω (n) and choosing each possible edge with probability p. Consider any vertex x in any V_i and any vertex y. We show that the expected number of simple paths of even length l between x and y differ significantly depending on whether y belongs to the same V_i (as x does) or not. A similar phenomenon occurs when l is odd. This result holds even when k,l vary slowly with n. This fact has implications to coloring random graphs. The proof is based on establishing bijections between sets of paths.



2010 ◽  
Vol Vol. 12 no. 5 (Graph and Algorithms) ◽  
Author(s):  
C. C. Centeno ◽  
S. Dantas ◽  
M. C. Dourado ◽  
Dieter Rautenbach ◽  
Jayme Luiz Szwarcfiter

Graphs and Algorithms International audience A set C of vertices of a graph G is P(3)-convex if v is an element of C for every path uvw in G with u, w is an element of C. We prove that it is NP-complete to decide for a given graph G and a given integer p whether the vertex set of G can be partitioned into p non-empty disjoint P(3)-convex sets. Furthermore, we study such partitions for a variety of graph classes.



2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Dustin Cartwright ◽  
Melody Chan

International audience We introduce and study three different notions of tropical rank for symmetric matrices and dissimilarity matrices in terms of minimal decompositions into rank 1 symmetric matrices, star tree matrices, and tree matrices. Our results provide a close study of the tropical secant sets of certain nice tropical varieties, including the tropical Grassmannian. In particular, we determine the dimension of each secant set, the convex hull of the variety, and in most cases, the smallest secant set which is equal to the convex hull. Nous introduisons et étudions trois notions différentes de rang tropical pour des matrices symétriques et des matrices de dissimilarité, en utilisant des décompositions minimales en matrices symétriques de rang 1, en matrices d'arbres étoiles, et en matrices d'arbres. Nos résultats donnent lieu à une étude détaillée des ensembles des sécantes tropicales de certaines jolies variétés tropicales, y compris la grassmannienne tropicale. En particulier, nous déterminons la dimension de chaque ensemble des sécantes, l'enveloppe convexe de la variété, ainsi que, dans la plupart des cas, le plus petit ensemble des sécantes qui est égal à l'enveloppe convexe.



2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Sergei Bespamyatnikh

International audience A triangulation of a finite point set A in $\mathbb{R}^d$ is a geometric simplicial complex which covers the convex hull of $A$ and whose vertices are points of $A$. We study the graph of triangulations whose vertices represent the triangulations and whose edges represent geometric bistellar flips. The main result of this paper is that the graph of triangulations in three dimensions is connected when the points of $A$ are in convex position. We introduce a tree of triangulations and present an algorithm for enumerating triangulations in $O(log log n)$ time per triangulation.



Sign in / Sign up

Export Citation Format

Share Document