Results 41 to 50 of about 119 (92)

Efficacy and Field Safety of Ilunocitinib for the Control of Allergic Dermatitis in Client‐Owned Dogs: A Multicenter, Double‐Masked, Randomised, Placebo‐Controlled Clinical Trial

open access: yesVeterinary Dermatology, Volume 36, Issue 6, Page 825-837, December 2025.
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

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 8, Issue 4, Page 697-705, 1985., 1985
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

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 6, Issue 3, Page 521-533, 1983., 1983
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

Equivalence classes of functions on finite sets

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 5, Issue 4, Page 745-762, 1982., 1982
By using Pólya′s theorem of enumeration and de Bruijn′s generalization of Pólya′s theorem, we obtain the numbers of various weak equivalence classes of functions in RD relative to permutation groups G and H where RD is the set of all functions from a finite set D to a finite set R, G acts on D and H acts on R.
Chong-Yun Chao, Caroline I. Deisher
wiley   +1 more source

On the number of vertices of each rank in phylogenetic trees and their generalizations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2016
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

The permutation class Av(4213,2143) [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its ...
David Bevan
doaj   +1 more source

Proofs of Conjectures about Pattern-Avoiding Linear Extensions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation.
Colin Defant
doaj   +1 more source

Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of consecutive ...
Ioannis Michos, Christina Savvidou
doaj   +1 more source

Distribution of sets of descent tops and descent bottoms on restricted permutations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
In this note, we prove some and conjecture other results regarding the distribution of descent top and descent bottom sets on some pattern-avoiding permutations.
Alexander Burstein
doaj   +1 more source

Growing and Destroying Catalan-Stanley Trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers.
Benjamin Hackl, Helmut Prodinger
doaj   +1 more source

Home - About - Disclaimer - Privacy