scholarly journals A unification of permutation patterns related to Schubert varieties

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Henning A. Úlfarsson
Keyword(s):  
Schubert Varieties ◽  
Permutation Patterns ◽  
International Audience

International audience We prove new connections between permutation patterns and singularities of Schubert varieties, by giving a new characterization of factorial and Gorenstein varieties in terms of so called bivincular patterns. These are generalizations of classical patterns where conditions are placed on the location of an occurrence in a permutation, as well as on the values in the occurrence. This clarifies what happens when the requirement of smoothness is weakened to factoriality and further to Gorensteinness, extending work of Bousquet-Mélou and Butler (2007), and Woo and Yong (2006). We also prove results that translate some known patterns in the literature into bivincular patterns. Nous démontrons de nouveaux liens entre les motifs de permutation et les singularités des variétés de Schubert, par la méthode de donner une nouvelle caractérisation des variétés factorielles et de Gorenstein par rapport à les motifs bivinculaires. Ces motifs sont généralisations des motifs classiques où des conditions se posent sur la position d'une occurrence dans une permutation, aussi bien que sur les valeurs qui se présentent dans l'occurrence. Ceci éclaircit les phénomènes où la condition de nonsingularité s'affaiblit á factorialité et même à Gorensteinité, et augmente les travaux de Bousquet-Mélou et Butler (2007), et de Woo et Yong (2006). Nous démontrons également des résultats qui traduisent quelques motifs connus en la littérature en motifs bivinculaires.

scholarly journals Rational smoothness and affine Schubert varieties of type A

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Sara Billey ◽  
Andrew Crites
Keyword(s):  
Weyl Group ◽  
Schubert Variety ◽  
Type A ◽  
Algebraic Combinatorics ◽  
Schubert Varieties ◽  
Topological Properties ◽  
Affine Weyl Group ◽  
International Audience ◽  
Affine Permutations

International audience The study of Schubert varieties in G/B has led to numerous advances in algebraic combinatorics and algebraic geometry. These varieties are indexed by elements of the corresponding Weyl group, an affine Weyl group, or one of their parabolic quotients. Often times, the goal is to determine which of the algebraic and topological properties of the Schubert variety can be described in terms of the combinatorics of its corresponding Weyl group element. A celebrated example of this occurs when G/B is of type A, due to Lakshmibai and Sandhya. They showed that the smooth Schubert varieties are precisely those indexed by permutations that avoid the patterns 3412 and 4231. Our main result is a characterization of the rationally smooth Schubert varieties corresponding to affine permutations in terms of the patterns 4231 and 3412 and the twisted spiral permutations. L'étude des variétés de Schubert dans G/B a mené à plusieurs avancées en combinatoire algébrique. Ces variétés sont indexées soit par l'élément du groupe de Weyl correspondant, soit par un groupe de Weyl affine, soit par un de leurs quotients paraboliques. Souvent, le but est de déterminer quelles propriétés algébriques et topologiques des variétés de Schubert peuvent être décrites en termes des propriétés combinatoires des éléments du groupe de Weyl correspondant. Un exemple bien connu, dû à Lakshmibai et Sandhya, concerne le cas où G/B est de type A. Ils ont montré que les variétés de Schubert lisses sont exactement celles qui sont indexées par les permutations qui évitent les motifs 3412 et 4231. Notre résultat principal est une caractérisation des variétés de Schubert lisses et rationnelles qui correspondent à des permutations affines pour les motifs 4231 et 3412 et les permutations spirales tordues.

scholarly journals p-box: a new graph model

2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Mauricio Soto ◽  
Christopher Thraves-Caro
Keyword(s):  
Graph Theory ◽  
Graph Model ◽  
Directed Path ◽  
Outerplanar Graphs ◽  
New Model ◽  
Model Based ◽  
Representative Element ◽  
International Audience ◽  
Graph Families

Graph Theory International audience In this document, we study the scope of the following graph model: each vertex is assigned to a box in ℝd and to a representative element that belongs to that box. Two vertices are connected by an edge if and only if its respective boxes contain the opposite representative element. We focus our study on the case where boxes (and therefore representative elements) associated to vertices are spread in ℝ. We give both, a combinatorial and an intersection characterization of the model. Based on these characterizations, we determine graph families that contain the model (e. g., boxicity 2 graphs) and others that the new model contains (e. g., rooted directed path). We also study the particular case where each representative element is the center of its respective box. In this particular case, we provide constructive representations for interval, block and outerplanar graphs. Finally, we show that the general and the particular model are not equivalent by constructing a graph family that separates the two cases.

scholarly journals Classes of graphs with restricted interval models

1999 ◽  
Vol Vol. 3 no. 4 ◽  
Author(s):  
Andrzej Proskurowski ◽  
Jan Arne Telle
Keyword(s):  
Maximum Clique ◽  
Interval Graphs ◽  
Induced Subgraph ◽  
Graph Theoretic ◽  
Graph Classes ◽  
International Audience ◽  
Forbidden Induced Subgraph ◽  
Nested Hierarchy ◽  
Graph Families

International audience We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a graph-theoretic study of subgraphs of q-proper interval graphs with maximum clique size k+1 and give an equivalent characterization of these graphs by restricted path-decomposition. By allowing the parameter q to vary from 0 to k, we obtain a nested hierarchy of graph families, from graphs of bandwidth at most k to graphs of pathwidth at most k. Allowing both parameters to vary, we have an infinite lattice of graph classes ordered by containment.

scholarly journals Exponential bounds and tails for additive random recursive sequences

2007 ◽  
Vol Vol. 9 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Ludger Rüschendorf ◽  
Eva-Maria Schopp
Keyword(s):  
Analysis Of Algorithms ◽  
Sufficient Conditions ◽  
Random Trees ◽  
Divide And Conquer ◽  
Recursive Sequences ◽  
Recursive Structures ◽  
International Audience ◽  
Exponential Bounds ◽  
The Moment

Analysis of Algorithms International audience Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some classical exponential bounds and some variants of the induction method. The paper generalizes results of Rösler (% \citeyearNPRoesler:91, % \citeyearNPRoesler:92) and % \citeNNeininger:05 on subgaussian tails to more general classes of additive random recursive sequences. It also gives sufficient conditions for tail bounds of the form \exp(-a t^p) which are based on a characterization of \citeNKasahara:78.

scholarly journals An optimal cardinality estimation algorithm based on order statistics and its full analysis

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Jérémie Lumbroso
Keyword(s):  
Order Statistics ◽  
Estimation Algorithm ◽  
Fine Tuning ◽  
Simple Analysis ◽  
Relative Precision ◽  
Asymptotic Regime ◽  
Cardinality Estimation ◽  
International Audience ◽  
Full Analysis

International audience Building on the ideas of Flajolet and Martin (1985), Alon et al. (1987), Bar-Yossef et al. (2002), Giroire (2005), we develop a new algorithm for cardinality estimation, based on order statistics which, according to Chassaing and Gerin (2006), is optimal among similar algorithms. This algorithm has a remarkably simple analysis that allows us to take its $\textit{fine-tuning}$ and the $\textit{characterization of its properties}$ further than has been done until now. We prove that, asymptotically, it is $\textit{strictly unbiased}$ (contrarily to Probabilistic Counting, Loglog, Hyperloglog), we verify that its relative precision is about $1/\sqrt{m-2}$ when $m$ words of storage are used, and we fully characterize the limit law of the estimates it provides, in terms of gamma distribution―-this is the first such algorithm for which the limit law has been established. We also develop a Poisson analysis for the pre-asymptotic regime. In this way, we are able to devise a complete algorithm, covering all cardinalities ranges from $0$ to very large.

scholarly journals A Formula for the Möbius Function of the Permutation Poset Based on a Topological Decomposition

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Jason P Smith
Keyword(s):  
Significant Proportion ◽  
Möbius Function ◽  
Permutation Patterns ◽  
Mobius Function ◽  
International Audience ◽  
Definition Of ◽  
Object Of Study ◽  
Pattern Containment ◽  
Exponential Complexity ◽  
Exponential Part

International audience The poset P of all permutations ordered by pattern containment is a fundamental object of study in the field of permutation patterns. This poset has a very rich and complex topology and an understanding of its Möbius function has proved particularly elusive, although results have been slowly emerging in the last few years. Using a variety of topological techniques we present a two term formula for the Mo ̈bius function of intervals in P. The first term in this formula is, up to sign, the number of so called normal occurrences of one permutation in another. Our definition of normal occurrences is similar to those that have appeared in several variations in the literature on the Möbius function of this and other posets, but simpler than most of them. The second term in the formula is (still) complicated, but we conjecture that it equals zero for a significant proportion of intervals. We present some cases where the second term vanishes and others where it is nonzero. Computing the Möbius function recursively from its definition has exponential complexity, whereas the computation of the first term in our formula is polynomial and the exponential part is isolated to the second term, which seems to often vanish. This is thus the first polynomial time formula for the Möbius function of what appears to be a large proportion of all intervals of P.

scholarly journals Self-complementing permutations of k-uniform hypergraphs

2009 ◽  
Vol Vol. 11 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Artur Szymański ◽  
Adam Pawel Wojda
Keyword(s):  
Positive Integer ◽  
Uniform Hypergraph ◽  
Uniform Hypergraphs ◽  
Unique Integer ◽  
International Audience ◽  
Sigma E

Graphs and Algorithms International audience A k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it is isomorphic with its complement (H) over bar = ( V; ((V)(k)) - E). Every permutation sigma of the set V such that sigma(e) is an edge of (H) over bar if and only if e is an element of E is called self-complementing. 2-self-comlementary hypergraphs are exactly self complementary graphs introduced independently by Ringel ( 1963) and Sachs ( 1962). <br> For any positive integer n we denote by lambda(n) the unique integer such that n = 2(lambda(n)) c, where c is odd. <br> In the paper we prove that a permutation sigma of [1, n] with orbits O-1,..., O-m O m is a self-complementing permutation of a k-uniform hypergraph of order n if and only if there is an integer l >= 0 such that k = a2(l) + s, a is odd, 0 <= s <= 2(l) and the following two conditions hold: <br> (i)n = b2(l+1) + r,r is an element of {0,..., 2(l) - 1 + s}, and <br> (ii) Sigma(i:lambda(vertical bar Oi vertical bar)<= l) vertical bar O-i vertical bar <= r. <br> For k = 2 this result is the very well known characterization of self-complementing permutation of graphs given by Ringel and Sachs.

scholarly journals Solving equations over small unary algebras

2005 ◽  
Vol DMTCS Proceedings vol. AF,... (Proceedings) ◽  
Author(s):  
Przemyslaw Broniek
Keyword(s):  
Polynomial Time ◽  
Partial Characterization ◽  
Polynomial Equations ◽  
Solving Equations ◽  
International Audience ◽  
Np Complete ◽  
System Of Polynomial Equations

International audience We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras and give a partial characterization of complexity of MPolSat($A$). We isolate a preorder $P(A)$ to show that when $A$ has at most 3 elements then MPolSat($A$) is in $P$ when width of $P(A)$ is at most 2 and is NP-complete otherwise. We show also that if $P ≠ NP$ then the class of unary algebras solvable in polynomial time is not closed under homomorphic images.

scholarly journals Digital Trees and Memoryless Sources: from Arithmetics to Analysis

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Philippe Flajolet ◽  
Mathieu Roux ◽  
Brigitte Vallée
Keyword(s):  
Probabilistic Models ◽  
Asymptotic Form ◽  
Leader Election ◽  
Text Compression ◽  
Digital Trees ◽  
Arithmetic Properties ◽  
International Audience ◽  
Error Terms ◽  
Dynamic Hashing

International audience Digital trees, also known as $\textit{"tries''}$, are fundamental to a number of algorithmic schemes, including radix-based searching and sorting, lossless text compression, dynamic hashing algorithms, communication protocols of the tree or stack type, distributed leader election, and so on. This extended abstract develops the asymptotic form of expectations of the main parameters of interest, such as tree size and path length. The analysis is conducted under the simplest of all probabilistic models; namely, the $\textit{memoryless source}$, under which letters that data items are comprised of are drawn independently from a fixed (finite) probability distribution. The precise asymptotic structure of the parameters' expectations is shown to depend on fine singular properties in the complex plane of a ubiquitous $\textit{Dirichlet series}$. Consequences include the characterization of a broad range of asymptotic regimes for error terms associated with trie parameters, as well as a classification that depends on specific $\textit{arithmetic properties}$, especially irrationality measures, of the sources under consideration.

scholarly journals Plurality of Points of Views and knowing of a Plural Reality

2018 ◽  
Vol Épistémologies du pluriel (Articles) ◽  
Author(s):  
Claude Compagnone
Keyword(s):  
Knowledge Production ◽  
Point Of View ◽  
Social Nature ◽  
The Social ◽  
International Audience ◽  
Points Of View ◽  
The Relationship ◽  
Interactional Features ◽  
The Way

International audience El objetivo de éste artículo es dar cuenta de la manera por la cual las concepciones plurales de la realidad son inherentes al proceso de conocimiento. Asimismo, el artículo apunta a mostrar de qué manera los distintos puntos de vista de los actores sobre ésta realidad son social y materialmente situados. Apoyándose en el enfoque de J.-P. Darré , el neo-pragmatismo de H. Putnam, así como en los aportes de lingüistas y psicólogos, el presente trabajo ilumina la manera en la cual la relación entre realidad y conocimiento puede establecerse. El artículo destaca que la verdad depende de la adecuación del conocimiento a la realidad y pone en relieve las propiedades interactivas de las cosas. Finalmente, permite revelar la naturaleza social de las concepciones y discute, a partir de la noción de punto de vista de A. Schütz, la caracterización social de estos puntos de vista. The purpose of this article is to report the way in which the plural understandings of reality are inherent to the process of knowledge production. It alsoaims to show what it means that actors’ point of view are socially and materially situated. Relying on J.-P. Darré’s approach, Putnam’s pragmatism, as well as on linguists’ and psychologists’ works, it highlights how the relationship between reality and knowledge may be understood. It underlines that truth depends on the adequacy of knowledge to reality and emphasizes the interactional features of things. Then, it focuses on the social nature of understanding and discusses the social characterization of points of view, drawing on A. Schütz’s works. Le but de cet article est de rendre compte de la façon dont desconceptions plurielles de la réalité sont inhérentes au processus de connaissance.Il vise aussi à montrer comment on peut entendre que les points de vue des acteurs sur cette réalité sont socialement et objectivement situés. S’appuyant sur l’approche de J.-P. Darré, sur le néopragmatisme de H. Putnam, ainsi que sur les travaux de linguistes et de psychologues, il éclaircit la façon dont on peut entendre le rapport qui peut être établi entre réalité et connaissance. Il souligne que la vérité dépend de l’adéquation de la connaissance à la réalité et met en valeur les propriétés interactionnelles des choses. Il fait ensuite apparaître la nature sociale des conceptions et discute, à partir de la notion de point de vue de A. Schütz, de la caractérisation sociale de ces points de vue.

Sign in / Sign up

Export Citation Format

Share Document