Möbius function and characteristic monomials for combinatorial enumeration

1999 ◽  
Vol 101 (6) ◽  
pp. 409-420 ◽  
Author(s):  
Shinsaku Fujita
Keyword(s):  
Möbius Function ◽  
Combinatorial Enumeration ◽  
Mobius Function

ADJACENCY AND DEGREE OF GRAPH OF MOBIUS FUNCTION

2016 ◽  
Vol 5 (1) ◽  
pp. 31
Author(s):  
SRIMITRA K.K ◽  
BHARATHI D ◽  
SAJANA SHAIK ◽  
◽  
◽  
...  
Keyword(s):  
Möbius Function ◽  
Mobius Function

scholarly journals Enumerative Combinatorics of Intervals in the Dyck Pattern Poset

Order ◽  
2021 ◽  
Author(s):  
Antonio Bernini ◽  
Matteo Cervetti ◽  
Luca Ferrari ◽  
Einar Steingrímsson
Keyword(s):  
Möbius Function ◽  
Dyck Path ◽  
Enumerative Combinatorics ◽  
Closed Expression ◽  
Mobius Function ◽  
First Results ◽  
Two Peaks

AbstractWe initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations. In most of the cases, we are also able to refine our formulas by rank. We also provide the first results on the Möbius function of the Dyck pattern poset, giving for instance a closed expression for the Möbius function of initial intervals whose maximum is a Dyck path having exactly two peaks.

Matchings and Radon transforms in lattices II. Concordant sets

1987 ◽  
Vol 101 (2) ◽  
pp. 221-231 ◽  
Author(s):  
Joseph P. S. Kung
Keyword(s):  
Incidence Matrix ◽  
Finite Lattice ◽  
Möbius Function ◽  
Radon Transforms ◽  
Modular Lattices ◽  
Covering Theorem ◽  
Mobius Function ◽  
Finite Lattices ◽  
Semimodular Lattices

AbstractLet and ℳ be subsets of a finite lattice L. is said to be concordant with ℳ if, for every element x in L, either x is in ℳ or there exists an element x+ such that (CS1) the Möbius function μ(x, x+) ≠ 0 and (CS2) for every element j in , x ∨ j ≠ x+. We prove that if is concordant with ℳ, then the incidence matrix I(ℳ | ) has maximum possible rank ||, and hence there exists an injection σ: → ℳ such that σ(j) ≥ j for all j in . Using this, we derive several rank and covering inequalities in finite lattices. Among the results are generalizations of the Dowling-Wilson inequalities and Dilworth's covering theorem to semimodular lattices, and a refinement of Dilworth's covering theorem for modular lattices.

scholarly journals On Complex Explicit Formulae Connected with the Möbius Function of an Elliptic Curve

2014 ◽  
Vol 57 (2) ◽  
pp. 381-389
Author(s):  
Adrian Łydka
Keyword(s):  
Functional Equation ◽  
Meromorphic Function ◽  
Elliptic Curve ◽  
Explicit Formula ◽  
Half Plane ◽  
Complex Plane ◽  
Möbius Function ◽  
Mobius Function ◽  
Upper Half Plane ◽  
Explicit Formulae

AbstractWe study analytic properties function m(z, E), which is defined on the upper half-plane as an integral from the shifted L-function of an elliptic curve. We show that m(z, E) analytically continues to a meromorphic function on the whole complex plane and satisfies certain functional equation. Moreover, we give explicit formula for m(z, E) in the strip |ℑz| < 2π.

scholarly journals A natural proof of the cyclotomic identity

1990 ◽  
Vol 42 (2) ◽  
pp. 185-189 ◽  
Author(s):  
D.E. Taylor
Keyword(s):  
Natural Isomorphism ◽  
Möbius Function ◽  
Mobius Function ◽  
Image Position

The cyclotomic identitywhere and μ is the classical Möbius function, is shown to be a consequence of a natural isomorphism of species.

scholarly journals How to get the weak order out of a digraph ?

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Francois Viard
Keyword(s):  
Wreath Product ◽  
Symmetric Function ◽  
Coxeter Groups ◽  
Symmetric Functions ◽  
Weak Order ◽  
Möbius Function ◽  
Mobius Function ◽  
Acyclic Digraph ◽  
International Audience

International audience 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$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, and the flag weak order on the wreath product &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduced by Adin, Brenti and Roichman (2012), are special instances of our construction. We conclude by briefly explaining how to use our work to define quasi-symmetric functions, with a special emphasis on the $A$<sub>$n-1$</sub> case, in which case we obtain the classical Stanley symmetric function. On construit une famille d’ensembles ordonnés à partir d’un graphe orienté, simple et acyclique munit d’une valuation sur ses sommets, puis on calcule les valeurs de leur fonction de Möbius respective. On montre que l’ordre faible sur les groupes de Coxeter $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, ainsi qu’une variante de l’ordre faible sur les produits en couronne &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduit par Adin, Brenti et Roichman (2012), sont des cas particuliers de cette construction. On conclura en expliquant brièvement comment ce travail peut-être utilisé pour définir des fonction quasi-symétriques, en insistant sur l’exemple de l’ordre faible sur $A$<sub>$n-1$</sub> où l’on obtient les séries de Stanley classiques.

scholarly journals The Möbius function of PSU(3, 2^{2^n})

2019 ◽  
Vol 16 (2) ◽  
pp. 377-401 ◽  
Author(s):  
Giovanni Zini
Keyword(s):  
Möbius Function ◽  
Mobius Function
Sign in / Sign up

Export Citation Format

Share Document