Results 61 to 70 of about 225 (160)
On Some Identities for k-Jacobsthal Numbers [PDF]
, 2013 The aim of this paper is to obtain Binet formula for k-Jacobsthal numbers. And also with the help of Binet formula we obtain some properties for the k-Jacobsthal numbers.
core
Veterinary Dermatology, Volume 36, Issue 6, Page 814-824, December 2025.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
International Journal of Mathematics and Mathematical Sciences, Volume 14, Issue 1, Page 155-162, 1991., 1989 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
Veterinary 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
GA2 index of some graph operations
, 2010 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 a generalization of derangement polynomials and numbers
Demonstratio MathematicaIn T. Kim, D. S. Kim, and D. V. Dolgy, Probabilistic derangement numbers and polynomials, Math. Comput. Model. Dyn. Syst. 31 (2025), no. 1, 2529188, Kim-Kim defined the probabilistic derangement polynomials and numbers and found some properties of those ...
Yun Sang Jo, Park Jin-Woo
doaj +1 more source
Symmetric edge polytopes and matching generating polynomials [PDF]
, 2021 Symmetric edge polytopes \(\mathcal{A}_G\) of type A are lattice polytopes arising from the root system \(A_n\) and finite simple graphs \(G\). There is a connection between \(\mathcal{A}_G\) and the Kuramoto synchronization model in physics.
Ohsugi, Hidefumi +4 more
core +1 more source
Fibonacci Cartan and Lucas Cartan numbers
Open MathematicsThis study introduces Fibonacci Cartan and Lucas Cartan numbers, extending the classical Fibonacci and Lucas sequences into the framework of Cartan numbers.
Öztürk İskender, Çakır Hasan
doaj +1 more source
On the number of vertices of each rank in phylogenetic trees and their generalizations [PDF]
Discrete 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
, 2009 . 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