English
Related papers

Related papers: On the Mortality Problem: from multiplicative matr…

200 papers

We consider the equivalence problem of four-dimensional semi-Riemannian metrics with the $2$-dimensional Abelian Killing algebra. In the generic case we determine a semi-invariant frame and a fundamental set of first-order scalar…

Differential Geometry · Mathematics 2024-03-21 D. Catalano Ferraioli , M. Marvan

Given a set $X$ of $n\times n$ matrices and a positive integer $m$, we consider the problem of estimating the cardinalities of the product sets $A_1 \dotsc A_m$, where $A_i\in X$. When $X=\mathcal M_n(\mathbb{Z};H)$, the set of $n\times n$…

Number Theory · Mathematics 2024-11-20 Muhammad Afifurrahman

We consider the problem of convergence to zero of matrix products $A_{n}B_{n}\cdots A_{1}B_{1}$ with factors from two sets of matrices, $A_{i}\in\mathscr{A}$ and $B_{i}\in\mathscr{B}$, due to a suitable choice of matrices $\{B_{i}\}$. It is…

Optimization and Control · Mathematics 2025-10-07 Victor Kozyakin

We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…

Functional Analysis · Mathematics 2007-05-23 Dmitry S. Kalyuzhny\uı-Verbovetzki\uı , Victor Vinnikov

Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…

Commutative Algebra · Mathematics 2019-02-12 Evgueni Doubtsov , Frank Kutzschebauch

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…

Combinatorics · Mathematics 2026-02-26 Brandon Koprowski , Joel Brewster Lewis

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

Computational Complexity · Computer Science 2019-04-30 Thomas Colcombet , Joël Ouaknine , Pavel Semukhin , James Worrell

We analyze families of Markov chains that arise from decomposing tensor products of irreducible representations. This illuminates the Burnside-Brauer Theorem for building irreducible representations, the McKay Correspondence, and Pitman's…

Representation Theory · Mathematics 2018-10-02 Georgia Benkart , Persi Diaconis , Martin W. Liebeck , Pham Huu Tiep

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…

Number Theory · Mathematics 2026-05-08 Parvathi S Nair , S. S. Rout

Since Cocke and Minsky proved 2-tag systems universal, they have been extensively used to prove the universality of numerous computational models. Unfortunately, all known algorithms give universal 2-tag systems that have a large number of…

Formal Languages and Automata Theory · Computer Science 2013-12-25 Turlough Neary

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

This paper is a continuation of our previous work \cite{St} where we have studied the Stokes phenomenon for a particular family of equation \eqref{initial} with \eqref{form-0}-\eqref{npe} from a perturbative point of view. Here we focus on…

Classical Analysis and ODEs · Mathematics 2019-06-25 Tsvetana Stoyanova

Let $X=X_1\sqcup X_2\sqcup\ldots\sqcup X_k$ be a partitioned set of variables such that the variables in each part $X_i$ are noncommuting but for any $i\neq j$, the variables $x\in X_i$ commute with the variables $x'\in X_j$. Given as input…

Computational Complexity · Computer Science 2024-04-12 V. Arvind , Abhranil Chatterjee , Partha Mukhopadhyay

We consider the following problem: given $d \times d$ rational matrices $A_1, \ldots, A_k$ and a polyhedral cone $\mathcal{C} \subset \mathbb{R}^d$, decide whether there exists a non-zero vector whose orbit under multiplication by $A_1,…

Logic in Computer Science · Computer Science 2023-04-20 Ruiwen Dong

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

Logic in Computer Science · Computer Science 2015-07-01 Anuj Dawar , Eryk Kopczynski , Bjarki Holm , Erich Grädel , Wied Pakusa

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

Let $k = \mathbb{Q}(\sqrt{\alpha})$ be a real quadratic number field, where $\alpha$ is a positive square-free integer. Let $\mathcal{O}_k$ be the ring of integers of $k$. In this paper, we prove that a certain set of $2 \times 2$ singular…

Number Theory · Mathematics 2020-06-02 Dong Quan Ngoc Nguyen

The following multi-determinantal algebraic variety plays a central role in algebra, algebraic geometry and computational complexity theory: ${\rm SING}_{n,m}$, consisting of all $m$-tuples of $n\times n$ complex matrices which span only…

Representation Theory · Mathematics 2019-09-04 Visu Makam , Avi Wigderson

We study the computational complexity of singularity for multilinear maps. While the determinant characterizes singularity for matrices, its multilinear analogue -- the hyperdeterminant -- is defined only in boundary format and quickly…

Computational Complexity · Computer Science 2026-04-21 Angshul Majumdar

We are concerned with the nodal set of solutions to equations of the form \begin{equation*} -\Delta u = \lambda_+ \left(u^+\right)^{q-1} - \lambda_- \left(u^-\right)^{q-1} \quad \text{in $B_1$} \end{equation*} where $\lambda_+,\lambda_- >…

Analysis of PDEs · Mathematics 2018-02-07 Nicola Soave , Susanna Terracini
‹ Prev 1 3 4 5 6 7 10 Next ›