Results 1 to 10 of about 882,841 (167)
Discrete Mathematics, 2004 Binary relations and associated polytopes are considered: facet-defining inequalities, vertex adjacency, symmetries, basic lifting lemma, and relations to probabilistic choice and preference aggregation.
P C Fishburn
exaly +3 more sources
Second-Order Weak Approximations of CKLS and CEV Processes by Discrete Random Variables
Mathematics, 2021 In this paper, we construct second-order weak split-step approximations of the CKLS and CEV processes that use generation of a three−valued random variable at each discretization step without switching to another scheme near zero, unlike other known ...
Gytenis Lileika, Vigirdas Mackevičius
doaj +3 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
Journal of Pure and Applied Algebra, 2021 arXiv admin note: text overlap with arXiv:1807 ...
Maria João Gouveia, Luigi Santocanale
openaire +4 more sources
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
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
The Canonical Complex of the Weak Order
Order, 2022 We define and study the canonical complex of a finite semidistributive lattice $L$. It is the simplicial complex on the join or meet irreducible elements of $L$ which encodes each interval of $L$ by recording the canonical join representation of its bottom element and the canonical meet representation of its top element.
Albertin, Doriann, Pilaud, Vincent
openaire +7 more sources