English
Related papers

Related papers: Binary matrices of order 3 associated with the Pel…

200 papers

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

Computational Complexity · Computer Science 2015-03-11 Fulvio Gesmundo , Jonathan Hauenstein , Christian Ikenmeyer , JM Landsberg

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

K-Theory and Homology · Mathematics 2009-09-03 Ivo Herzog

The aim of this paper is mainly to build a new representation-theoretic realization of finite root systems through the so-called Frobenius-type triangular matrix algebras by the method of reflection functors over any field. Finally, we give…

Rings and Algebras · Mathematics 2016-03-06 Fang Li , Chang Ye

In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…

Numerical Analysis · Computer Science 2014-08-12 J. A. Rad , S. Kazem , M. Shaban , K. Parand

By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on…

Number Theory · Mathematics 2007-05-23 Jason Fulman

We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…

Representation Theory · Mathematics 2009-03-26 Marcelo Lanzilotta , Maria Julia Redondo , Rachel Taillefer

We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…

Combinatorics · Mathematics 2018-10-16 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

This paper gives an elementary proof of the result that the conjugacy classes of pairs (X,Y) of unimodular 2x2 complex matrices is an affine 3-space, parametrized by the traces of X, Y and XY. Identities for triples of elements of SL(2,C)…

General Mathematics · Mathematics 2007-05-23 William M. Goldman

This paper introduces and investigates the structure of $\delta$-Leibniz algebras, which serve as a parametric generalization of classical Leibniz algebras defined by a scalar $\delta$. The authors define $\delta$-Lie algebras, $\delta$-Lie…

Rings and Algebras · Mathematics 2026-02-26 Jobir Adashev , Ivan Kaygorodov

In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…

Symbolic Computation · Computer Science 2024-10-23 Hamid Rahkooy

We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…

Commutative Algebra · Mathematics 2009-03-18 Dragomir Z. Djokovic , Benjamin H. Smith

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Logic · Mathematics 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

We generalize the solution of linear recurrence relations from fields to central division algebras, adapting the standard tools of companion matrices and characteristic polynomials to the non-commutative setting. We then solve linear…

Rings and Algebras · Mathematics 2025-09-23 Adam Chapman , Solomon Vishkautsan

We construct the fine moduli space of log abelian varieties with PEL structure, which gives a toroidal compactification of the moduli space of abelian varieties with PEL structure.

Algebraic Geometry · Mathematics 2022-05-24 Takeshi Kajiwara , Kazuya Kato , Chikara Nakayama

In this paper, the integral representations of the $k$-Pell and $k$-Pell-Lucas numbers are presented. Using Binet's formulas for these numbers, we obtain a number of identities and use elementary integral calculus to confirm their integral…

Number Theory · Mathematics 2025-07-02 Achariya Nilsrakoo , Weerayuth Nilsrakoo

The paper studies algebraic independence of certain reciprocal sums of Fibonacci and Lucas sequences. Also more general binary recurrences are considered. The main tool is Mahler's method reducing the investigation of the algebraic…

Number Theory · Mathematics 2014-03-24 Peter Bundschuh , Keijo Väänänen

In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…

Combinatorics · Mathematics 2011-04-08 Bruce W. Westbury

The aim of this paper is to give some combinatorial relations linked polynomials generalizing those of Appell type to the partial r-Bell polynomials. We give an inverse relation, recurrence relations involving some family of polynomials and…

Combinatorics · Mathematics 2018-03-13 Miloud Mihoubi , Yamina Saidi

The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their…

Discrete Mathematics · Computer Science 2013-06-11 Mark Korenblit , Vadim E. Levit

We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…

Combinatorics · Mathematics 2025-10-16 Ethan D. Bolker , Debra K. Borkovitz , Katelyn Lee
‹ Prev 1 8 9 10 Next ›