The notion of designs in Grassmannian spaces was introduced by the author and R. Coulangeon, G. Nebe, in [3]. After having recalled some basic properties of these objects and the connections with the theory of lattices, we prove that the sequence of Barnes-Wall lattices hold $6$-Grassmannian designs. We also discuss the connections between the notion of Grassmannian design and the notion of design associated with the symmetric space of the totally isotropic subspaces in a binary quadratic space, which...

This is a survey of recent results concerning (integer) matrices whose leading principal minors are well-known sequences such as Fibonacci, Lucas, Jacobsthal and Pell (sub)sequences. There are different ways for constructing such matrices. Some of these matrices are constructed by homogeneous or nonhomogeneous recurrence relations, and others are constructed by convolution of two sequences. In this article, we will illustrate the idea of these methods by constructing some integer matrices of this...

Dati $m=2$ o $m=3$ numeri algebrici non nulli $\alpha =\left({\alpha }_1,\mathrm{\dots },{\alpha }_m\right)$ tali che ${\alpha }_j/{\alpha }_l$ non è una radice dell'unità per ogni $j\ne l$ , consideriamo una classe di determinanti di Vandermonde generalizzati di ordine quattro $G\left(a;x\right)$, al variare di $x$ in ${\mathbb{Z}}^4$ , connessa con alcuni problemi diofantei. Dimostriamo che il numero delle soluzioni $y\in {\mathbb{Z}}^3$ in posizione generica dell'equazione polinomiale-esponenziale disomogenea $G\left(a;0,y\right)=0$ non supera una costante esplicita $N\left(d\right)$ dipendente solo da $d=\left[\mathbb{Q}\right(\alpha {}_1,\mathrm{\dots },\alpha {}_m):\mathbb{Q}]$.

Let ℱn = circ (︀F*1 , F*2, . . . , F*n︀ be the n×n circulant matrix associated with complex Fibonacci numbers F*1, F*2, . . . , F*n. In the present paper we calculate the determinant of ℱn in terms of complex Fibonacci numbers. Furthermore, we show that ℱn is invertible and obtain the entries of the inverse of ℱn in terms of complex Fibonacci numbers.

Let $S=\{x_1,\cdots ,x_n\}$ be a finite subset of a partially ordered set $P$. Let $f$ be an incidence function of $P$. Let $\left[f(x_i\wedge x_j)\right]$ denote the $n\times n$ matrix having $f$ evaluated at the meet $x_i\wedge x_j$ of $x_i$ and $x_j$ as its $i,j$-entry and $\left[f(x_i\vee x_j)\right]$ denote the $n\times n$ matrix having $f$ evaluated at the join $x_i\vee x_j$ of $x_i$ and $x_j$ as its $i,j$-entry. The set $S$ is said to be meet-closed if $x_i\wedge x_j\in S$ for all $1\le i,j\le n$. In this paper we get explicit combinatorial formulas for the determinants of matrices $\left[f(x_i\wedge x_j)\right]$ and $\left[f(x_i\vee x_j)\right]$ on any meet-closed set $S$. We also obtain necessary and sufficient conditions for the matrices...

The aim of this paper is to study determinants of matrices related to the Pascal triangle.