Results 1 to 10 of about 39 (32)

Continuants with Equal Values, a Combinatorial Approach [PDF]

open access: yesWords, 2021
A regular continuant is the denominator K of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard K as a function defined on the set of all finite words on the alphabet 1 < 2 < 3 < . . .
G. Ramharter, L. Zamboni
semanticscholar   +1 more source

Refined ratio monotonicity of the coordinator polynomials of the root lattice of type Bn

open access: yesOpen Mathematics, 2023
Ratio monotonicity, a property stronger than both log-concavity and the spiral property, describes the behavior of the coefficients of many classical polynomials.
Su Xun-Tuan, Sun Fan-Bo
doaj   +1 more source

A combinatorial proof of the Gaussian product inequality beyond the MTP2 case

open access: yesDependence Modeling, 2022
A combinatorial proof of the Gaussian product inequality (GPI) is given under the assumption that each component of a centered Gaussian random vector X=(X1,…,Xd){\boldsymbol{X}}=\left({X}_{1},\ldots ,{X}_{d}) of arbitrary length can be written as a ...
Genest Christian, Ouimet Frédéric
doaj   +1 more source

Extermal properties of Zagreb coindices and degree distance of graphs

open access: yes, 2010
The degree distance, Zagreb coindices and reverse degree distance of a connected graph have been studied in mathematical chemistry. In this paper some new extremal values of these topological invariants over some special classes of graphs are determined.
S. Hossein-Zadeh, A. Hamzeh, A. Ashrafi
semanticscholar   +1 more source

The log-concavity of the q-derangement numbers of type B

open access: yesOpen Mathematics, 2018
Recently, Chen and Xia proved that for n ≥ 6, the q-derangement numbers Dn(q) are log-concave except for the last term when n is even. In this paper, employing a recurrence relation for DnB(q) $\begin{array}{} \displaystyle D^B_n(q) \end{array ...
Liu Eric H., Du Wenjing
doaj   +1 more source

Proof of a monotonicity conjecture

open access: yes, 2018
Bennett gave a generalization of Schur’s theorem to study various moment-preserving transformations. In this paper, we confirm a monotonicity conjecture of Bennett which is related to the generalized Schur’s theorem and Haber’s inequality.
Xun-Tuan Su
semanticscholar   +1 more source

The hyperbolicity constant of infinite circulant graphs

open access: yesOpen Mathematics, 2017
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj   +1 more source

GA2 index of some graph operations

open access: yes, 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.
G. Fath-Tabar   +2 more
semanticscholar   +1 more source

The convexity and the concavity derived from Newton's inequality

open access: yes, 2012
By Newton’s inequality, a sequence {ai}i=0 of nonnegative real numbers is unimodal if its generating function ∑i=0 aix has only real zeros. This paper is devoted to show that there exist two indices s and t with s t , such that a0,a1, . . .
Xun-Tuan Su, Wei-Wei Zhang
semanticscholar   +1 more source

ORDER MATTERS WHEN CHOOSING SETS

open access: yes, 2011
Given natural numbers t, w and v we show, using high school algebra, that if 1 ≤ w ≤ t < v then ((v ch t) ch w) ≤ ((v ch w) ch t). Here we denote “n choose r” by (n ch r). AMS (2002) subject classification: Primary 05A20; Secondary 05A05, 94A60.
W. Moors, Julia Novak
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy