Page 1 Next

Displaying 1 – 20 of 32

Showing per page

Circulants and the factorization of the Fibonacci–like numbers

Jaroslav Seibert, Pavel Trojovský (2006)

Acta Mathematica Universitatis Ostraviensis

Several authors gave various factorizations of the Fibonacci and Lucas numbers. The relations are derived with the help of connections between determinants of tridiagonal matrices and the Fibonacci and Lucas numbers using the Chebyshev polynomials. In this paper some results on factorizations of the Fibonacci–like numbers U n and their squares are given. We find the factorizations using the circulant matrices, their determinants and eigenvalues.

Combinatorial aspects of code loops

Petr Vojtěchovský (2000)

Commentationes Mathematicae Universitatis Carolinae

The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction and prove...

Combinatorial bases of modules for affine Lie algebra B 2(1)

Mirko Primc (2013)

Open Mathematics

We construct bases of standard (i.e. integrable highest weight) modules L(Λ) for affine Lie algebra of type B 2(1) consisting of semi-infinite monomials. The main technical ingredient is a construction of monomial bases for Feigin-Stoyanovsky type subspaces W(Λ) of L(Λ) by using simple currents and intertwining operators in vertex operator algebra theory. By coincidence W(kΛ0) for B 2(1) and the integrable highest weight module L(kΛ0) for A 1(1) have the same parametrization of combinatorial bases...

Currently displaying 1 – 20 of 32

Page 1 Next