English
Related papers

Related papers: Counting $2\times2$ integer matrices with fixed tr…

200 papers

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…

Numerical Analysis · Computer Science 2007-07-19 Gernot Schaller

In this paper we count the number of some particular 2n x 9 n-times rank i matrices over F_2.

Number Theory · Mathematics 2012-04-17 Jorgen Cherly

In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…

Number Theory · Mathematics 2020-09-15 Mircea Merca

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

Combinatorics · Mathematics 2025-09-30 Marin Knežević , Vedran Krčadinac , Lucija Relić

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Combinatorics · Mathematics 2022-03-01 Tristram Bogart , Juan Andrés Valero

We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…

Dynamical Systems · Mathematics 2020-01-08 Natalia Jurga , Ian Morris

We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…

Group Theory · Mathematics 2025-06-06 Gemma Bastardas , Enric Ventura

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Combinatorics · Mathematics 2018-05-11 Erik Thörnblad , Jakob Zimmermann

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

Number Theory · Mathematics 2025-09-19 Pavlo Yatsyna , Błażej Żmija

We study the structure of unit weighing matrices of order n and weights 2, 3 and 4. We show that the number of inequivalent unit weighing matrices UW(n,4) depends on the number of decompositions of n into sums of non-negative multiples of…

Combinatorics · Mathematics 2012-12-11 Darcy Best , Hadi Kharaghani , Hugh Ramp

We introduce a family of weight matrices $W$ of the form $T(t)T^*(t)$, $T(t)=e^{\mathscr{A}t}e^{\mathscr{D}t^2}$, where $\mathscr{A}$ is certain nilpotent matrix and $\mathscr{D}$ is a diagonal matrix with negative real entries. The weight…

Classical Analysis and ODEs · Mathematics 2011-02-09 Jorge Borrego , Mirta Castro , Antonio J. Durán

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

Number Theory · Mathematics 2015-01-14 Artūras Dubickas , Min Sha

We propose a non-commutative algorithm for multiplying 2x2 matrices using 7 coefficient products. This algorithm reaches simultaneously a better accuracy in practice compared to previously known such fast algorithms, and a time complexity…

Numerical Analysis · Mathematics 2024-07-01 Jean-Guillaume Dumas , Clément Pernet , Alexandre Sedoglavic

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…

Rings and Algebras · Mathematics 2023-04-21 Chris Heunen , Dominic Horsman

A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…

Commutative Algebra · Mathematics 2020-01-01 M. Domokos

If a noncommutative polynomial $f$ is neither an identity nor a central polynomial of $\mathcal A=M_n(\C)$, then every trace zero matrix in $\mathcal A$ can be written as a sum of two matrices from $f(\mathcal A)-f(\mathcal A)$. Moreover,…

Rings and Algebras · Mathematics 2021-03-22 Matej Bresar , Peter Semrl

In this paper we construct two types of Hessenberg matrices with the properties that every weighted isobaric polynomial (WIP) appears as a determinant of one of them, and as the permanent of the other. Every integer sequence which is…

Number Theory · Mathematics 2012-09-21 Huilan Li , Trueman MacHenry

We exhibit a Cayley-Hamilton trace identity for $2\times2$ matrices with entries in a ring $R$ satisfying $[[x,y],[x,z]]=0$ and 1/2 \in R$.

Rings and Algebras · Mathematics 2011-07-01 Johan Meyer , Jeno Szigeti , Leon van Wyk

In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…

Number Theory · Mathematics 2007-05-23 A. S. Gadre , S. A. Katre