English
Related papers

Related papers: D\'eterminant d'une matrice carr\'ee

200 papers

We provide a characterisation of when a single-element contraction of a transversal matroid is itself transversal. Using this characterisation, we define a new class of transversal matroids closed under minors, which we call path-circular…

Combinatorics · Mathematics 2025-11-18 Gerry Toft

Our purpose in this paper is to study when a planar differential system polynomial in one variable linearizes in the sense that it has an inverse integrating factor which can be constructed by means of the solutions of linear differential…

Dynamical Systems · Mathematics 2007-10-29 Hector Giacomini , Jaume Gine , Maite Grau

This paper investigates scalable frame in ${\mathbb R}^n$. We define the reduced diagram matrix of a frame and use it to classify scalability of the frame under some conditions. We give a new approach to the scaling problem by breaking the…

Functional Analysis · Mathematics 2022-11-22 Peter G. Casazza , Laura De Carli , Tin T. Tran

In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…

Combinatorics · Mathematics 2023-09-07 Flavien Mabilat

We present a simple proof of the continuity, in the sense distributions, of the minors of the differential matrices of mappings belonging to grand Sobolev spaces. Such function spaces were introduced in connection with a problem on minimal…

Functional Analysis · Mathematics 2019-02-26 Anastasia Molchanova

We study the Poincar\'e series of the mixed and pure trace rings of generic matrices. These series are known to be rational functions. We obtain an explicit formula in lowest terms in the case of $2\times2$ matrices; a denominator, which we…

Rings and Algebras · Mathematics 2022-09-07 Allan Berele

We study the deformation theory aspects of Matricial Factorizations, possibly with an orthogonal or symplectic structure. We discuss and extend the Kn\"orrer and Hori-Walcher periodicity theorems

Quantum Algebra · Mathematics 2016-08-16 José Bertin , Fabrice Rosay

We consider a discrete equation, defined on the two-dimensional square lattice, which is linearizable, namely, of the Burgers type and depends on a parameter $\alpha$. For any natural number $N$ we choose $\alpha$ so that the equation…

Exactly Solvable and Integrable Systems · Physics 2012-07-13 Rustem N. Garifullin , Ravil I. Yamilov

For a given Laurent polynomial matrix function $S$, which is positive definite on the unit circle in the complex plane, we consider all possible polynomial spectral factors of $S$ which are not necessarily invertible inside the unit circle.

Complex Variables · Mathematics 2016-09-08 L. Ephremidze , I. Selesnick , I. Spitkovsky

Using our previous results on the systematic construction of invariant differential operators for non-compact semisimple Lie groups we classify the special reduced multiplets and minimal representations in the case of SO(p,q).

Representation Theory · Mathematics 2016-07-22 V. K. Dobrev

Given k similarity classes of invertible matrices, the Deligne-Simpson problem asks to determine whether or not one can find matrices in these classes whose product is the identity and with no common invariant subspace. The first author…

Rings and Algebras · Mathematics 2026-04-16 William Crawley-Boevey , Andrew Hubery

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

Combinatorics · Mathematics 2009-09-21 Daniel Appel

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

The stated paper is dedicated to one of the inverse problems of spectral theory. It is necessary to define matrix (constant) coefficients of some quadratic pencil, if the eigenvalues of this pencil are known. Furthermore, it is known that…

Spectral Theory · Mathematics 2015-12-02 N. A. Aliyev , Y. Y. Mustafayeva , R. F. Efendiyev

We use earlier defined notion of $n$- determinant to investigate sub-determinants of an extended Vandermonde matrix. Firstly, we demonstrate our method on a number of particular cases. Then we prove that all these results may be stated in…

Combinatorics · Mathematics 2022-02-07 Milan Janjic

We give a conjectured evaluation of the determinant of a certain matrix $\tilde{D}(n,k)$. The entries of $\tilde{D}(n,k)$ are either 0 or specializations $\mathfrak{S}_w(1,\dots,1)$ of Schubert polynomials. The conjecture implies that the…

Combinatorics · Mathematics 2017-04-06 Richard P. Stanley

Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…

General Mathematics · Mathematics 2021-08-19 Lukasz Matysiak , Weronika Przewozniak , Natalia Rulinska

We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices…

Combinatorics · Mathematics 2026-05-13 Steven Finch

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

Group Theory · Mathematics 2007-05-23 Robert M. Guralnick , Martin Lorenz

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

Computational Complexity · Computer Science 2025-11-21 Istvan Miklos , Cordian Riener