Results 51 to 60 of about 219 (161)
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
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
Topological recursion for fully simple maps from ciliated maps [PDF]
We solve a conjecture from the first and third authors that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy topological recursion for the exchanged spectral curve \((y, x)\), making use of the ...
Garcia-Failde, Elba +5 more
core +1 more source
Exact enumeration of satisfiable 2-SAT formulae [PDF]
We obtain exact expressions counting the satisfiable 2-SAT formulae and describe the structure of associated implication digraphs. Our approach is based on generating function manipulations.
Dovgal, Sergey +2 more
core +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
GA2 index of some graph operations
Let G = (V, E) be a graph. For e = uv ? E(G), nu (e) is the number of vertices of G lying closer to u than to v and nv (e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ?uv?E(G) 2?
G.H. Fath-Tabar +2 more
core +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
Proof of a bi-symmetric septuple equidistribution on ascent sequences [PDF]
It is well known since the seminal work by Bousquet-Mélou, Claesson, Dukes and Kitaev (2010) that certain refinements of the ascent sequences with respect to several natural statistics are in bijection with corresponding refinements of \(({\bf2+2 ...
Jin, Emma Yu, Schlosser, Michael J.
core +1 more source
. We study the descent distribution over the set of centrosymmetric permutations that avoid a pattern of length 3. In the most puzzling case, namely, τ = 123 and n even, our main tool is a bijection that associates a Dyck pre x of length 2n to every ...
Marilena Barnabei +2 more
core

