Results 21 to 29 of about 210 (29)

Eulerian polynomials as moments, via exponential Riordan arrays [PDF]

open access: yes, 2011
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

1-Sylvester matrices

open access: yesSpecial Matrices
A nonzero element aa is called 1-Sylvester in a ring RR, if there exist b,c∈Rb,c\in R such that 1=ab+ca1=ab+ca. In this article, we study such elements, mainly in matrix rings over commutative rings.
Călugăreanu Grigore
doaj   +1 more source

Commutators and Anti-Commutators of Idempotents in Rings

open access: yes, 2018
We show that a ring $\,R\,$ has two idempotents $\,e,e'\,$ with an invertible commutator $\,ee'-e'e\,$ if and only if $\,R \cong {\mathbb M}_2(S)\,$ for a ring $\,S\,$ in which $\,1\,$ is a sum of two units. In this case, the "anti-commutator" $\,ee'+e'e\
Khurana, Dinesh, Lam, T. Y.
core   +1 more source

On (k1A1, k2A2, k3A3)-Edge Colourings in Graphs and Generalized Jacobsthal Numbers

open access: yesAnnales Mathematicae Silesianae
In this paper we introduce a new kind of generalized Jacobsthal numbers in a distance sense. We give the identities and matrix representations for them and their connections with the Fibonacci and the Pell numbers. We also describe the interpretations of
Piejko Krzysztof, Trojnar-Spelina Lucyna
doaj   +1 more source

The number of rational points of some classes of algebraic varieties over finite fields

open access: yesOpen Mathematics
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]

open access: yes
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

A library of lineage-specific driver lines connects developing neuronal circuits to behavior in the <i>Drosophila</i> ventral nerve cord. [PDF]

open access: yesElife
Soffers JHM   +11 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy