Results 21 to 29 of about 205 (29)
Fibonacci and Telephone Numbers in Extremal Trees
In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particular we determine the successive extremal graphs in the class of trees with respect to the number of (A, 2B)-edge colourings.
Bednarz Urszula, Włoch Iwona
doaj +1 more source
Alternative proofs of some formulas for two tridiagonal determinants
In the paper, the authors provide five alternative proofs of two formulas for a tridiagonal determinant, supply a detailed proof of the inverse of the corresponding tridiagonal matrix, and provide a proof for a formula of another tridiagonal determinant.
Qi Feng, Liu Ai-Qi
doaj +1 more source
Eulerian polynomials as moments, via exponential Riordan arrays [PDF]
Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the "descending power" Eulerian polynomials, and their once shifted sequence, are moment sequences for simple families of orthogonal polynomials, which we ...
Barry, Paul
core +3 more sources
Rationality of the zeta function of the subgroups of abelian $p$-groups
Given a finite abelian $p$-group $F$, we prove an efficient recursive formula for $\sigma_a(F)=\sum_{\substack{H\leq F}}|H|^a$ where $H$ ranges over the subgroups of $F$.
Ramaré, Olivier
core +2 more sources
Small-span Hermitian matrices over quadratic integer rings
Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian matrix over ...
Greaves, Gary
core +1 more source
The number of rational points of some classes of algebraic varieties over finite fields
Let Fq{{\mathbb{F}}}_{q} be the finite field of characteristic pp and Fq*=Fq\{0}{{\mathbb{F}}}_{q}^{* }\left={{\mathbb{F}}}_{q}\backslash \left\{0\right\}.
Zhu Guangyan+3 more
doaj +1 more source
The Maximum Order of Reduced Square(0, 1)-Matrices with a Given Rank [PDF]
We look for the maximum order of a square (0, 1)-matrix A with a fixed rank r, provided A has no repeated rows or columns. If A is the adjacency matrix of a graph, Kotlov and Lovász [J. Graph Theory 23, 1996] proved that the maximum order equals Θ(2r/2).
Haemers, W.H., Peeters, M.J.P.
core +1 more source
Monotonicity of the number of positive entries in nonnegative matrix powers. [PDF]
Xie Q.
europepmc +1 more source
A library of lineage-specific driver lines connects developing neuronal circuits to behavior in the <i>Drosophila</i> ventral nerve cord. [PDF]
Soffers JHM+11 more
europepmc +1 more source