Results 21 to 30 of about 1,385 (101)
Cutoff for the Transposition Walk on Permutations with One-Sided Restrictions [PDF]
, 2012 This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of order smaller ...
Blumberg, Olena
core
The rook numbers of Ferrers boards and the related restricted permutation numbers
Journal of Statistical Planning and Inference, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Optimal softening for force calculations in collisionless N-body simulations
, 1999 In N-body simulations the force calculated between particles representing a given mass distribution is usually softened, to diminish the effect of graininess. In this paper we study the effect of such a smoothing, with the aim of finding an optimal value
Athanassoula, E. +3 more
core +1 more source
The inverse rook problem on Ferrers boards
, 2004 Rook polynomials have been studied extensively since 1946, principally as a method for enumerating restricted permutations. However, they have also been shown to have many fruitful connections with other areas of mathematics, including graph theory, hypergeometric series, and algebraic geometry.
openaire +2 more sources
Media – the Video Appeals Committee [PDF]
, 1999 Review of the work of the Video Appeals Committee which hears appeals from makers of videos from decisions of the British Board of Film Classification, to refuse certificates or to grant certificates in respect of videos works, with which they disagree ...
Wood, John
core
Enumerative properties of Ferrers graphs
, 2007 We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial, and the chromatic symmetric function ...
Ehrenborg, Richard +1 more
core +2 more sources
Intersection representation of digraphs in trees with few leaves
, 1997 The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string of sharp ...
Lin, In-Jen +2 more
core +2 more sources
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Citation analysis of the 100 top-cited articles on discectomy via endoscopy since 2011 using alluvial diagrams: bibliometric analysis. [PDF]
Eur J Med Res, 2022 Yeh CH, Chien TW, Chou PH.
europepmc +1 more source