Results 11 to 20 of about 882,940 (266)
A lattice on decreasing trees : the metasylvester lattice [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We introduce a new combinatorial structure: the metasylvester lattice on decreasing trees. It appears in the context of the $m$-Tamari lattices and other related $m$-generalizations.
Viviane Pons
doaj +1 more source
Noncrossing partitions and the shard intersection order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We define a new lattice structure (W,\preceq ) on the elements of a finite Coxeter group W. This lattice, called the \emphshard intersection order, is weaker than the weak order and has the noncrossing partition lattice \NC (W) as a sublattice.
Nathan Reading
doaj +1 more source
The Facial Weak Order on Hyperplane Arrangements [PDF]
Discrete & Computational Geometry, 2021 We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent definitions of the facial weak order of a central arrangement: (1) by exploiting the fact that the faces are intervals in
Aram Dermenjian +3 more
openaire +4 more sources
Weak bisimulation for coalgebras over order enriched monads [PDF]
Logical Methods in Computer Science, 2015 The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose ...
Tomasz Brengos
doaj +1 more source
Weak order on complete quadrics [PDF]
Transactions of the American Mathematical Society, 2013 Using an action of the Richardson-Springer monoid on involutions, we study the weak order on the variety of complete quadrics. Maximal chains in the poset are explicitly determined. Applying results of Brion, our calculations describe certain cohomology classes in the complete flag variety.
Can, Mahir Bilen, Joyce, Michael
openaire +3 more sources
Universal Cycles for Weak Orders [PDF]
SIAM Journal on Discrete Mathematics, 2013 12 pages; final ...
Victoria Horan, Glenn Hurlbert
openaire +2 more sources
Weak-order extensions of an order
Theoretical Computer Science, 1997 In this paper, at first we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we prove that the number of weak-order extensions of a
Bertet, Karell +2 more
openaire +4 more sources
The Weak Order on Weyl Posets [PDF]
Canadian Journal of Mathematics, 2019 AbstractWe define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice induced by antisymmetric closed subsets of roots is again a lattice.
Gay, Joël, Pilaud, Vincent
openaire +3 more sources
Local Convergence for Multi-Step High Order Solvers under Weak Conditions
Mathematics, 2020 Our aim in this article is to suggest an extended local convergence study for a class of multi-step solvers for nonlinear equations valued in a Banach space.
Ramandeep Behl, Ioannis K. Argyros
doaj +1 more source
Lattice Congruences of the Weak Order [PDF]
Order, 2004 We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric description of the poset of join-irreducibles of the congruence lattice of the poset of regions in terms of certain ...
openaire +3 more sources