EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 21 – 40 of 63

The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles

Ashkan Nikeghbali, Dirk Zeindler (2013)

Annales de l'I.H.P. Probabilités et statistiques

The goal of this paper is to analyse the asymptotic behaviour of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens measure. We combine tools from combinatorics and complex analysis (e.g. singularity analysis of generating functions) to prove that under some analytic conditions (on relevant generating functions) the cycle process converges to a vector of independent Poisson variables...

The hive model and the factorisation of Kostka coefficients.

King, Ronald C., Tollu, Christophe, Toumazet, Frédéric (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

The hive model and the polynomial nature of stretched Littlewood-Richardson coefficients.

King, Ronald C., Tollu, Christophe, Toumazet, Frédéric (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

The hook fusion procedure.

Grime, James (2005)

The Electronic Journal of Combinatorics [electronic only]

The hyperharmonic numbers and the phratry of the coupon collector. (Les nombres hyperharmoniques et la fratrie du collectionneur de vignettes.)

Foata, Dominique, Han, Guo-Niu, Lass, Bodo (2001)

Séminaire Lotharingien de Combinatoire [electronic only]

The hyperplanes of $DW (5, 2)$ .

Pralle, Harm (2005)

Experimental Mathematics

The integer sequence A002620 and upper antagonistic functions.

Speed, Sam E. (2003)

Journal of Integer Sequences [electronic only]

The Littlewood-Richardson rule - the cornerstone for computing group properties

B. G. Wybourne (1990)

Banach Center Publications

The major counting of nonintersecting lattice paths and generating functions for tableaux. (Summary).

Krattenthaler, C. (1992)

Séminaire Lotharingien de Combinatoire [electronic only]

The matching polynomial of a distance-regular graph.

Beezer, Robert A., Farrell, E.J. (2000)

International Journal of Mathematics and Mathematical Sciences

The maximum distinguishing number of a group.

Chan, Melody (2006)

The Electronic Journal of Combinatorics [electronic only]

The maximum size of a partial spread in $H (4 n + 1, q^{2})$ is $q^{2 n + 1} + 1$ .

Vanhove, Frédéric (2009)

The Electronic Journal of Combinatorics [electronic only]

The multiplicities of a dual-thin $Q$ -polynomial association scheme.

Sagan, Bruce E., Caughman, John S.IV (2001)

The Electronic Journal of Combinatorics [electronic only]

The nonexistence of regular near octagons with parameters $(s, t, t_{2}, t_{3}) = (2, 24, 0, 8)$ .

De Bruyn, Bart (2010)

The Electronic Journal of Combinatorics [electronic only]

The number of complete exceptional sequences for a Dynkin algebra

Mustafa Obaid, Khalid Nauman, Wafa S. M. Al-Shammakh, Wafaa Fakieh, Claus Michael Ringel (2013)

Colloquium Mathematicae

The Dynkin algebras are the hereditary artin algebras of finite representation type. The paper determines the number of complete exceptional sequences for any Dynkin algebra. Since the complete exceptional sequences for a Dynkin algebra of Dynkin type Δ correspond bijectively to the maximal chains in the lattice of non-crossing partitions of type Δ, the calculations presented here may also be considered as a categorification of the corresponding result for non-crossing partitions.

The number of indecomposable Schur rings over a cyclic 2-group.

Kovács, István (2004)

Séminaire Lotharingien de Combinatoire [electronic only]

The number of ribbon Schur functions.

Rubey, Martin (2010)

Séminaire Lotharingien de Combinatoire [electronic only]

The $\circ$ operation and $*$ operation of Cohen-Macaulay bipartite graphs

Yulong Yang, Guangjun Zhu, Yijun Cui, Shiya Duan (2024)

Czechoslovak Mathematical Journal

Let $G$ be a finite simple graph with the vertex set $V$ and let $I_{G}$ be its edge ideal in the polynomial ring $S = 𝕂 [V]$ . We compute the depth and the Castelnuovo-Mumford regularity of $S / I_{G}$ when $G = G_{1} \circ G_{2}$ or $G = G_{1} * G_{2}$ is a graph obtained from Cohen-Macaulay bipartite graphs $G_{1}$ , $G_{2}$ by the $\circ$ operation or $*$ operation, respectively.

The permutation classes equinumerous to the smooth class.

Bóna, Miklós (1998)

The Electronic Journal of Combinatorics [electronic only]

The plethysm $s_{λ} [s_{μ}]$ at hook and near-hook shapes.

Langley, T. M., Remmel, J. B. (2004)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 21 – 40 of 63

Previous Page 2 Next