Related papers: Circular Hessenberg Pairs
We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $1$. Even more, we consider Toeplitz matrices of this kind. Many…
The hexagonal tiling honeycomb is a beautiful structure in 3-dimensional hyperbolic space. It is called {6,3,3} because each hexagon has 6 edges, 3 hexagons meet at each vertex in a Euclidean plane tiled by regular hexagons, and 3 such…
We address the issue of establishing standard forms for nonnegative and Metzler matrices by considering their similarity to nonnegative and Metzler Hessenberg matrices. It is shown that for dimensions $n \geq 3$, there always exists a…
A matrix is called Bohemian if its entries are sampled from a finite set of integers. We determine the maximum absolute determinant of upper Hessenberg Bohemian Matrices for which the subdiagonal entries are fixed to be $1$ and upper…
In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of parameters for the coordinate rings of these two sets and their…
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using…
In this paper we introduce a certain class of families of Hessenberg varieties arising from Springer theory for symmetric spaces. We study the geometry of those Hessenberg varieties and investigate their monodromy representations in detail…
The asymmetric tetrahedron is composed by all edges of tetrahedron represented by Ising interaction except one, which has a Heisenberg type interaction. This asymmetric tetrahedron is arranged connecting a vertex which edges are only Ising…
Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…
Let $V$ denote a vector space with finite positive dimension. We consider a pair of linear transformations $A : V \to V$ and $A^* : V \to V$ that satisfy (i) and (ii) below: (i) There exists a basis for $V$ with respect to which the matrix…
An Hadamard matrix is a square matrix $H\in M_N(\pm1)$ whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices $H\in M_N(\mathbb C)$ whose entries are on the unit…
Let $V$ denote a nonzero finite-dimensional vector space. A tridiagonal pair on $V$ is an ordered pair $A, A^*$ of maps in ${\rm End}(V)$ such that (i) each of $A, A^*$ is diagonalizable; (ii) there exists an ordering $\lbrace V_i…
A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and…
We give an explicit family of polynomial maps called center unstable H\'enon-like maps and prove that they exhibits blenders for some parametervalues. Using this family, we also prove the occurrence of blenders near certain non-transverse…
A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…
Given a semisimple complex linear algebraic group $G$ and a lower ideal $I$ in positive roots of $G$, three objects arise: the ideal arrangement $\mathcal{A}_I$, the regular nilpotent Hessenberg variety $\mbox{Hess}(N,I)$, and the regular…
We study a collection of Hessenberg varieties in the type A flag variety associated to a nonzero semisimple matrix whose conjugacy class has minimal dimension. We prove each such minimal semisimple Hessenberg variety is a union Richardson…
A tridiagonal pair is an ordered pair of diagonalizable linear maps on a nonzero finite-dimensional vector space, that each act on the eigenspaces of the other in a block-tridiagonal fashion. We consider a tridiagonal pair $(A, A^*)$ of…
A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…