English
Related papers

Related papers: Determinants and Limit Systems in some Idempotent …

200 papers

In this note we describe conditions under which, in idempotent functional analysis, linear operators have integral representations in terms of idempotent integral of V. P. Maslov. We define the notion of nuclear idempotent semimodule and…

Functional Analysis · Mathematics 2007-05-23 Grigori Litvinov , Grigori Shpiz

For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…

Combinatorics · Mathematics 2024-07-09 Jens Niklas Eberhardt , Carl Mautner

For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…

Probability · Mathematics 2022-01-04 Tapesh Yadav

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

Discrete Mathematics · Computer Science 2025-07-28 David Russinoff

We investigate the relation between the spectrum of a non-normal matrix and the norm of its resolvent. We provide spectral estimates for the resolvent of matrices whose largest singular value is bounded by $1$ (so-called Hilbert space…

Spectral Theory · Mathematics 2015-01-16 Oleg Szehr

We prove an identity relating the permanent of a rank $2$ matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the…

Combinatorics · Mathematics 2021-08-11 Adam W. Marcus

The Hadamard maximal determinant problem asks for the largest n-by-n determinant with entries in {+1,-1}. When n is congruent to 1 (mod 4), the maximal excess construction of Farmakis & Kounias has been the most successful general method…

Combinatorics · Mathematics 2007-05-23 William P. Orrick , Bruce Solomon

We propose a novel linear discriminant analysis approach for the classification of high-dimensional matrix-valued data that commonly arises from imaging studies. Motivated by the equivalence of the conventional linear discriminant analysis…

Methodology · Statistics 2019-05-06 Wei Hu , Weining Shen , Hua Zhou , Dehan Kong

This work considers normalized inverse determinant sums as a tool for analyzing the performance of division algebra based space-time codes for multiple antenna wireless systems. A general union bound based code design criterion is obtained…

Information Theory · Computer Science 2014-03-26 Laura Luzzi , Roope Vehkalahti

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

Algebraic Geometry · Mathematics 2015-01-14 Jan Draisma , Jochen Kuttler

Springer resolution of the set of nilpotent elements in a semisimple Lie algebra plays a central role in geometric representation theory. A new structure on this variety has arisen in several representation theoretic constructions, such as…

Representation Theory · Mathematics 2007-05-23 Roman Bezrukavnikov

When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…

Spectral Theory · Mathematics 2009-11-11 Amaury Mouchet

We propose a general algorithm of constructing an extended formulation for any given set of linear constraints with integer coefficients. Our algorithm consists of two phases: first construct a decision diagram $(V,E)$ that somehow…

Data Structures and Algorithms · Computer Science 2023-09-07 Yuta Kurokawa , Ryotaro Mitsuboshi , Haruki Hamasaki , Kohei Hatano , Eiji Takimoto , Holakou Rahmanian

We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…

Rings and Algebras · Mathematics 2012-08-13 Andreas Kendziorra , Stefan E. Schmidt , Jens Zumbrägel

Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…

Logic · Mathematics 2016-08-04 Wen Chean Teh

Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…

Logic in Computer Science · Computer Science 2025-09-03 Jakub Rydval

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

Algebraic Geometry · Mathematics 2026-04-23 Chia-Yu Chang , Fulvio Gesmundo , Jeroen Zuiddam

We study the symmetry properties of limit profiles of nonautonomous nonlinear parabolic systems with Dirichlet boundary conditions in radial bounded domains. In the case of competitive systems, we show that if the initial profiles satisfy a…

Analysis of PDEs · Mathematics 2015-05-20 Alberto Saldaña

In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as…

Symbolic Computation · Computer Science 2016-06-21 Christoph Koutschan , Martin Neumüller , Cristian-Silviu Radu

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…

Algebraic Geometry · Mathematics 2020-11-10 Weronika Buczyńska , Jarosław Buczyński
‹ Prev 1 8 9 10 Next ›