English
Related papers

Related papers: Lattice-ordered matrix algebras over real GCD-doma…

200 papers

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

Centrosymmetric matrices of order $n$ over an arbitrary algebra $R$ form a subalgebra of the full $n\times n$ matrix algebra over $R$. It is called the centrosymmetric matrix algebra of order $n$ over $R$ and denoted by $S_n(R)$. We prove…

Rings and Algebras · Mathematics 2020-02-04 Changchang Xi , Shujun Yin

In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the…

Information Theory · Computer Science 2019-05-06 Christian Porter , Shanxiang Lyu , Cong Ling

We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…

Logic in Computer Science · Computer Science 2015-07-01 Stephen A Cook , Lila A Fontes

A natural family of quantized matrix algebras is introduced. It includes the two best studied such. Located inside ${\s U}_q(A_{2n-1})$, it consists of quadratic algebras with the same Hilbert series as polynomials in $n^2$ variables. We…

Quantum Algebra · Mathematics 2007-05-23 Hans Plesner Jakobsen , Hechun Zhang

In this paper a complete description of the linear maps $\phi:W_{n}\rightarrow W_{n}$ that preserve the Lorentz spectrum is given when $n=2$ and $W_{n}$ is the space $M_{n}$ of $n\times n$ real matrices or the subspace $S_{n}$ of $M_{n}$…

Rings and Algebras · Mathematics 2022-07-19 M. I. Bueno , Susana Furtado , Aelita Klausmeier , Joey Veltri

We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…

Condensed Matter · Physics 2009-10-22 E. Brézin , A. Zee

We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…

Metric Geometry · Mathematics 2016-06-23 Daniel Dadush , Oded Regev

All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

Leibniz algebras are a non-anticommutative version of Lie algebras. They play an important role in different areas of mathematics and physics and have attracted much attention over the last thirty years. In this paper we investigate whether…

Rings and Algebras · Mathematics 2021-01-28 David A. Towers

The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…

Combinatorics · Mathematics 2026-03-02 Krasimir Yordzhev

Robbins conjectured, and Zeilberger recently proved, that there are 1!4!7!...(3n-2)!/n!/(n+1)!/.../(2n-1)! alternating sign matrices of order n. We give a new proof of this result using an analysis of the six-vertex state model (also called…

Combinatorics · Mathematics 2007-05-23 Greg Kuperberg

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

Combinatorics · Mathematics 2020-12-01 Chengcheng Yang

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Group Theory · Mathematics 2020-04-28 Georgina Bumpus , Christoph Haase , Stefan Kiefer , Paul-Ioan Stoienescu , Jonathan Tanner

Recognizing when a ring is a complete matrix ring is of significant importance in algebra. It is well-known folklore that a ring $R$ is a complete $n\times n$ matrix ring, so $R\cong M_{n}(S)$ for some ring $S$, if and only if it contains a…

Rings and Algebras · Mathematics 2019-07-12 Geir Agnarsson , Samuel S. Mendelson

The status of topology on the lattice is reviewed. Recent results show that the topological susceptibility chi can be unambigously determined. Different methods, if properly implemented, give results consistent with each other. For SU(3)…

High Energy Physics - Lattice · Physics 2007-05-23 A. Di Giacomo

In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…

Combinatorics · Mathematics 2022-10-14 R. A. Bailey , Peter J. Cameron , Michael Kinyon , Cheryl E. Praeger

We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…

Computational Complexity · Computer Science 2021-04-13 Heiko Dietrich , James B. Wilson

Let $K$ be any field, let $L_n$ denote the Leavitt algebra of type $(1,n-1)$ having coefficients in $K$, and let ${\rm M}_d(L_n)$ denote the ring of $d \times d$ matrices over $L_n$. In our main result, we show that ${\rm M}_d(L_n) \cong…

Rings and Algebras · Mathematics 2008-02-22 G. Abrams , P. N. ánh , E. Pardo

We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…

Combinatorics · Mathematics 2025-11-07 Olha Silina