Mario Marietti
Sapienza University of Rome
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Mario Marietti.
The Journal of Combinatorics | 2002
Mario Marietti
R -polynomials get their importance from the fact that they are used to define and compute the Kazhdan?Lusztig polynomials, which have applications in several fields. Here we give a closed product formula for certainR -polynomials valid for every Coxeter group. This result implies a conjecture due to F. Brenti about the symmetric groups.
International Mathematics Research Notices | 2006
Francesco Brenti; Fabrizio Caselli; Mario Marietti
A class of partially ordered sets called diamonds, that includes all Coxeter groups ordered by Bruhat order, is introduced. It is shown that the definition of Kazhdan- Lusztig polynomials can be generalized to the framework of diamonds and that they can be used to construct a family of Hecke algebra representations that includes those constructed by Kazhdan and Lusztig and contains several new ones.
Discrete Mathematics | 2006
Fabrizio Caselli; Mario Marietti
We give explicit formulas for several classes of Kazhdan-Lusztig polynomials of the symmetric group which are related to others already considered in the literature. In particular, we generalize two theorems of Brenti and Simion [Explicit formulae for some Kazhdan-Lusztig polynomials, J. Algebraic Combin. 11 (2000) 187-196], we prove an unpublished conjecture of Brenti, and we treat the case missing in Theorem 4.8 of F. Caselli [Proof of two conjectures of Brenti and Simion on Kazhdan-Lusztig polynomials, J. Algebraic Combin. 18 (2003) 171-187].
European Journal of Combinatorics | 2012
Mario Marietti; D. Testa
We introduce and study the notions of conical and spherical graphs. We show that these mutually exclusive properties, which have a geometric interpretation, provide links between apparently unrelated classical concepts such as dominating sets, independent dominating sets, edge covers, and the homotopy type of an associated simplicial complex. In particular, we solve the problem of characterizing the forests whose dominating sets of minimum cardinality are also independent. To establish these connections, we prove a formula to compute the Euler characteristic of an arbitrary simplicial complex from a set of generators of its Stanley-Reisner ideal.
European Journal of Combinatorics | 2008
Mario Marietti
In [R.P. Stanley, The descent set and connectivity set of a permutation, J. Integer Seq. 8 (3) (2005) Article 05.3.8] Stanley gives certain enumerative identities revealing a duality between descent sets and connectivity sets of the symmetric group. In this paper we generalize these identities to all Coxeter groups. The proofs are obtained by giving these identities an algebraic explanation in terms of parabolic subgroups, coset representatives, and Poincare series, and by a formal argument in terms of inclusion-exclusion-like matrices.
Advances in Mathematics | 2006
Francesco Brenti; Fabrizio Caselli; Mario Marietti
Discrete and Computational Geometry | 2008
Mario Marietti; D. Testa
Journal of Algebra | 2006
Mario Marietti
Journal of Algebraic Combinatorics | 2007
Mario Marietti
Electronic Journal of Combinatorics | 2008
Mario Marietti; D. Testa