Results 1 to 10 of about 3,954,843 (144)
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 +4 more sources
Walking, weak first-order transitions, and complex CFTs
Journal of High Energy Physics, 2018 We discuss walking behavior in gauge theories and weak first-order phase transitions in statistical physics. Despite appearing in very different systems (QCD below the conformal window, the Potts model, deconfined criticality) these two phenomena both ...
Victor Gorbenko +2 more
doaj +5 more sources
Extending the weak order on Coxeter groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We introduce a new family of complete lattices, arising from a digraph together with a valuation on its vertices and generalizing a previous construction of the author.
Francois Viard
doaj +1 more source
The facial weak order in finite Coxeter groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate a poset structure that extends the weak order on a finite Coxeter group W to the set of all faces of the permutahedron of W. We call this order the facial weak order.
Aram Dermenjian +2 more
doaj +1 more source
Arc Permutations (extended abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. In this paper we describe combinatorial properties of these permutations, including characterizations in terms of pattern avoidance, connections to ...
Sergi Elizalde, Yuval Roichman
doaj +1 more source
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
Generalized Dyck tilings (Extended Abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The first goal of
Matthieu Josuat-Vergès, Jang Soo Kim
doaj +1 more source
How to get the weak order out of a digraph ? [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$$n-1$, $B$$n$, $Ã$$n$, and the flag weak order on the wreath ...
Francois Viard
doaj +1 more source
On the Topology of the Cambrian Semilattices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 For an arbitrary Coxeter group $W$, David Speyer and Nathan Reading defined Cambrian semilattices $C_{\gamma}$ as certain sub-semilattices of the weak order on $W$.
Myrto Kallipoliti, Henri Mühle
doaj +1 more source