Results 41 to 50 of about 2,076 (116)
Variants of Schroeder Dissections [PDF]
Some formulae are given for the enumeration of certain types of dissections of the convex (n+2)-gon by non-crossing diagonals. The classical Schroeder and Motzkin numbers are addressed using a cataloguing tool, the "reversive symbol".
Smiley, Leonard M.
core
An infinite version of the Pólya enumeration theorem
Using measure theory, the orbit counting form of Pólya′s enumeration theorem is extended to countably infinite discrete groups.
Robert A. Bekes
wiley +1 more source
Conditional Probabilities of Multivariate Poisson Distributions [PDF]
Multivariate Poisson distributions have numerous applications. Fast computation of these distributions, holding constant a fixed set of linear combinations of these variables, has been explored by Sontag and Zeilberger.
Burkhart, Michael C.
core
Background: Gabapentin reportedly decreases central sensitisation, a disorder associated with chronic pruritus in humans, although this is not well documented in cats. Its combined use with the standard antipruritic therapy for feline atopic skin syndrome (FASS) is not yet described.
Jeanne Morency +10 more
wiley +1 more source
On Hilbert polynomial of certain determinantal ideals
Let X = (Xij) be an m(1) by m(2) matrix whose entries Xij, 1 ≤ i ≤ m(1), 1 ≤ j ≤ m(2); are indeterminates over a field K. Let K[X] be the polynomial ring in these m(1)m(2) variables over K. A part of the second fundamental theorem of Invariant Theory says that the ideal I[p + 1] in K[X], generated by (p + 1) by (p + 1) minors of X is prime.
Shrinivas G. Udpikar
wiley +1 more source
Background: Inhibition of the Janus kinase pathway is an established treatment for allergic dermatitis. Objective: To evaluate the efficacy and safety of ilunocitinib for control of pruritus in dogs with allergic dermatitis in a randomised, double‐masked clinical trial.
Sophie Forster +5 more
wiley +1 more source
On coefficients of circuit polynomials and characteristic polynomials
Results are given from which expressions for the coefficients of the simple circuit polynomial of a graph can be obtained in terms of subgraphs of the graph. From these are deduced parallel results for the coefficients of the characteristic polynomial of a graph.
E. J. Farrell
wiley +1 more source
Path decompositions of chains and circuits
Expressions for the path polynomials (see Farrell [1]) of chains and circuits are derived. These polynomials are then used to deduce results about node disjoint path decompositions of chains and circuits. Some results are also given for decompositions in which specific paths must be used.
E. J. Farrell
wiley +1 more source
On the number of vertices of each rank in phylogenetic trees and their generalizations [PDF]
We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.
Miklós Bóna
doaj +1 more source
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs [PDF]
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor.
Friedland, Shmuel, Levy, Daniel
core +1 more source

