English
Related papers

Related papers: On a family of tridiagonal matrices

200 papers

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

In this paper we consider some aspects of tridiagonal, non self-adjoint, Hamiltonians and of their supersymmetric counterparts. In particular, the problem of factorization is discussed, and it is shown how the analysis of the eigenstates of…

Mathematical Physics · Physics 2019-09-04 F. Bagarello , F. Gargano , F. Roccati

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…

Combinatorics · Mathematics 2026-01-08 Or Raz

We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…

Optimization and Control · Mathematics 2021-02-10 Miguel D. Bustamante , Pauline Mellon , M. Victoria Velasco

Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…

Commutative Algebra · Mathematics 2009-09-17 R. S. Costas-Santos

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

Combinatorics · Mathematics 2007-05-23 Stefan Felsner , Sarah Kappes

We generalize the concept of the symmetric hyperdeterminants for symmetric tensors to the E-determinants for general tensors. We show that the E-determinant inherits many properties of the determinant of a matrix. These properties include:…

Numerical Analysis · Mathematics 2015-03-13 Shenglong Hu , Zheng-Hai Huang , Chen Ling , Liqun Qi

Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…

Dynamical Systems · Mathematics 2019-07-16 Michael Baake , John A. G. Roberts

We establish a sharp inequality between the blocks of positive partitioned matrices and conjecture a triangle type inequality for contractions: Given three contactions A,B,C, we conjecture that the constant c=3/4 is sharp in the triangle…

Functional Analysis · Mathematics 2023-12-18 Jean-Christophe Bourin , Eun-Young Lee

We study the set of all determinants of adjacency matrices of graphs with a given number of vertices.

Combinatorics · Mathematics 2009-08-25 Alireza Abdollahi

The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…

Algebraic Geometry · Mathematics 2017-01-11 Kaie Kubjas , Elina Robeva , Richard Z. Robinson

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

Combinatorics · Mathematics 2010-07-06 Milan Janjic

We develop a self-contained framework for real tridiagonal Toeplitz matrices $A_n(a,b,c)$ (diagonal $b$, subdiagonal $a$, superdiagonal $c$) in the symmetrisable regime $ac>0$. A diagonal similarity transforms $A_n(a,b,c)$ into a symmetric…

Spectral Theory · Mathematics 2026-01-27 Johann Verwee

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Representation Theory · Mathematics 2014-03-12 Tatiana G. Gerasimova , Roger A. Horn , Vladimir V. Sergeichuk

Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…

We characterize a family of number triangles whose production matrices are closely related to the original number triangle. We study a number of such triangles that are of combinatorial significance. For a specific subfamily, these…

Combinatorics · Mathematics 2018-04-19 Paul Barry

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible structures on the strictly upper triangular matrix algebra $UT_n(K)$ for all $n\ge 3$.

Rings and Algebras · Mathematics 2025-06-04 Mykola Khrypchenko

In this paper we explore a class of equivalence relations over $\N^\ast$ from which is constructed a sequence of symetric matrices related to the Mertens function. From numerical experimentations we suggest a conjecture, about the growth of…

Number Theory · Mathematics 2016-03-01 Jean-Paul Cardinal

It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…

Exactly Solvable and Integrable Systems · Physics 2015-05-13 James Atkinson

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

Information Theory · Computer Science 2021-03-11 Virgilio P. Sison , Charles R. Repizo
‹ Prev 1 4 5 6 7 8 10 Next ›