English
Related papers

Related papers: Upper triangular matrices and Billiard Arrays

200 papers

Let $M_{\kappa }$ be the three-dimensional space form of constant curvature $\kappa =0,1,-1$, that is, Euclidean space $\mathbb{R}^{3}$, the sphere $S^{3} $, or hyperbolic space $H^{3}$. Let $S$ be a smooth, closed, strictly convex surface…

Dynamical Systems · Mathematics 2025-03-11 Yamile Godoy , Michael Harrison , Marcos Salvai

Let F be a field of characteristic 0. We consider the algebra UT_m(F) of upper triangular matrices of order m endowed with na elementar Z_m-grading induced by the m-tuple phi=(0,0,1,...,m-2), then we compute its Y-proper graded cocharacter…

Rings and Algebras · Mathematics 2014-07-08 Lucio Centrone , Alessio Cirrito

Let $\mathbb{F}$ be a finite field of odd characteristic. When $|\mathbb{F}|\ge 5$, we prove that every matrix $A$ admits a decomposition into $D+M$ where $D$ is diagonalizable and $M^2=0$. For $\mathbb{F}=\mathbb{F}_3$, we show that such…

Rings and Algebras · Mathematics 2026-04-20 Peter Danchev , Esther García , Miguel Gómez Lozano

It was shown recently that the f-diagonal tensor in the T-SVD factorization must satisfy some special properties. Such f-diagonal tensors are called s-diagonal tensors. In this paper, we show that such a discussion can be extended to any…

Numerical Analysis · Mathematics 2021-06-15 Liqun Qi , Ziyan Luo

We study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…

Number Theory · Mathematics 2025-03-03 Yangcheng Li

It has long been known that the set of primitive pythagorean triples can be enumerated by descending certain ternary trees. We unify these treatments by considering hyperbolic billiard tables in the Poincare disk model. Our tables have m>=3…

Number Theory · Mathematics 2020-01-23 Giovanni Panti

Given a space X we study the topology of the space of embeddings of X into $\mathbb{R}^d$ through the combinatorics of triangulations of X. We give a simple combinatorial formula for upper bounds for the largest dimension of a sphere that…

Geometric Topology · Mathematics 2020-10-26 Florian Frick , Michael Harrison

We investigate the line arrangement that results from intersecting d complete flags in C^n. We give a combinatorial description of the matroid T_{n,d} that keeps track of the linear dependence relations among these lines. We prove that the…

Combinatorics · Mathematics 2007-05-23 Federico Ardila , Sara Billey

This paper addresses the question whether triple arrays can be constructed from Youden squares developed from difference sets. We prove that if the difference set is abelian, then having $-1$ as multiplier is both a necessary and sufficient…

Combinatorics · Mathematics 2019-05-31 Tomas Nilson , Peter J. Cameron

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy both conditions below: (i) There exists a basis for $V$…

Rings and Algebras · Mathematics 2007-05-23 Paul Terwilliger

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. Let $End(V)$ denote the $K$-algebra consisting of all $K$-linear transformations from $V$ to $V$. We consider a pair $A,A^* \in End(V)$ that…

Rings and Algebras · Mathematics 2008-01-07 Kazumasa Nomura , Paul Terwilliger

We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…

Classical Analysis and ODEs · Mathematics 2015-05-30 A. Carmona , A. M. Encinas , S. Gago , M. J. Jiménez , M. Mitjana

It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…

Combinatorics · Mathematics 2024-10-07 Ákos K. Matszangosz , Ferenc Szöllősi

We discuss an interesting duality known to occur for certain complex reflection groups, namely the duality groups. Our main construction yields a concrete, representation theoretic realisation of this duality. This allows us to naturally…

Rings and Algebras · Mathematics 2020-07-20 Benjamin Briggs

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

Let $\mathbb F$ denote a field, and let $V$ denote a vector space over $\mathbb F$ with finite positive dimension. We consider an ordered pair of $\mathbb F$-linear maps $A: V \to V$ and $A^*:V\to V$ such that (i) each of $A,A^*$ is…

Quantum Algebra · Mathematics 2020-06-05 Paul Terwilliger

There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…

Combinatorics · Mathematics 2024-05-28 Peter Frankl , Zoltán Füredi , Ido Goorevitch , Ron Holzman , Gábor Simonyi

Consider an N x N matrix A for which zero is a defective eigenvalue. In this case, the algebraic multiplicity of the zero eigenvalue is greater than the geometric multiplicity. We show how an inflated (N+1) x (N+1) matrix L can be…

Mathematical Physics · Physics 2007-05-23 S. Setayeshgar , H. B. Keller , J. E. Pearson

We determine the numbers of integral tetrahedra with diameter $d$ up to isomorphism for all $d\le 1000$ via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most $d$ in $O(d^5)$…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz